@rocicorp/zero 1.11.0-canary.4 → 1.11.0-canary.41

package/out/zqlite/src/query-builder.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-builder.js","names":[],"sources":["../../../../zqlite/src/query-builder.ts"],"sourcesContent":["import type {SQLQuery} from '@databases/sql';\nimport {assert} from '../../shared/src/asserts.ts';\nimport type {\n  Condition,\n  Ordering,\n  SimpleCondition,\n  ValuePosition,\n} from '../../zero-protocol/src/ast.ts';\nimport type {\n  SchemaValue,\n  ValueType,\n} from '../../zero-schema/src/table-schema.ts';\nimport type {Constraint} from '../../zql/src/ivm/constraint.ts';\nimport type {MultiConstraint, Start} from '../../zql/src/ivm/operator.ts';\nimport {sql} from './internal/sql.ts';\n\n/**\n * Condition type without correlated subqueries.\n * This matches the output of transformFilters from zql/builder/filter.ts\n */\nexport type NoSubqueryCondition = Exclude<\n  Condition,\n  {type: 'correlatedSubquery'}\n>;\n\nexport function buildSelectQuery(\n  tableName: string,\n  columns: Record<string, SchemaValue>,\n  constraint: Constraint | undefined,\n  filters: NoSubqueryCondition | undefined,\n  order: Ordering | undefined,\n  reverse: boolean | undefined,\n  start: Start | undefined,\n  multiConstraints?: readonly MultiConstraint[] | undefined,\n  fetchFilters?: NoSubqueryCondition | undefined,\n) {\n  let query = sql`SELECT ${sql.join(\n    Object.keys(columns).map(c => sql.ident(c)),\n    sql`,`,\n  )} FROM ${sql.ident(tableName)}`;\n  const constraints: SQLQuery[] = constraintsToSQL(constraint, columns);\n\n  if (multiConstraints) {\n    for (const mc of multiConstraints) {\n      if (mc.length > 0) {\n        constraints.push(multiConstraintToSQL(mc, columns));\n      }\n    }\n  }\n\n  if (start) {\n    assert(order !== undefined, 'start requires ordering');\n    constraints.push(gatherStartConstraints(start, reverse, order, columns));\n  }\n\n  if (filters) {\n    constraints.push(filtersToSQL(filters));\n  }\n\n  if (fetchFilters) {\n    constraints.push(filtersToSQL(fetchFilters));\n  }\n\n  if (constraints.length > 0) {\n    query = sql`${query} WHERE ${sql.join(constraints, sql` AND `)}`;\n  }\n\n  if (order && order.length > 0) {\n    return sql`${query} ${orderByToSQL(order, !!reverse)}`;\n  }\n  return query;\n}\n\nexport function constraintsToSQL(\n  constraint: Constraint | undefined,\n  columns: Record<string, SchemaValue>,\n) {\n  if (!constraint) {\n    return [];\n  }\n\n  const constraints: SQLQuery[] = [];\n  for (const [key, value] of Object.entries(constraint)) {\n    constraints.push(\n      sql`${sql.ident(key)} = ${toSQLiteType(value, columns[key].type)}`,\n    );\n  }\n\n  return constraints;\n}\n\n/**\n * Builds a single batched IN clause from a `MultiConstraint`. All entries\n * are assumed to share the same shape (the keys of the first entry);\n * FlippedJoin derives them from the same parentKey for all children.\n *\n * Single-column form: `col IN (?, ?, ?)`\n * Compound form:      `(a, b) IN (VALUES (?, ?), (?, ?), …)`\n *\n * NOTE: SQLite optimizes `col IN (literal-list)` using the column's index;\n * verified via EXPLAIN QUERY PLAN — see query-builder.test.ts.\n */\nexport function multiConstraintToSQL(\n  multiConstraint: MultiConstraint,\n  columns: Record<string, SchemaValue>,\n): SQLQuery {\n  assert(multiConstraint.length > 0, 'multiConstraint must be non-empty');\n  // All entries share the same keys; pull the column list from the first.\n  const keys = Object.keys(multiConstraint[0]);\n  assert(keys.length > 0, 'multiConstraint entries must have at least one key');\n  // Subsequent entries must share the first entry's shape — the SQL form\n  // is `(col_a, col_b, …) IN VALUES (…)`, with one binding per key per\n  // entry. Heterogeneous keys would silently produce incorrect bindings.\n  for (let i = 1; i < multiConstraint.length; i++) {\n    const entry = multiConstraint[i];\n    assert(\n      Object.keys(entry).length === keys.length && keys.every(k => k in entry),\n      () =>\n        `multiConstraint entries must share the same keys (entry 0: [${keys.join(\n          ',',\n        )}], entry ${i}: [${Object.keys(entry).join(',')}])`,\n    );\n  }\n\n  if (keys.length === 1) {\n    const key = keys[0];\n    const colType = columns[key].type;\n    return sql`${sql.ident(key)} IN (${sql.join(\n      multiConstraint.map(c => sql`${toSQLiteType(c[key], colType)}`),\n      sql`,`,\n    )})`;\n  }\n\n  // Compound: `(col_a, col_b, …) IN (VALUES (?, ?, …), …)`\n  const colList = sql`(${sql.join(\n    keys.map(k => sql.ident(k)),\n    sql`,`,\n  )})`;\n  const rows = multiConstraint.map(\n    c =>\n      sql`(${sql.join(\n        keys.map(k => sql`${toSQLiteType(c[k], columns[k].type)}`),\n        sql`,`,\n      )})`,\n  );\n  return sql`${colList} IN (VALUES ${sql.join(rows, sql`,`)})`;\n}\n\nexport function orderByToSQL(order: Ordering, reverse: boolean): SQLQuery {\n  if (reverse) {\n    return sql`ORDER BY ${sql.join(\n      order.map(\n        s =>\n          sql`${sql.ident(s[0])} ${sql.__dangerous__rawValue(\n            s[1] === 'asc' ? 'desc' : 'asc',\n          )}`,\n      ),\n      sql`, `,\n    )}`;\n  } else {\n    return sql`ORDER BY ${sql.join(\n      order.map(\n        s => sql`${sql.ident(s[0])} ${sql.__dangerous__rawValue(s[1])}`,\n      ),\n      sql`, `,\n    )}`;\n  }\n}\n\n/**\n * Converts filters (conditions) to SQL WHERE clause.\n * This applies all filters present in the AST for a query to the source.\n */\nexport function filtersToSQL(filters: NoSubqueryCondition): SQLQuery {\n  switch (filters.type) {\n    case 'simple':\n      return simpleConditionToSQL(filters);\n    case 'and':\n      return filters.conditions.length > 0\n        ? sql`(${sql.join(\n            filters.conditions.map(condition =>\n              filtersToSQL(condition as NoSubqueryCondition),\n            ),\n            sql` AND `,\n          )})`\n        : sql`TRUE`;\n    case 'or':\n      return filters.conditions.length > 0\n        ? sql`(${sql.join(\n            filters.conditions.map(condition =>\n              filtersToSQL(condition as NoSubqueryCondition),\n            ),\n            sql` OR `,\n          )})`\n        : sql`FALSE`;\n  }\n}\n\nfunction simpleConditionToSQL(filter: SimpleCondition): SQLQuery {\n  const {op} = filter;\n  if (op === 'IN' || op === 'NOT IN') {\n    switch (filter.right.type) {\n      case 'literal':\n        return sql`${valuePositionToSQL(\n          filter.left,\n        )} ${sql.__dangerous__rawValue(\n          filter.op,\n        )} (SELECT value FROM json_each(${JSON.stringify(\n          filter.right.value,\n        )}))`;\n      case 'static':\n        throw new Error(\n          'Static parameters must be replaced before conversion to SQL',\n        );\n    }\n  }\n  if (\n    op === 'LIKE' ||\n    op === 'NOT LIKE' ||\n    op === 'ILIKE' ||\n    op === 'NOT ILIKE'\n  ) {\n    return likeConditionToSQL(filter);\n  }\n\n  if (\n    (op === 'IS' || op === 'IS NOT') &&\n    filter.right.type === 'literal' &&\n    filter.right.value === null\n  ) {\n    return sql`${valuePositionToSQL(filter.left)} ${sql.__dangerous__rawValue(\n      op,\n    )} NULL`;\n  }\n\n  return sql`${valuePositionToSQL(filter.left)} ${sql.__dangerous__rawValue(\n    filter.op,\n  )} ${valuePositionToSQL(filter.right)}`;\n}\n\nfunction likeConditionToSQL(filter: SimpleCondition): SQLQuery {\n  const {op} = filter;\n  // Mirror Postgres pattern-matching semantics:\n  //  * LIKE is case-sensitive. The replica connection runs with\n  //    `PRAGMA case_sensitive_like = ON` (see db.ts), so the bare LIKE\n  //    operator is case-sensitive.\n  //  * ILIKE is case-insensitive. We lower() both operands using the\n  //    Unicode-aware lower() that @rocicorp/zero-sqlite3 provides via ICU,\n  //    mirroring the toLowerCase() used by the in-memory IVM matcher\n  //    (see zql/src/builder/like.ts).\n  //  * Backslash is the default escape character in Postgres and in the IVM\n  //    matcher, but SQLite has no default, so we specify `ESCAPE '\\'`\n  //    explicitly. The SQL literal '\\' is a single backslash (SQLite does not\n  //    process backslash escapes inside string literals).\n  const caseInsensitive = op === 'ILIKE' || op === 'NOT ILIKE';\n  const negated = op === 'NOT LIKE' || op === 'NOT ILIKE';\n  const likeOp = sql.__dangerous__rawValue(negated ? 'NOT LIKE' : 'LIKE');\n\n  const left = valuePositionToSQL(filter.left);\n  const right = valuePositionToSQL(filter.right);\n  if (caseInsensitive) {\n    return sql`lower(${left}) ${likeOp} lower(${right}) ESCAPE '\\\\'`;\n  }\n  return sql`${left} ${likeOp} ${right} ESCAPE '\\\\'`;\n}\n\nfunction valuePositionToSQL(value: ValuePosition): SQLQuery {\n  switch (value.type) {\n    case 'column':\n      return sql.ident(value.name);\n    case 'literal':\n      return sql`${toSQLiteType(value.value, getJsType(value.value))}`;\n    case 'static':\n      throw new Error(\n        'Static parameters must be replaced before conversion to SQL',\n      );\n  }\n}\n\nfunction getJsType(value: unknown): ValueType {\n  if (value === null) {\n    return 'null';\n  }\n  return typeof value === 'string'\n    ? 'string'\n    : typeof value === 'number'\n      ? 'number'\n      : typeof value === 'boolean'\n        ? 'boolean'\n        : 'json';\n}\n\nexport function toSQLiteType(v: unknown, type: ValueType): unknown {\n  switch (type) {\n    case 'boolean':\n      return v === null ? null : v ? 1 : 0;\n    case 'number':\n    case 'string':\n    case 'null':\n      return v;\n    case 'json':\n      return JSON.stringify(v);\n  }\n}\n\nfunction nullableAwareEquality(\n  field: string,\n  value: unknown,\n  columnType: SchemaValue,\n): SQLQuery {\n  if (value === null) {\n    // A NULL bound value proves the column is nullable regardless of the\n    // column metadata, and `=` never matches NULL — `IS` selects the NULL\n    // tie-break group a cursor anchored on a NULL value needs.\n    return sql`${sql.ident(field)} IS NULL`;\n  }\n  // Use = instead of IS for non-nullable columns to enable better\n  // index usage in SQLite.\n  return columnType.optional === true\n    ? sql`${sql.ident(field)} IS ${value}`\n    : sql`${sql.ident(field)} = ${value}`;\n}\n\nfunction nullableAwareRangeComparison(\n  field: string,\n  value: unknown,\n  operator: '>' | '<',\n  columnType: SchemaValue,\n): SQLQuery {\n  if (value === null) {\n    return operator === '>' ? sql`${sql.ident(field)} IS NOT NULL` : sql`FALSE`;\n  }\n\n  // For non-nullable columns, skip IS NULL checks to avoid breaking\n  // SQLite's MULTI-INDEX OR optimization, which falls back to a full\n  // table scan when any OR branch involves NULL.\n  // See: https://github.com/rocicorp/mono/pull/5542\n  const comparison = sql`${sql.ident(field)} ${sql.__dangerous__rawValue(\n    operator,\n  )} ${value}`;\n  if (columnType.optional !== true) {\n    return comparison;\n  }\n\n  // The bound is non-NULL here. NULLs sort before every non-NULL value, so\n  // `>` already excludes them and needs no guard, while `<` must admit the\n  // NULL group explicitly — a bare `col < ?` would silently drop NULL rows\n  // from a backward walk.\n  return operator === '>'\n    ? comparison\n    : sql`(${sql.ident(field)} IS NULL OR ${comparison})`;\n}\n\nfunction sargableLeadingStartBound(\n  field: string,\n  value: unknown,\n  operator: '>' | '<',\n  columnType: SchemaValue,\n): SQLQuery | undefined {\n  // A NULL bound value proves the column is nullable regardless of the\n  // column metadata, and a bare range bound is not sound there: `col >= NULL`\n  // is never true, so instead of being redundant it would annihilate the\n  // whole start constraint. A nullable column also cannot use a `<` bound,\n  // because the start constraint must retain the NULL group. For `>`, NULLs\n  // sort before the non-NULL bound, so `col >= value` remains sound.\n  if (value === null || (columnType.optional === true && operator === '<')) {\n    return undefined;\n  }\n\n  const inclusiveOperator = operator === '>' ? '>=' : '<=';\n  return sql`${sql.ident(field)} ${sql.__dangerous__rawValue(\n    inclusiveOperator,\n  )} ${value}`;\n}\n\n/**\n * The ordering could be complex such as:\n * `ORDER BY a ASC, b DESC, c ASC`\n *\n * In those cases, we need to encode the constraints as various\n * `OR` clauses.\n *\n * E.g.,\n *\n * to get the row after (a = 1, b = 2, c = 3) would be:\n *\n * `WHERE a > 1 OR (a = 1 AND b < 2) OR (a = 1 AND b = 2 AND c > 3)`\n *\n * - after vs before flips the comparison operators.\n * - inclusive adds a final `OR` clause for the exact match.\n */\nfunction gatherStartConstraints(\n  start: Start,\n  reverse: boolean | undefined,\n  order: Ordering,\n  columnTypes: Record<string, SchemaValue>,\n): SQLQuery {\n  const constraints: SQLQuery[] = [];\n  const {row: from, basis} = start;\n  let leadingBound: SQLQuery | undefined;\n\n  for (let i = 0; i < order.length; i++) {\n    const group: SQLQuery[] = [];\n    const [iField, iDirection] = order[i];\n    for (let j = 0; j <= i; j++) {\n      if (j === i) {\n        const columnType = columnTypes[iField];\n        const constraintValue = toSQLiteType(\n          from[iField] ?? null,\n          columnType.type,\n        );\n        const operator =\n          iDirection === 'asc' ? (reverse ? '<' : '>') : reverse ? '>' : '<';\n        if (i === 0) {\n          leadingBound = sargableLeadingStartBound(\n            iField,\n            constraintValue,\n            operator,\n            columnType,\n          );\n        }\n        group.push(\n          nullableAwareRangeComparison(\n            iField,\n            constraintValue,\n            operator,\n            columnType,\n          ),\n        );\n      } else {\n        const [jField] = order[j];\n        const columnType = columnTypes[jField];\n        const value = toSQLiteType(from[jField] ?? null, columnType.type);\n        group.push(nullableAwareEquality(jField, value, columnType));\n      }\n    }\n    constraints.push(sql`(${sql.join(group, sql` AND `)})`);\n  }\n\n  if (basis === 'at') {\n    constraints.push(\n      sql`(${sql.join(\n        order.map(([field]) => {\n          const columnType = columnTypes[field];\n          const value = toSQLiteType(from[field] ?? null, columnType.type);\n          return nullableAwareEquality(field, value, columnType);\n        }),\n        sql` AND `,\n      )})`,\n    );\n  }\n\n  const lexicographicStart = sql`(${sql.join(constraints, sql` OR `)})`;\n  return leadingBound === undefined\n    ? lexicographicStart\n    : sql`(${leadingBound} AND ${lexicographicStart})`;\n}\n"],"mappings":";;;AAyBA,SAAgB,iBACd,WACA,SACA,YACA,SACA,OACA,SACA,OACA,kBACA,cACA;CACA,IAAI,QAAQ,GAAG,UAAU,IAAI,KAC3B,OAAO,KAAK,OAAO,EAAE,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAC1C,GAAG,GACL,EAAE,QAAQ,IAAI,MAAM,SAAS;CAC7B,MAAM,cAA0B,iBAAiB,YAAY,OAAO;CAEpE,IAAI;OACG,MAAM,MAAM,kBACf,IAAI,GAAG,SAAS,GACd,YAAY,KAAK,qBAAqB,IAAI,OAAO,CAAC;CAAA;CAKxD,IAAI,OAAO;EACT,OAAO,UAAU,KAAA,GAAW,yBAAyB;EACrD,YAAY,KAAK,uBAAuB,OAAO,SAAS,OAAO,OAAO,CAAC;CACzE;CAEA,IAAI,SACF,YAAY,KAAK,aAAa,OAAO,CAAC;CAGxC,IAAI,cACF,YAAY,KAAK,aAAa,YAAY,CAAC;CAG7C,IAAI,YAAY,SAAS,GACvB,QAAQ,GAAG,GAAG,MAAM,SAAS,IAAI,KAAK,aAAa,GAAG,OAAO;CAG/D,IAAI,SAAS,MAAM,SAAS,GAC1B,OAAO,GAAG,GAAG,MAAM,GAAG,aAAa,OAAO,CAAC,CAAC,OAAO;CAErD,OAAO;AACT;AAEA,SAAgB,iBACd,YACA,SACA;CACA,IAAI,CAAC,YACH,OAAO,CAAC;CAGV,MAAM,cAA0B,CAAC;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,UAAU,GAClD,YAAY,KACV,GAAG,GAAG,IAAI,MAAM,GAAG,EAAE,KAAK,aAAa,OAAO,QAAQ,KAAK,IAAI,GACjE;CAGF,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,qBACd,iBACA,SACU;CACV,OAAO,gBAAgB,SAAS,GAAG,mCAAmC;CAEtE,MAAM,OAAO,OAAO,KAAK,gBAAgB,EAAE;CAC3C,OAAO,KAAK,SAAS,GAAG,oDAAoD;CAI5E,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;EAC/C,MAAM,QAAQ,gBAAgB;EAC9B,OACE,OAAO,KAAK,KAAK,EAAE,WAAW,KAAK,UAAU,KAAK,OAAM,MAAK,KAAK,KAAK,SAErE,+DAA+D,KAAK,KAClE,GACF,EAAE,WAAW,EAAE,KAAK,OAAO,KAAK,KAAK,EAAE,KAAK,GAAG,EAAE,GACrD;CACF;CAEA,IAAI,KAAK,WAAW,GAAG;EACrB,MAAM,MAAM,KAAK;EACjB,MAAM,UAAU,QAAQ,KAAK;EAC7B,OAAO,GAAG,GAAG,IAAI,MAAM,GAAG,EAAE,OAAO,IAAI,KACrC,gBAAgB,KAAI,MAAK,GAAG,GAAG,aAAa,EAAE,MAAM,OAAO,GAAG,GAC9D,GAAG,GACL,EAAE;CACJ;CAGA,MAAM,UAAU,GAAG,IAAI,IAAI,KACzB,KAAK,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAC1B,GAAG,GACL,EAAE;CACF,MAAM,OAAO,gBAAgB,KAC3B,MACE,GAAG,IAAI,IAAI,KACT,KAAK,KAAI,MAAK,GAAG,GAAG,aAAa,EAAE,IAAI,QAAQ,GAAG,IAAI,GAAG,GACzD,GAAG,GACL,EAAE,EACN;CACA,OAAO,GAAG,GAAG,QAAQ,cAAc,IAAI,KAAK,MAAM,GAAG,GAAG,EAAE;AAC5D;AAEA,SAAgB,aAAa,OAAiB,SAA4B;CACxE,IAAI,SACF,OAAO,GAAG,YAAY,IAAI,KACxB,MAAM,KACJ,MACE,GAAG,GAAG,IAAI,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,sBAC3B,EAAE,OAAO,QAAQ,SAAS,KAC5B,GACJ,GACA,GAAG,IACL;MAEA,OAAO,GAAG,YAAY,IAAI,KACxB,MAAM,KACJ,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,sBAAsB,EAAE,EAAE,GAC9D,GACA,GAAG,IACL;AAEJ;;;;;AAMA,SAAgB,aAAa,SAAwC;CACnE,QAAQ,QAAQ,MAAhB;EACE,KAAK,UACH,OAAO,qBAAqB,OAAO;EACrC,KAAK,OACH,OAAO,QAAQ,WAAW,SAAS,IAC/B,GAAG,IAAI,IAAI,KACT,QAAQ,WAAW,KAAI,cACrB,aAAa,SAAgC,CAC/C,GACA,GAAG,OACL,EAAE,KACF,GAAG;EACT,KAAK,MACH,OAAO,QAAQ,WAAW,SAAS,IAC/B,GAAG,IAAI,IAAI,KACT,QAAQ,WAAW,KAAI,cACrB,aAAa,SAAgC,CAC/C,GACA,GAAG,MACL,EAAE,KACF,GAAG;CACX;AACF;AAEA,SAAS,qBAAqB,QAAmC;CAC/D,MAAM,EAAC,OAAM;CACb,IAAI,OAAO,QAAQ,OAAO,UACxB,QAAQ,OAAO,MAAM,MAArB;EACE,KAAK,WACH,OAAO,GAAG,GAAG,mBACX,OAAO,IACT,EAAE,GAAG,IAAI,sBACP,OAAO,EACT,EAAE,gCAAgC,KAAK,UACrC,OAAO,MAAM,KACf,EAAE;EACJ,KAAK,UACH,MAAM,IAAI,MACR,6DACF;CACJ;CAEF,IACE,OAAO,UACP,OAAO,cACP,OAAO,WACP,OAAO,aAEP,OAAO,mBAAmB,MAAM;CAGlC,KACG,OAAO,QAAQ,OAAO,aACvB,OAAO,MAAM,SAAS,aACtB,OAAO,MAAM,UAAU,MAEvB,OAAO,GAAG,GAAG,mBAAmB,OAAO,IAAI,EAAE,GAAG,IAAI,sBAClD,EACF,EAAE;CAGJ,OAAO,GAAG,GAAG,mBAAmB,OAAO,IAAI,EAAE,GAAG,IAAI,sBAClD,OAAO,EACT,EAAE,GAAG,mBAAmB,OAAO,KAAK;AACtC;AAEA,SAAS,mBAAmB,QAAmC;CAC7D,MAAM,EAAC,OAAM;CAab,MAAM,kBAAkB,OAAO,WAAW,OAAO;CACjD,MAAM,UAAU,OAAO,cAAc,OAAO;CAC5C,MAAM,SAAS,IAAI,sBAAsB,UAAU,aAAa,MAAM;CAEtE,MAAM,OAAO,mBAAmB,OAAO,IAAI;CAC3C,MAAM,QAAQ,mBAAmB,OAAO,KAAK;CAC7C,IAAI,iBACF,OAAO,GAAG,SAAS,KAAK,IAAI,OAAO,SAAS,MAAM;CAEpD,OAAO,GAAG,GAAG,KAAK,GAAG,OAAO,GAAG,MAAM;AACvC;AAEA,SAAS,mBAAmB,OAAgC;CAC1D,QAAQ,MAAM,MAAd;EACE,KAAK,UACH,OAAO,IAAI,MAAM,MAAM,IAAI;EAC7B,KAAK,WACH,OAAO,GAAG,GAAG,aAAa,MAAM,OAAO,UAAU,MAAM,KAAK,CAAC;EAC/D,KAAK,UACH,MAAM,IAAI,MACR,6DACF;CACJ;AACF;AAEA,SAAS,UAAU,OAA2B;CAC5C,IAAI,UAAU,MACZ,OAAO;CAET,OAAO,OAAO,UAAU,WACpB,WACA,OAAO,UAAU,WACf,WACA,OAAO,UAAU,YACf,YACA;AACV;AAEA,SAAgB,aAAa,GAAY,MAA0B;CACjE,QAAQ,MAAR;EACE,KAAK,WACH,OAAO,MAAM,OAAO,OAAO,IAAI,IAAI;EACrC,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO;EACT,KAAK,QACH,OAAO,KAAK,UAAU,CAAC;CAC3B;AACF;AAEA,SAAS,sBACP,OACA,OACA,YACU;CACV,IAAI,UAAU,MAIZ,OAAO,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE;CAIhC,OAAO,WAAW,aAAa,OAC3B,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,MAAM,UAC7B,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,KAAK;AAClC;AAEA,SAAS,6BACP,OACA,OACA,UACA,YACU;CACV,IAAI,UAAU,MACZ,OAAO,aAAa,MAAM,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,gBAAgB,GAAG;CAOtE,MAAM,aAAa,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,GAAG,IAAI,sBAC/C,QACF,EAAE,GAAG;CACL,IAAI,WAAW,aAAa,MAC1B,OAAO;CAOT,OAAO,aAAa,MAChB,aACA,GAAG,IAAI,IAAI,MAAM,KAAK,EAAE,cAAc,WAAW;AACvD;AAEA,SAAS,0BACP,OACA,OACA,UACA,YACsB;CAOtB,IAAI,UAAU,QAAS,WAAW,aAAa,QAAQ,aAAa,KAClE;CAGF,MAAM,oBAAoB,aAAa,MAAM,OAAO;CACpD,OAAO,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,GAAG,IAAI,sBACnC,iBACF,EAAE,GAAG;AACP;;;;;;;;;;;;;;;;;AAkBA,SAAS,uBACP,OACA,SACA,OACA,aACU;CACV,MAAM,cAA0B,CAAC;CACjC,MAAM,EAAC,KAAK,MAAM,UAAS;CAC3B,IAAI;CAEJ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,QAAoB,CAAC;EAC3B,MAAM,CAAC,QAAQ,cAAc,MAAM;EACnC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,KACtB,IAAI,MAAM,GAAG;GACX,MAAM,aAAa,YAAY;GAC/B,MAAM,kBAAkB,aACtB,KAAK,WAAW,MAChB,WAAW,IACb;GACA,MAAM,WACJ,eAAe,QAAS,UAAU,MAAM,MAAO,UAAU,MAAM;GACjE,IAAI,MAAM,GACR,eAAe,0BACb,QACA,iBACA,UACA,UACF;GAEF,MAAM,KACJ,6BACE,QACA,iBACA,UACA,UACF,CACF;EACF,OAAO;GACL,MAAM,CAAC,UAAU,MAAM;GACvB,MAAM,aAAa,YAAY;GAC/B,MAAM,QAAQ,aAAa,KAAK,WAAW,MAAM,WAAW,IAAI;GAChE,MAAM,KAAK,sBAAsB,QAAQ,OAAO,UAAU,CAAC;EAC7D;EAEF,YAAY,KAAK,GAAG,IAAI,IAAI,KAAK,OAAO,GAAG,OAAO,EAAE,EAAE;CACxD;CAEA,IAAI,UAAU,MACZ,YAAY,KACV,GAAG,IAAI,IAAI,KACT,MAAM,KAAK,CAAC,WAAW;EACrB,MAAM,aAAa,YAAY;EAE/B,OAAO,sBAAsB,OADf,aAAa,KAAK,UAAU,MAAM,WAAW,IACvB,GAAO,UAAU;CACvD,CAAC,GACD,GAAG,OACL,EAAE,EACJ;CAGF,MAAM,qBAAqB,GAAG,IAAI,IAAI,KAAK,aAAa,GAAG,MAAM,EAAE;CACnE,OAAO,iBAAiB,KAAA,IACpB,qBACA,GAAG,IAAI,aAAa,OAAO,mBAAmB;AACpD"}
+{"version":3,"file":"query-builder.js","names":[],"sources":["../../../../zqlite/src/query-builder.ts"],"sourcesContent":["import type {SQLQuery} from '@databases/sql';\nimport {assert} from '../../shared/src/asserts.ts';\nimport type {\n  Condition,\n  Ordering,\n  SimpleCondition,\n  ValuePosition,\n} from '../../zero-protocol/src/ast.ts';\nimport type {\n  SchemaValue,\n  ValueType,\n} from '../../zero-schema/src/table-schema.ts';\nimport type {Constraint} from '../../zql/src/ivm/constraint.ts';\nimport type {MultiConstraint, Start} from '../../zql/src/ivm/operator.ts';\nimport {sql} from './internal/sql.ts';\n\n/**\n * Condition type without correlated subqueries.\n * This matches the output of transformFilters from zql/builder/filter.ts\n */\nexport type NoSubqueryCondition = Exclude<\n  Condition,\n  {type: 'correlatedSubquery'}\n>;\n\n/**\n * Builds the SELECTs for a fetch. Running them in order and concatenating\n * their rows gives the fetch's rows, in order.\n *\n * There is a second SELECT only when the fetch starts at a non-NULL value of a\n * nullable leading sort column and walks towards its NULL group. The first\n * SELECT then leaves that group out so that SQLite can seek it (see\n * `gatherStartConstraints`), and the second fetches the group. NULLs sort\n * before every other value, so the group follows all of the first SELECT's\n * rows, and a fetch that stops early never needs to run the second.\n */\nexport function buildSelectQueries(\n  tableName: string,\n  columns: Record<string, SchemaValue>,\n  constraint: Constraint | undefined,\n  filters: NoSubqueryCondition | undefined,\n  order: Ordering | undefined,\n  reverse: boolean | undefined,\n  start: Start | undefined,\n  multiConstraints?: readonly MultiConstraint[] | undefined,\n  fetchFilters?: NoSubqueryCondition | undefined,\n): [SQLQuery] | [SQLQuery, SQLQuery] {\n  const select = sql`SELECT ${sql.join(\n    Object.keys(columns).map(c => sql.ident(c)),\n    sql`,`,\n  )} FROM ${sql.ident(tableName)}`;\n  const leading: SQLQuery[] = constraintsToSQL(constraint, columns);\n\n  if (multiConstraints) {\n    for (const mc of multiConstraints) {\n      if (mc.length > 0) {\n        leading.push(multiConstraintToSQL(mc, columns));\n      }\n    }\n  }\n\n  const trailing: SQLQuery[] = [];\n  if (filters) {\n    trailing.push(filtersToSQL(filters));\n  }\n\n  if (fetchFilters) {\n    trailing.push(filtersToSQL(fetchFilters));\n  }\n\n  const orderBy =\n    order && order.length > 0 ? orderByToSQL(order, !!reverse) : undefined;\n  const selectWhere = (constraints: SQLQuery[]) => {\n    const query =\n      constraints.length > 0\n        ? sql`${select} WHERE ${sql.join(constraints, sql` AND `)}`\n        : select;\n    return orderBy ? sql`${query} ${orderBy}` : query;\n  };\n\n  if (!start) {\n    return [selectWhere([...leading, ...trailing])];\n  }\n\n  assert(order !== undefined, 'start requires ordering');\n  const {constraint: startConstraint, excludesNullGroup} =\n    gatherStartConstraints(start, reverse, order, columns);\n  const query = selectWhere([...leading, startConstraint, ...trailing]);\n  const [leadingField] = order[0];\n  if (\n    !excludesNullGroup ||\n    // The rest of the fetch would reject every row of the NULL group anyway.\n    constraintsRejectNull(constraint, multiConstraints, leadingField) ||\n    rejectsNull(filters, leadingField) ||\n    rejectsNull(fetchFilters, leadingField)\n  ) {\n    return [query];\n  }\n  return [\n    query,\n    selectWhere([\n      ...leading,\n      sql`${sql.ident(leadingField)} IS NULL`,\n      ...trailing,\n    ]),\n  ];\n}\n\n/**\n * {@link buildSelectQueries} for a fetch that needs only one SELECT, such as\n * one without a start row.\n */\nexport function buildSelectQuery(\n  ...args: Parameters<typeof buildSelectQueries>\n): SQLQuery {\n  const [query, nullGroup] = buildSelectQueries(...args);\n  assert(\n    nullGroup === undefined,\n    'The fetch needs a second SELECT for its NULL group; use buildSelectQueries',\n  );\n  return query;\n}\n\n/**\n * Whether `condition` is never true for a row whose `field` is NULL. Only a\n * comparison of `field` itself, alone or ANDed with other conditions, is\n * recognized. Every operator yields NULL for a NULL operand except `IS`,\n * `IS NOT` and `NOT IN`, which is true for an empty list.\n */\nfunction rejectsNull(\n  condition: NoSubqueryCondition | undefined,\n  field: string,\n): boolean {\n  switch (condition?.type) {\n    case undefined:\n    case 'or':\n      return false;\n    case 'and':\n      return condition.conditions.some(c =>\n        rejectsNull(c as NoSubqueryCondition, field),\n      );\n    case 'simple': {\n      const {op, left, right} = condition;\n      if (left.type !== 'column' || left.name !== field) {\n        return false;\n      }\n      switch (op) {\n        case 'IS':\n          return right.type === 'literal' && right.value !== null;\n        case 'IS NOT':\n          return right.type === 'literal' && right.value === null;\n        case 'NOT IN':\n          return false;\n        default:\n          return true;\n      }\n    }\n  }\n}\n\n/**\n * Whether the constraints of the fetch are never true for a row whose `field`\n * is NULL. {@link constraintsToSQL} compares the field with `=` and\n * {@link multiConstraintToSQL} with `IN`, neither of which is ever true for a\n * NULL operand, so the field being constrained at all is enough.\n */\nfunction constraintsRejectNull(\n  constraint: Constraint | undefined,\n  multiConstraints: readonly MultiConstraint[] | undefined,\n  field: string,\n): boolean {\n  if (constraint && field in constraint) {\n    return true;\n  }\n  // `multiConstraintToSQL` takes its key list from the first entry and asserts\n  // that the rest match it.\n  return multiConstraints?.some(mc => mc.length > 0 && field in mc[0]) === true;\n}\n\nexport function constraintsToSQL(\n  constraint: Constraint | undefined,\n  columns: Record<string, SchemaValue>,\n) {\n  if (!constraint) {\n    return [];\n  }\n\n  const constraints: SQLQuery[] = [];\n  for (const [key, value] of Object.entries(constraint)) {\n    constraints.push(\n      sql`${sql.ident(key)} = ${toSQLiteType(value, columns[key].type)}`,\n    );\n  }\n\n  return constraints;\n}\n\n/**\n * Builds a single batched IN clause from a `MultiConstraint`. All entries\n * are assumed to share the same shape (the keys of the first entry);\n * FlippedJoin derives them from the same parentKey for all children.\n *\n * Single-column form: `col IN (?, ?, ?)`\n * Compound form:      `(a, b) IN (VALUES (?, ?), (?, ?), …)`\n *\n * NOTE: SQLite optimizes `col IN (literal-list)` using the column's index;\n * verified via EXPLAIN QUERY PLAN — see query-builder.test.ts.\n */\nexport function multiConstraintToSQL(\n  multiConstraint: MultiConstraint,\n  columns: Record<string, SchemaValue>,\n): SQLQuery {\n  assert(multiConstraint.length > 0, 'multiConstraint must be non-empty');\n  // All entries share the same keys; pull the column list from the first.\n  const keys = Object.keys(multiConstraint[0]);\n  assert(keys.length > 0, 'multiConstraint entries must have at least one key');\n  // Subsequent entries must share the first entry's shape — the SQL form\n  // is `(col_a, col_b, …) IN VALUES (…)`, with one binding per key per\n  // entry. Heterogeneous keys would silently produce incorrect bindings.\n  for (let i = 1; i < multiConstraint.length; i++) {\n    const entry = multiConstraint[i];\n    assert(\n      Object.keys(entry).length === keys.length && keys.every(k => k in entry),\n      () =>\n        `multiConstraint entries must share the same keys (entry 0: [${keys.join(\n          ',',\n        )}], entry ${i}: [${Object.keys(entry).join(',')}])`,\n    );\n  }\n\n  if (keys.length === 1) {\n    const key = keys[0];\n    const colType = columns[key].type;\n    return sql`${sql.ident(key)} IN (${sql.join(\n      multiConstraint.map(c => sql`${toSQLiteType(c[key], colType)}`),\n      sql`,`,\n    )})`;\n  }\n\n  // Compound: `(col_a, col_b, …) IN (VALUES (?, ?, …), …)`\n  const colList = sql`(${sql.join(\n    keys.map(k => sql.ident(k)),\n    sql`,`,\n  )})`;\n  const rows = multiConstraint.map(\n    c =>\n      sql`(${sql.join(\n        keys.map(k => sql`${toSQLiteType(c[k], columns[k].type)}`),\n        sql`,`,\n      )})`,\n  );\n  return sql`${colList} IN (VALUES ${sql.join(rows, sql`,`)})`;\n}\n\nexport function orderByToSQL(order: Ordering, reverse: boolean): SQLQuery {\n  if (reverse) {\n    return sql`ORDER BY ${sql.join(\n      order.map(\n        s =>\n          sql`${sql.ident(s[0])} ${sql.__dangerous__rawValue(\n            s[1] === 'asc' ? 'desc' : 'asc',\n          )}`,\n      ),\n      sql`, `,\n    )}`;\n  } else {\n    return sql`ORDER BY ${sql.join(\n      order.map(\n        s => sql`${sql.ident(s[0])} ${sql.__dangerous__rawValue(s[1])}`,\n      ),\n      sql`, `,\n    )}`;\n  }\n}\n\n/**\n * Converts filters (conditions) to SQL WHERE clause.\n * This applies all filters present in the AST for a query to the source.\n */\nexport function filtersToSQL(filters: NoSubqueryCondition): SQLQuery {\n  switch (filters.type) {\n    case 'simple':\n      return simpleConditionToSQL(filters);\n    case 'and':\n      return filters.conditions.length > 0\n        ? sql`(${sql.join(\n            filters.conditions.map(condition =>\n              filtersToSQL(condition as NoSubqueryCondition),\n            ),\n            sql` AND `,\n          )})`\n        : sql`TRUE`;\n    case 'or':\n      return filters.conditions.length > 0\n        ? sql`(${sql.join(\n            filters.conditions.map(condition =>\n              filtersToSQL(condition as NoSubqueryCondition),\n            ),\n            sql` OR `,\n          )})`\n        : sql`FALSE`;\n  }\n}\n\nfunction simpleConditionToSQL(filter: SimpleCondition): SQLQuery {\n  const {op} = filter;\n  if (op === 'IN' || op === 'NOT IN') {\n    switch (filter.right.type) {\n      case 'literal':\n        return sql`${valuePositionToSQL(\n          filter.left,\n        )} ${sql.__dangerous__rawValue(\n          filter.op,\n        )} (SELECT value FROM json_each(${JSON.stringify(\n          filter.right.value,\n        )}))`;\n      case 'static':\n        throw new Error(\n          'Static parameters must be replaced before conversion to SQL',\n        );\n    }\n  }\n  if (\n    op === 'LIKE' ||\n    op === 'NOT LIKE' ||\n    op === 'ILIKE' ||\n    op === 'NOT ILIKE'\n  ) {\n    return likeConditionToSQL(filter);\n  }\n\n  if (\n    (op === 'IS' || op === 'IS NOT') &&\n    filter.right.type === 'literal' &&\n    filter.right.value === null\n  ) {\n    return sql`${valuePositionToSQL(filter.left)} ${sql.__dangerous__rawValue(\n      op,\n    )} NULL`;\n  }\n\n  return sql`${valuePositionToSQL(filter.left)} ${sql.__dangerous__rawValue(\n    filter.op,\n  )} ${valuePositionToSQL(filter.right)}`;\n}\n\nfunction likeConditionToSQL(filter: SimpleCondition): SQLQuery {\n  const {op} = filter;\n  // Mirror Postgres pattern-matching semantics:\n  //  * LIKE is case-sensitive. The replica connection runs with\n  //    `PRAGMA case_sensitive_like = ON` (see db.ts), so the bare LIKE\n  //    operator is case-sensitive.\n  //  * ILIKE is case-insensitive. We lower() both operands using the\n  //    Unicode-aware lower() that @rocicorp/zero-sqlite3 provides via ICU,\n  //    mirroring the toLowerCase() used by the in-memory IVM matcher\n  //    (see zql/src/builder/like.ts).\n  //  * Backslash is the default escape character in Postgres and in the IVM\n  //    matcher, but SQLite has no default, so we specify `ESCAPE '\\'`\n  //    explicitly. The SQL literal '\\' is a single backslash (SQLite does not\n  //    process backslash escapes inside string literals).\n  const caseInsensitive = op === 'ILIKE' || op === 'NOT ILIKE';\n  const negated = op === 'NOT LIKE' || op === 'NOT ILIKE';\n  const likeOp = sql.__dangerous__rawValue(negated ? 'NOT LIKE' : 'LIKE');\n\n  const left = valuePositionToSQL(filter.left);\n  const right = valuePositionToSQL(filter.right);\n  if (caseInsensitive) {\n    return sql`lower(${left}) ${likeOp} lower(${right}) ESCAPE '\\\\'`;\n  }\n  return sql`${left} ${likeOp} ${right} ESCAPE '\\\\'`;\n}\n\nfunction valuePositionToSQL(value: ValuePosition): SQLQuery {\n  switch (value.type) {\n    case 'column':\n      return sql.ident(value.name);\n    case 'literal':\n      return sql`${toSQLiteType(value.value, getJsType(value.value))}`;\n    case 'static':\n      throw new Error(\n        'Static parameters must be replaced before conversion to SQL',\n      );\n  }\n}\n\nfunction getJsType(value: unknown): ValueType {\n  if (value === null) {\n    return 'null';\n  }\n  return typeof value === 'string'\n    ? 'string'\n    : typeof value === 'number'\n      ? 'number'\n      : typeof value === 'boolean'\n        ? 'boolean'\n        : 'json';\n}\n\nexport function toSQLiteType(v: unknown, type: ValueType): unknown {\n  switch (type) {\n    case 'boolean':\n      return v === null ? null : v ? 1 : 0;\n    case 'number':\n    case 'string':\n    case 'null':\n      return v;\n    case 'json':\n      return JSON.stringify(v);\n  }\n}\n\nfunction nullableAwareEquality(\n  field: string,\n  value: unknown,\n  columnType: SchemaValue,\n): SQLQuery {\n  if (value === null) {\n    // A NULL bound value proves the column is nullable regardless of the\n    // column metadata, and `=` never matches NULL — `IS` selects the NULL\n    // tie-break group a cursor anchored on a NULL value needs.\n    return sql`${sql.ident(field)} IS NULL`;\n  }\n  // Use = instead of IS for non-nullable columns to enable better\n  // index usage in SQLite.\n  return columnType.optional === true\n    ? sql`${sql.ident(field)} IS ${value}`\n    : sql`${sql.ident(field)} = ${value}`;\n}\n\nfunction nullableAwareRangeComparison(\n  field: string,\n  value: unknown,\n  operator: '>' | '<',\n  columnType: SchemaValue,\n  /**\n   * Whether an entailed bound ANDed in front of the disjunction already\n   * excludes the column's NULL group, which a second SELECT then fetches (see\n   * {@link gatherStartConstraints}).\n   */\n  nullGroupExcluded: boolean,\n): SQLQuery {\n  if (value === null) {\n    return operator === '>' ? sql`${sql.ident(field)} IS NOT NULL` : sql`FALSE`;\n  }\n\n  // For non-nullable columns, skip IS NULL checks to avoid breaking\n  // SQLite's MULTI-INDEX OR optimization, which falls back to a full\n  // table scan when any OR branch involves NULL.\n  // See: https://github.com/rocicorp/mono/pull/5542\n  const comparison = sql`${sql.ident(field)} ${sql.__dangerous__rawValue(\n    operator,\n  )} ${value}`;\n  if (columnType.optional !== true) {\n    return comparison;\n  }\n\n  // The bound is non-NULL here. NULLs sort before every non-NULL value, so\n  // `>` already excludes them and needs no guard, while `<` must admit the\n  // NULL group explicitly — a bare `col < ?` would silently drop NULL rows\n  // from a backward walk. Unless the NULL group is excluded and fetched on its\n  // own: the guard is dead then, and a NULL inside an OR is what costs SQLite\n  // the MULTI-INDEX OR optimization in the first place.\n  return operator === '>' || nullGroupExcluded\n    ? comparison\n    : sql`(${sql.ident(field)} IS NULL OR ${comparison})`;\n}\n\ntype SargableLeadingStartBound = {\n  readonly bound: SQLQuery;\n  /**\n   * Whether `bound` excludes the column's NULL group, which belongs to the\n   * rows the start walks over and must then be fetched separately.\n   */\n  readonly excludesNullGroup: boolean;\n};\n\nfunction sargableLeadingStartBound(\n  field: string,\n  value: unknown,\n  operator: '>' | '<',\n  columnType: SchemaValue,\n): SargableLeadingStartBound | undefined {\n  // A NULL bound value proves the column is nullable regardless of the\n  // column metadata, and a bare range bound is not sound there: `col >= NULL`\n  // is never true, so instead of being redundant it would annihilate the\n  // whole start constraint.\n  if (value === null) {\n    return undefined;\n  }\n\n  const inclusiveOperator = operator === '>' ? '>=' : '<=';\n  return {\n    bound: sql`${sql.ident(field)} ${sql.__dangerous__rawValue(\n      inclusiveOperator,\n    )} ${value}`,\n    // For `>`, NULLs sort before the non-NULL bound, so `col >= value` remains\n    // sound on a nullable column. For `<`, the rows before the bound include\n    // the whole NULL group, which `col <= value` drops. SQLite cannot seek\n    // `col IS NULL OR col <= value` as one index range, so the caller fetches\n    // that group separately.\n    excludesNullGroup: columnType.optional === true && operator === '<',\n  };\n}\n\n/**\n * The ordering could be complex such as:\n * `ORDER BY a ASC, b DESC, c ASC`\n *\n * In those cases, we need to encode the constraints as various\n * `OR` clauses.\n *\n * E.g.,\n *\n * to get the row after (a = 1, b = 2, c = 3) would be:\n *\n * `WHERE a > 1 OR (a = 1 AND b < 2) OR (a = 1 AND b = 2 AND c > 3)`\n *\n * - after vs before flips the comparison operators.\n * - inclusive adds a final `OR` clause for the exact match.\n *\n * SQLite cannot seek an index with that disjunction, so a redundant, entailed\n * bound on the leading column is ANDed in front of it (e.g. `a >= 1 AND ...`).\n *\n * When the leading column is nullable and the walk heads towards lower values\n * (`<`), the rows the start walks over include the whole NULL group, which\n * that bound drops. `excludesNullGroup` is set then, and the group is left out\n * of the disjunction too — every row the returned constraint admits has\n * `a <= ?`, so it and `a IS NULL` partition those rows, and the caller fetches\n * the NULL group with a second SELECT.\n */\nfunction gatherStartConstraints(\n  start: Start,\n  reverse: boolean | undefined,\n  order: Ordering,\n  columnTypes: Record<string, SchemaValue>,\n): {readonly constraint: SQLQuery; readonly excludesNullGroup: boolean} {\n  const constraints: SQLQuery[] = [];\n  const {row: from, basis} = start;\n  let leadingBound: SargableLeadingStartBound | undefined;\n\n  for (let i = 0; i < order.length; i++) {\n    const group: SQLQuery[] = [];\n    const [iField, iDirection] = order[i];\n    for (let j = 0; j <= i; j++) {\n      if (j === i) {\n        const columnType = columnTypes[iField];\n        const constraintValue = toSQLiteType(\n          from[iField] ?? null,\n          columnType.type,\n        );\n        const operator =\n          iDirection === 'asc' ? (reverse ? '<' : '>') : reverse ? '>' : '<';\n        let nullGroupExcluded = false;\n        if (i === 0) {\n          leadingBound = sargableLeadingStartBound(\n            iField,\n            constraintValue,\n            operator,\n            columnType,\n          );\n          nullGroupExcluded = leadingBound?.excludesNullGroup === true;\n        }\n        group.push(\n          nullableAwareRangeComparison(\n            iField,\n            constraintValue,\n            operator,\n            columnType,\n            nullGroupExcluded,\n          ),\n        );\n      } else {\n        const [jField] = order[j];\n        const columnType = columnTypes[jField];\n        const value = toSQLiteType(from[jField] ?? null, columnType.type);\n        group.push(nullableAwareEquality(jField, value, columnType));\n      }\n    }\n    constraints.push(sql`(${sql.join(group, sql` AND `)})`);\n  }\n\n  if (basis === 'at') {\n    constraints.push(\n      sql`(${sql.join(\n        order.map(([field]) => {\n          const columnType = columnTypes[field];\n          const value = toSQLiteType(from[field] ?? null, columnType.type);\n          return nullableAwareEquality(field, value, columnType);\n        }),\n        sql` AND `,\n      )})`,\n    );\n  }\n\n  const lexicographicStart = sql`(${sql.join(constraints, sql` OR `)})`;\n  if (leadingBound === undefined) {\n    return {constraint: lexicographicStart, excludesNullGroup: false};\n  }\n  return {\n    constraint: sql`(${leadingBound.bound} AND ${lexicographicStart})`,\n    excludesNullGroup: leadingBound.excludesNullGroup,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;AAoCA,SAAgB,mBACd,WACA,SACA,YACA,SACA,OACA,SACA,OACA,kBACA,cACmC;CACnC,MAAM,SAAS,GAAG,UAAU,IAAI,KAC9B,OAAO,KAAK,OAAO,EAAE,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAC1C,GAAG,GACL,EAAE,QAAQ,IAAI,MAAM,SAAS;CAC7B,MAAM,UAAsB,iBAAiB,YAAY,OAAO;CAEhE,IAAI;OACG,MAAM,MAAM,kBACf,IAAI,GAAG,SAAS,GACd,QAAQ,KAAK,qBAAqB,IAAI,OAAO,CAAC;CAAA;CAKpD,MAAM,WAAuB,CAAC;CAC9B,IAAI,SACF,SAAS,KAAK,aAAa,OAAO,CAAC;CAGrC,IAAI,cACF,SAAS,KAAK,aAAa,YAAY,CAAC;CAG1C,MAAM,UACJ,SAAS,MAAM,SAAS,IAAI,aAAa,OAAO,CAAC,CAAC,OAAO,IAAI,KAAA;CAC/D,MAAM,eAAe,gBAA4B;EAC/C,MAAM,QACJ,YAAY,SAAS,IACjB,GAAG,GAAG,OAAO,SAAS,IAAI,KAAK,aAAa,GAAG,OAAO,MACtD;EACN,OAAO,UAAU,GAAG,GAAG,MAAM,GAAG,YAAY;CAC9C;CAEA,IAAI,CAAC,OACH,OAAO,CAAC,YAAY,CAAC,GAAG,SAAS,GAAG,QAAQ,CAAC,CAAC;CAGhD,OAAO,UAAU,KAAA,GAAW,yBAAyB;CACrD,MAAM,EAAC,YAAY,iBAAiB,sBAClC,uBAAuB,OAAO,SAAS,OAAO,OAAO;CACvD,MAAM,QAAQ,YAAY;EAAC,GAAG;EAAS;EAAiB,GAAG;CAAQ,CAAC;CACpE,MAAM,CAAC,gBAAgB,MAAM;CAC7B,IACE,CAAC,qBAED,sBAAsB,YAAY,kBAAkB,YAAY,KAChE,YAAY,SAAS,YAAY,KACjC,YAAY,cAAc,YAAY,GAEtC,OAAO,CAAC,KAAK;CAEf,OAAO,CACL,OACA,YAAY;EACV,GAAG;EACH,GAAG,GAAG,IAAI,MAAM,YAAY,EAAE;EAC9B,GAAG;CACL,CAAC,CACH;AACF;;;;;AAMA,SAAgB,iBACd,GAAG,MACO;CACV,MAAM,CAAC,OAAO,aAAa,mBAAmB,GAAG,IAAI;CACrD,OACE,cAAc,KAAA,GACd,4EACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,YACP,WACA,OACS;CACT,QAAQ,WAAW,MAAnB;EACE,KAAK,KAAA;EACL,KAAK,MACH,OAAO;EACT,KAAK,OACH,OAAO,UAAU,WAAW,MAAK,MAC/B,YAAY,GAA0B,KAAK,CAC7C;EACF,KAAK,UAAU;GACb,MAAM,EAAC,IAAI,MAAM,UAAS;GAC1B,IAAI,KAAK,SAAS,YAAY,KAAK,SAAS,OAC1C,OAAO;GAET,QAAQ,IAAR;IACE,KAAK,MACH,OAAO,MAAM,SAAS,aAAa,MAAM,UAAU;IACrD,KAAK,UACH,OAAO,MAAM,SAAS,aAAa,MAAM,UAAU;IACrD,KAAK,UACH,OAAO;IACT,SACE,OAAO;GACX;EACF;CACF;AACF;;;;;;;AAQA,SAAS,sBACP,YACA,kBACA,OACS;CACT,IAAI,cAAc,SAAS,YACzB,OAAO;CAIT,OAAO,kBAAkB,MAAK,OAAM,GAAG,SAAS,KAAK,SAAS,GAAG,EAAE,MAAM;AAC3E;AAEA,SAAgB,iBACd,YACA,SACA;CACA,IAAI,CAAC,YACH,OAAO,CAAC;CAGV,MAAM,cAA0B,CAAC;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,UAAU,GAClD,YAAY,KACV,GAAG,GAAG,IAAI,MAAM,GAAG,EAAE,KAAK,aAAa,OAAO,QAAQ,KAAK,IAAI,GACjE;CAGF,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,qBACd,iBACA,SACU;CACV,OAAO,gBAAgB,SAAS,GAAG,mCAAmC;CAEtE,MAAM,OAAO,OAAO,KAAK,gBAAgB,EAAE;CAC3C,OAAO,KAAK,SAAS,GAAG,oDAAoD;CAI5E,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;EAC/C,MAAM,QAAQ,gBAAgB;EAC9B,OACE,OAAO,KAAK,KAAK,EAAE,WAAW,KAAK,UAAU,KAAK,OAAM,MAAK,KAAK,KAAK,SAErE,+DAA+D,KAAK,KAClE,GACF,EAAE,WAAW,EAAE,KAAK,OAAO,KAAK,KAAK,EAAE,KAAK,GAAG,EAAE,GACrD;CACF;CAEA,IAAI,KAAK,WAAW,GAAG;EACrB,MAAM,MAAM,KAAK;EACjB,MAAM,UAAU,QAAQ,KAAK;EAC7B,OAAO,GAAG,GAAG,IAAI,MAAM,GAAG,EAAE,OAAO,IAAI,KACrC,gBAAgB,KAAI,MAAK,GAAG,GAAG,aAAa,EAAE,MAAM,OAAO,GAAG,GAC9D,GAAG,GACL,EAAE;CACJ;CAGA,MAAM,UAAU,GAAG,IAAI,IAAI,KACzB,KAAK,KAAI,MAAK,IAAI,MAAM,CAAC,CAAC,GAC1B,GAAG,GACL,EAAE;CACF,MAAM,OAAO,gBAAgB,KAC3B,MACE,GAAG,IAAI,IAAI,KACT,KAAK,KAAI,MAAK,GAAG,GAAG,aAAa,EAAE,IAAI,QAAQ,GAAG,IAAI,GAAG,GACzD,GAAG,GACL,EAAE,EACN;CACA,OAAO,GAAG,GAAG,QAAQ,cAAc,IAAI,KAAK,MAAM,GAAG,GAAG,EAAE;AAC5D;AAEA,SAAgB,aAAa,OAAiB,SAA4B;CACxE,IAAI,SACF,OAAO,GAAG,YAAY,IAAI,KACxB,MAAM,KACJ,MACE,GAAG,GAAG,IAAI,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,sBAC3B,EAAE,OAAO,QAAQ,SAAS,KAC5B,GACJ,GACA,GAAG,IACL;MAEA,OAAO,GAAG,YAAY,IAAI,KACxB,MAAM,KACJ,MAAK,GAAG,GAAG,IAAI,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,sBAAsB,EAAE,EAAE,GAC9D,GACA,GAAG,IACL;AAEJ;;;;;AAMA,SAAgB,aAAa,SAAwC;CACnE,QAAQ,QAAQ,MAAhB;EACE,KAAK,UACH,OAAO,qBAAqB,OAAO;EACrC,KAAK,OACH,OAAO,QAAQ,WAAW,SAAS,IAC/B,GAAG,IAAI,IAAI,KACT,QAAQ,WAAW,KAAI,cACrB,aAAa,SAAgC,CAC/C,GACA,GAAG,OACL,EAAE,KACF,GAAG;EACT,KAAK,MACH,OAAO,QAAQ,WAAW,SAAS,IAC/B,GAAG,IAAI,IAAI,KACT,QAAQ,WAAW,KAAI,cACrB,aAAa,SAAgC,CAC/C,GACA,GAAG,MACL,EAAE,KACF,GAAG;CACX;AACF;AAEA,SAAS,qBAAqB,QAAmC;CAC/D,MAAM,EAAC,OAAM;CACb,IAAI,OAAO,QAAQ,OAAO,UACxB,QAAQ,OAAO,MAAM,MAArB;EACE,KAAK,WACH,OAAO,GAAG,GAAG,mBACX,OAAO,IACT,EAAE,GAAG,IAAI,sBACP,OAAO,EACT,EAAE,gCAAgC,KAAK,UACrC,OAAO,MAAM,KACf,EAAE;EACJ,KAAK,UACH,MAAM,IAAI,MACR,6DACF;CACJ;CAEF,IACE,OAAO,UACP,OAAO,cACP,OAAO,WACP,OAAO,aAEP,OAAO,mBAAmB,MAAM;CAGlC,KACG,OAAO,QAAQ,OAAO,aACvB,OAAO,MAAM,SAAS,aACtB,OAAO,MAAM,UAAU,MAEvB,OAAO,GAAG,GAAG,mBAAmB,OAAO,IAAI,EAAE,GAAG,IAAI,sBAClD,EACF,EAAE;CAGJ,OAAO,GAAG,GAAG,mBAAmB,OAAO,IAAI,EAAE,GAAG,IAAI,sBAClD,OAAO,EACT,EAAE,GAAG,mBAAmB,OAAO,KAAK;AACtC;AAEA,SAAS,mBAAmB,QAAmC;CAC7D,MAAM,EAAC,OAAM;CAab,MAAM,kBAAkB,OAAO,WAAW,OAAO;CACjD,MAAM,UAAU,OAAO,cAAc,OAAO;CAC5C,MAAM,SAAS,IAAI,sBAAsB,UAAU,aAAa,MAAM;CAEtE,MAAM,OAAO,mBAAmB,OAAO,IAAI;CAC3C,MAAM,QAAQ,mBAAmB,OAAO,KAAK;CAC7C,IAAI,iBACF,OAAO,GAAG,SAAS,KAAK,IAAI,OAAO,SAAS,MAAM;CAEpD,OAAO,GAAG,GAAG,KAAK,GAAG,OAAO,GAAG,MAAM;AACvC;AAEA,SAAS,mBAAmB,OAAgC;CAC1D,QAAQ,MAAM,MAAd;EACE,KAAK,UACH,OAAO,IAAI,MAAM,MAAM,IAAI;EAC7B,KAAK,WACH,OAAO,GAAG,GAAG,aAAa,MAAM,OAAO,UAAU,MAAM,KAAK,CAAC;EAC/D,KAAK,UACH,MAAM,IAAI,MACR,6DACF;CACJ;AACF;AAEA,SAAS,UAAU,OAA2B;CAC5C,IAAI,UAAU,MACZ,OAAO;CAET,OAAO,OAAO,UAAU,WACpB,WACA,OAAO,UAAU,WACf,WACA,OAAO,UAAU,YACf,YACA;AACV;AAEA,SAAgB,aAAa,GAAY,MAA0B;CACjE,QAAQ,MAAR;EACE,KAAK,WACH,OAAO,MAAM,OAAO,OAAO,IAAI,IAAI;EACrC,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO;EACT,KAAK,QACH,OAAO,KAAK,UAAU,CAAC;CAC3B;AACF;AAEA,SAAS,sBACP,OACA,OACA,YACU;CACV,IAAI,UAAU,MAIZ,OAAO,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE;CAIhC,OAAO,WAAW,aAAa,OAC3B,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,MAAM,UAC7B,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,KAAK;AAClC;AAEA,SAAS,6BACP,OACA,OACA,UACA,YAMA,mBACU;CACV,IAAI,UAAU,MACZ,OAAO,aAAa,MAAM,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,gBAAgB,GAAG;CAOtE,MAAM,aAAa,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,GAAG,IAAI,sBAC/C,QACF,EAAE,GAAG;CACL,IAAI,WAAW,aAAa,MAC1B,OAAO;CAST,OAAO,aAAa,OAAO,oBACvB,aACA,GAAG,IAAI,IAAI,MAAM,KAAK,EAAE,cAAc,WAAW;AACvD;AAWA,SAAS,0BACP,OACA,OACA,UACA,YACuC;CAKvC,IAAI,UAAU,MACZ;CAGF,MAAM,oBAAoB,aAAa,MAAM,OAAO;CACpD,OAAO;EACL,OAAO,GAAG,GAAG,IAAI,MAAM,KAAK,EAAE,GAAG,IAAI,sBACnC,iBACF,EAAE,GAAG;EAML,mBAAmB,WAAW,aAAa,QAAQ,aAAa;CAClE;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAS,uBACP,OACA,SACA,OACA,aACsE;CACtE,MAAM,cAA0B,CAAC;CACjC,MAAM,EAAC,KAAK,MAAM,UAAS;CAC3B,IAAI;CAEJ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,QAAoB,CAAC;EAC3B,MAAM,CAAC,QAAQ,cAAc,MAAM;EACnC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,KACtB,IAAI,MAAM,GAAG;GACX,MAAM,aAAa,YAAY;GAC/B,MAAM,kBAAkB,aACtB,KAAK,WAAW,MAChB,WAAW,IACb;GACA,MAAM,WACJ,eAAe,QAAS,UAAU,MAAM,MAAO,UAAU,MAAM;GACjE,IAAI,oBAAoB;GACxB,IAAI,MAAM,GAAG;IACX,eAAe,0BACb,QACA,iBACA,UACA,UACF;IACA,oBAAoB,cAAc,sBAAsB;GAC1D;GACA,MAAM,KACJ,6BACE,QACA,iBACA,UACA,YACA,iBACF,CACF;EACF,OAAO;GACL,MAAM,CAAC,UAAU,MAAM;GACvB,MAAM,aAAa,YAAY;GAC/B,MAAM,QAAQ,aAAa,KAAK,WAAW,MAAM,WAAW,IAAI;GAChE,MAAM,KAAK,sBAAsB,QAAQ,OAAO,UAAU,CAAC;EAC7D;EAEF,YAAY,KAAK,GAAG,IAAI,IAAI,KAAK,OAAO,GAAG,OAAO,EAAE,EAAE;CACxD;CAEA,IAAI,UAAU,MACZ,YAAY,KACV,GAAG,IAAI,IAAI,KACT,MAAM,KAAK,CAAC,WAAW;EACrB,MAAM,aAAa,YAAY;EAE/B,OAAO,sBAAsB,OADf,aAAa,KAAK,UAAU,MAAM,WAAW,IACvB,GAAO,UAAU;CACvD,CAAC,GACD,GAAG,OACL,EAAE,EACJ;CAGF,MAAM,qBAAqB,GAAG,IAAI,IAAI,KAAK,aAAa,GAAG,MAAM,EAAE;CACnE,IAAI,iBAAiB,KAAA,GACnB,OAAO;EAAC,YAAY;EAAoB,mBAAmB;CAAK;CAElE,OAAO;EACL,YAAY,GAAG,IAAI,aAAa,MAAM,OAAO,mBAAmB;EAChE,mBAAmB,aAAa;CAClC;AACF"}

package/out/zqlite/src/query-delegate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"query-delegate.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/query-delegate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AACjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAC7D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAC3D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAC,iBAAiB,EAAC,MAAM,4CAA4C,CAAC;AAC7E,OAAO,KAAK,EAAC,cAAc,EAAC,MAAM,uCAAuC,CAAC;AAC1E,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,SAAS,CAAC;AAGtC,qBAAa,iBAAkB,SAAQ,iBAAiB;;IAMtD,QAAQ,CAAC,oBAAoB,QAAQ;IAGrC,YACE,EAAE,EAAE,UAAU,EACd,EAAE,EAAE,QAAQ,EACZ,MAAM,EAAE,MAAM,EACd,SAAS,CAAC,EAAE,SAAS,EAatB;IAED,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAmBnC;IAED,mBAAmB,CAAC,EAAE,EAAE,cAAc,cAKrC;IACQ,gBAAgB,CAAC,CAAC,EAAE,gBAAgB,EAAE,MAAM,CAAC,GAAG,CAAC,CAMzD;CACF"}
+{"version":3,"file":"query-delegate.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/query-delegate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AACjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAE7D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAC3D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAC,iBAAiB,EAAC,MAAM,4CAA4C,CAAC;AAC7E,OAAO,KAAK,EAAC,cAAc,EAAC,MAAM,uCAAuC,CAAC;AAC1E,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,SAAS,CAAC;AAGtC,qBAAa,iBAAkB,SAAQ,iBAAiB;;IAMtD,QAAQ,CAAC,oBAAoB,QAAQ;IAGrC,YACE,EAAE,EAAE,UAAU,EACd,EAAE,EAAE,QAAQ,EACZ,MAAM,EAAE,MAAM,EACd,SAAS,CAAC,EAAE,SAAS,EAiBtB;IAED,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAYnC;IAED,mBAAmB,CAAC,EAAE,EAAE,cAAc,cAKrC;IACQ,gBAAgB,CAAC,CAAC,EAAE,gBAAgB,EAAE,MAAM,CAAC,GAAG,CAAC,CAMzD;CACF"}

package/out/zqlite/src/query-delegate.js

@@ -1,3 +1,4 @@
+import { getOrInsertComputed } from "../../shared/src/map.js";
 import { QueryDelegateBase } from "../../zql/src/query/query-delegate-base.js";
 import { TableSource } from "./table-source.js";
 //#region ../zqlite/src/query-delegate.ts
@@ -19,16 +20,18 @@ var QueryDelegateImpl = class extends QueryDelegateBase {
 			ivmSampling: 0,
 			level: "info",
 			slowHydrateThreshold: 0,
-			slowRowThreshold: 0
+			slowAdvanceThreshold: 0,
+			queryStatsIntervalSeconds: 0,
+			slowRowThreshold: 0,
+			planWarningRowThreshold: 0,
+			planWarningCostThreshold: 0
 		};
 	}
 	getSource(tableName) {
-		let source = this.#sources.get(tableName);
-		if (source) return source;
-		const tableSchema = this.#schema.tables[tableName];
-		source = new TableSource(this.#lc, this.#logConfig, this.#db, tableName, tableSchema.columns, tableSchema.primaryKey);
-		this.#sources.set(tableName, source);
-		return source;
+		return getOrInsertComputed(this.#sources, tableName, (tableName) => {
+			const tableSchema = this.#schema.tables[tableName];
+			return new TableSource(this.#lc, this.#logConfig, this.#db, tableName, tableSchema.columns, tableSchema.primaryKey);
+		});
 	}
 	onTransactionCommit(cb) {
 		this.#commitObservers.add(cb);

package/out/zqlite/src/query-delegate.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-delegate.js","names":["#lc","#db","#schema","#sources","#logConfig","#commitObservers"],"sources":["../../../../zqlite/src/query-delegate.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport type {LogConfig} from '../../otel/src/log-options.ts';\nimport type {Schema} from '../../zero-types/src/schema.ts';\nimport type {Source} from '../../zql/src/ivm/source.ts';\nimport {QueryDelegateBase} from '../../zql/src/query/query-delegate-base.ts';\nimport type {CommitListener} from '../../zql/src/query/query-delegate.ts';\nimport type {Database} from './db.ts';\nimport {TableSource} from './table-source.ts';\n\nexport class QueryDelegateImpl extends QueryDelegateBase {\n  readonly #lc: LogContext;\n  readonly #db: Database;\n  readonly #schema: Schema;\n  readonly #sources: Map<string, Source> = new Map();\n  readonly #logConfig: LogConfig;\n  readonly defaultQueryComplete = true;\n  readonly #commitObservers = new Set<() => void>();\n\n  constructor(\n    lc: LogContext,\n    db: Database,\n    schema: Schema,\n    logConfig?: LogConfig,\n  ) {\n    super();\n    this.#lc = lc.withContext('class', 'QueryDelegateImpl');\n    this.#db = db;\n    this.#schema = schema;\n    this.#logConfig = logConfig ?? {\n      format: 'text',\n      ivmSampling: 0,\n      level: 'info',\n      slowHydrateThreshold: 0,\n      slowRowThreshold: 0,\n    };\n  }\n\n  getSource(tableName: string): Source {\n    let source = this.#sources.get(tableName);\n    if (source) {\n      return source;\n    }\n\n    const tableSchema = this.#schema.tables[tableName];\n\n    source = new TableSource(\n      this.#lc,\n      this.#logConfig,\n      this.#db,\n      tableName,\n      tableSchema.columns,\n      tableSchema.primaryKey,\n    );\n\n    this.#sources.set(tableName, source);\n    return source;\n  }\n\n  onTransactionCommit(cb: CommitListener) {\n    this.#commitObservers.add(cb);\n    return () => {\n      this.#commitObservers.delete(cb);\n    };\n  }\n  override batchViewUpdates<T>(applyViewUpdates: () => T): T {\n    const ret = applyViewUpdates();\n    for (const observer of this.#commitObservers) {\n      observer();\n    }\n    return ret;\n  }\n}\n"],"mappings":";;;AASA,IAAa,oBAAb,cAAuC,kBAAkB;CACvD;CACA;CACA;CACA,2BAAyC,IAAI,IAAI;CACjD;CACA,uBAAgC;CAChC,mCAA4B,IAAI,IAAgB;CAEhD,YACE,IACA,IACA,QACA,WACA;EACA,MAAM;EACN,KAAKA,MAAM,GAAG,YAAY,SAAS,mBAAmB;EACtD,KAAKC,MAAM;EACX,KAAKC,UAAU;EACf,KAAKE,aAAa,aAAa;GAC7B,QAAQ;GACR,aAAa;GACb,OAAO;GACP,sBAAsB;GACtB,kBAAkB;EACpB;CACF;CAEA,UAAU,WAA2B;EACnC,IAAI,SAAS,KAAKD,SAAS,IAAI,SAAS;EACxC,IAAI,QACF,OAAO;EAGT,MAAM,cAAc,KAAKD,QAAQ,OAAO;EAExC,SAAS,IAAI,YACX,KAAKF,KACL,KAAKI,YACL,KAAKH,KACL,WACA,YAAY,SACZ,YAAY,UACd;EAEA,KAAKE,SAAS,IAAI,WAAW,MAAM;EACnC,OAAO;CACT;CAEA,oBAAoB,IAAoB;EACtC,KAAKE,iBAAiB,IAAI,EAAE;EAC5B,aAAa;GACX,KAAKA,iBAAiB,OAAO,EAAE;EACjC;CACF;CACA,iBAA6B,kBAA8B;EACzD,MAAM,MAAM,iBAAiB;EAC7B,KAAK,MAAM,YAAY,KAAKA,kBAC1B,SAAS;EAEX,OAAO;CACT;AACF"}
+{"version":3,"file":"query-delegate.js","names":["#lc","#db","#schema","#sources","#logConfig","#commitObservers"],"sources":["../../../../zqlite/src/query-delegate.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport type {LogConfig} from '../../otel/src/log-options.ts';\nimport {getOrInsertComputed} from '../../shared/src/map.ts';\nimport type {Schema} from '../../zero-types/src/schema.ts';\nimport type {Source} from '../../zql/src/ivm/source.ts';\nimport {QueryDelegateBase} from '../../zql/src/query/query-delegate-base.ts';\nimport type {CommitListener} from '../../zql/src/query/query-delegate.ts';\nimport type {Database} from './db.ts';\nimport {TableSource} from './table-source.ts';\n\nexport class QueryDelegateImpl extends QueryDelegateBase {\n  readonly #lc: LogContext;\n  readonly #db: Database;\n  readonly #schema: Schema;\n  readonly #sources: Map<string, Source> = new Map();\n  readonly #logConfig: LogConfig;\n  readonly defaultQueryComplete = true;\n  readonly #commitObservers = new Set<() => void>();\n\n  constructor(\n    lc: LogContext,\n    db: Database,\n    schema: Schema,\n    logConfig?: LogConfig,\n  ) {\n    super();\n    this.#lc = lc.withContext('class', 'QueryDelegateImpl');\n    this.#db = db;\n    this.#schema = schema;\n    this.#logConfig = logConfig ?? {\n      format: 'text',\n      ivmSampling: 0,\n      level: 'info',\n      slowHydrateThreshold: 0,\n      slowAdvanceThreshold: 0,\n      queryStatsIntervalSeconds: 0,\n      slowRowThreshold: 0,\n      planWarningRowThreshold: 0,\n      planWarningCostThreshold: 0,\n    };\n  }\n\n  getSource(tableName: string): Source {\n    return getOrInsertComputed(this.#sources, tableName, tableName => {\n      const tableSchema = this.#schema.tables[tableName];\n      return new TableSource(\n        this.#lc,\n        this.#logConfig,\n        this.#db,\n        tableName,\n        tableSchema.columns,\n        tableSchema.primaryKey,\n      );\n    });\n  }\n\n  onTransactionCommit(cb: CommitListener) {\n    this.#commitObservers.add(cb);\n    return () => {\n      this.#commitObservers.delete(cb);\n    };\n  }\n  override batchViewUpdates<T>(applyViewUpdates: () => T): T {\n    const ret = applyViewUpdates();\n    for (const observer of this.#commitObservers) {\n      observer();\n    }\n    return ret;\n  }\n}\n"],"mappings":";;;;AAUA,IAAa,oBAAb,cAAuC,kBAAkB;CACvD;CACA;CACA;CACA,2BAAyC,IAAI,IAAI;CACjD;CACA,uBAAgC;CAChC,mCAA4B,IAAI,IAAgB;CAEhD,YACE,IACA,IACA,QACA,WACA;EACA,MAAM;EACN,KAAKA,MAAM,GAAG,YAAY,SAAS,mBAAmB;EACtD,KAAKC,MAAM;EACX,KAAKC,UAAU;EACf,KAAKE,aAAa,aAAa;GAC7B,QAAQ;GACR,aAAa;GACb,OAAO;GACP,sBAAsB;GACtB,sBAAsB;GACtB,2BAA2B;GAC3B,kBAAkB;GAClB,yBAAyB;GACzB,0BAA0B;EAC5B;CACF;CAEA,UAAU,WAA2B;EACnC,OAAO,oBAAoB,KAAKD,UAAU,YAAW,cAAa;GAChE,MAAM,cAAc,KAAKD,QAAQ,OAAO;GACxC,OAAO,IAAI,YACT,KAAKF,KACL,KAAKI,YACL,KAAKH,KACL,WACA,YAAY,SACZ,YAAY,UACd;EACF,CAAC;CACH;CAEA,oBAAoB,IAAoB;EACtC,KAAKI,iBAAiB,IAAI,EAAE;EAC5B,aAAa;GACX,KAAKA,iBAAiB,OAAO,EAAE;EACjC;CACF;CACA,iBAA6B,kBAA8B;EACzD,MAAM,MAAM,iBAAiB;EAC7B,KAAK,MAAM,YAAY,KAAKA,kBAC1B,SAAS;EAEX,OAAO;CACT;AACF"}

package/out/zqlite/src/resolve-scalar-subqueries.d.ts

@@ -1,4 +1,4 @@
-import type { AST, Condition, LiteralValue } from '../../zero-protocol/src/ast.ts';
+import type { AST, Condition, LiteralValue, System } from '../../zero-protocol/src/ast.ts';
 import type { PrimaryKey } from '../../zero-protocol/src/primary-key.ts';
 type TableSpecWithUniqueKeys = {
     tableSpec: {
@@ -10,6 +10,8 @@ export type CompanionSubquery = {
     ast: AST;
     /** The field in the subquery row whose value was resolved. */
     childField: string;
+    /** The system that added the gate. */
+    system: System | undefined;
     /** The resolved value, `null` if a row matched but the field was `NULL`,
      * or `undefined` if no row matched. */
     resolvedValue: LiteralValue | null | undefined;

package/out/zqlite/src/resolve-scalar-subqueries.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"resolve-scalar-subqueries.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/resolve-scalar-subqueries.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,GAAG,EACH,SAAS,EAET,YAAY,EAEb,MAAM,gCAAgC,CAAC;AACxC,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AAEvE,KAAK,uBAAuB,GAAG;IAC7B,SAAS,EAAE;QACT,UAAU,EAAE,UAAU,EAAE,CAAC;KAC1B,CAAC;CACH,CAAC;AAEF,MAAM,MAAM,iBAAiB,GAAG;IAC9B,mEAAmE;IACnE,GAAG,EAAE,GAAG,CAAC;IACT,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;IACnB;2CACuC;IACvC,aAAa,EAAE,YAAY,GAAG,IAAI,GAAG,SAAS,CAAC;CAChD,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC9B,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,qDAAqD;IACrD,UAAU,EAAE,SAAS,UAAU,EAAE,CAAC;CACnC,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC1B,GAAG,EAAE,GAAG,CAAC;IACT,UAAU,EAAE,iBAAiB,EAAE,CAAC;IAChC;;;OAGG;IACH,kBAAkB,EAAE,iBAAiB,EAAE,CAAC;CACzC,CAAC;AAQF;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,CAC3B,WAAW,EAAE,GAAG,EAChB,UAAU,EAAE,MAAM,KACf,YAAY,GAAG,IAAI,GAAG,SAAS,CAAC;AAErC;;;;;;;;;;;;GAYG;AACH,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,GAAG,EACR,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,uBAAuB,CAAC,EAChD,OAAO,EAAE,cAAc,GACtB,aAAa,CAIf;AA+ID;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,GAAG,EACb,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,uBAAuB,CAAC,GAC/C,OAAO,CAiBT;AAED;;;GAGG;AACH,wBAAgB,iCAAiC,CAC/C,SAAS,EAAE,SAAS,GACnB,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAI3B"}
+{"version":3,"file":"resolve-scalar-subqueries.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/resolve-scalar-subqueries.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,GAAG,EACH,SAAS,EAET,YAAY,EAEZ,MAAM,EACP,MAAM,gCAAgC,CAAC;AACxC,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AAEvE,KAAK,uBAAuB,GAAG;IAC7B,SAAS,EAAE;QACT,UAAU,EAAE,UAAU,EAAE,CAAC;KAC1B,CAAC;CACH,CAAC;AAEF,MAAM,MAAM,iBAAiB,GAAG;IAC9B,mEAAmE;IACnE,GAAG,EAAE,GAAG,CAAC;IACT,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;IACnB,sCAAsC;IACtC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B;2CACuC;IACvC,aAAa,EAAE,YAAY,GAAG,IAAI,GAAG,SAAS,CAAC;CAChD,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC9B,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,qDAAqD;IACrD,UAAU,EAAE,SAAS,UAAU,EAAE,CAAC;CACnC,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC1B,GAAG,EAAE,GAAG,CAAC;IACT,UAAU,EAAE,iBAAiB,EAAE,CAAC;IAChC;;;OAGG;IACH,kBAAkB,EAAE,iBAAiB,EAAE,CAAC;CACzC,CAAC;AAQF;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,CAC3B,WAAW,EAAE,GAAG,EAChB,UAAU,EAAE,MAAM,KACf,YAAY,GAAG,IAAI,GAAG,SAAS,CAAC;AAErC;;;;;;;;;;;;GAYG;AACH,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,GAAG,EACR,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,uBAAuB,CAAC,EAChD,OAAO,EAAE,cAAc,GACtB,aAAa,CAIf;AAgJD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,GAAG,EACb,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,uBAAuB,CAAC,GAC/C,OAAO,CAiBT;AAED;;;GAGG;AACH,wBAAgB,iCAAiC,CAC/C,SAAS,EAAE,SAAS,GACnB,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAI3B"}

package/out/zqlite/src/resolve-scalar-subqueries.js

@@ -84,6 +84,7 @@ function resolveScalarSubquery(condition, tableSpecs, execute, out) {
 	out.companions.push({
 		ast: subquery,
 		childField,
+		system: condition.related.system,
 		resolvedValue: value
 	});
 	if (value === void 0 || value === null) return condition.op === "EXISTS" ? ALWAYS_FALSE : ALWAYS_TRUE;

package/out/zqlite/src/resolve-scalar-subqueries.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolve-scalar-subqueries.js","names":[],"sources":["../../../../zqlite/src/resolve-scalar-subqueries.ts"],"sourcesContent":["import type {\n  AST,\n  Condition,\n  CorrelatedSubqueryCondition,\n  LiteralValue,\n  SimpleCondition,\n} from '../../zero-protocol/src/ast.ts';\nimport type {PrimaryKey} from '../../zero-protocol/src/primary-key.ts';\n\ntype TableSpecWithUniqueKeys = {\n  tableSpec: {\n    uniqueKeys: PrimaryKey[];\n  };\n};\n\nexport type CompanionSubquery = {\n  /** The original scalar subquery AST (the subquery table query). */\n  ast: AST;\n  /** The field in the subquery row whose value was resolved. */\n  childField: string;\n  /** The resolved value, `null` if a row matched but the field was `NULL`,\n   * or `undefined` if no row matched. */\n  resolvedValue: LiteralValue | null | undefined;\n};\n\n/**\n * A `scalar` hint that could not be honored: the subquery was not provably\n * limited to one row, so the gate was left as a plain EXISTS.\n */\nexport type IgnoredScalarHint = {\n  /** The subquery's table. */\n  table: string;\n  /** The unique keys that were available to pin it. */\n  uniqueKeys: readonly PrimaryKey[];\n};\n\nexport type ResolveResult = {\n  ast: AST;\n  companions: CompanionSubquery[];\n  /**\n   * Hints the caller may want to surface: each one is a `{scalar: true}` the\n   * author asked for and did not get. See {@link IgnoredScalarHint}.\n   */\n  ignoredScalarHints: IgnoredScalarHint[];\n};\n\n/** Accumulators threaded through the recursion. */\ntype Out = {\n  companions: CompanionSubquery[];\n  ignoredScalarHints: IgnoredScalarHint[];\n};\n\n/**\n * Callback that executes a scalar subquery and returns the value of\n * `childField` from the (at most one) matching row, or `undefined`\n * if no rows match.\n */\nexport type ScalarExecutor = (\n  subqueryAST: AST,\n  childField: string,\n) => LiteralValue | null | undefined;\n\n/**\n * Resolves \"simple\" scalar subqueries by calling the provided executor\n * and replacing them with literal conditions. A scalar subquery is simple\n * when all columns of at least one unique index on the subquery table are\n * equality-constrained by literal values in the subquery's WHERE clause\n * (using only AND conjunctions).\n *\n * Non-simple scalar subqueries are left untouched for the existing\n * EXISTS rewrite in buildPipelineInternal.\n *\n * Returns the resolved AST and a list of companion subquery ASTs whose\n * rows need to be synced to the client for the EXISTS rewrite to work.\n */\nexport function resolveSimpleScalarSubqueries(\n  ast: AST,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n): ResolveResult {\n  const out: Out = {companions: [], ignoredScalarHints: []};\n  const resolved = resolveASTRecursive(ast, tableSpecs, execute, out);\n  return {ast: resolved, ...out};\n}\n\nfunction resolveASTRecursive(\n  ast: AST,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n  out: Out,\n): AST {\n  const where = ast.where\n    ? resolveCondition(ast.where, tableSpecs, execute, out)\n    : undefined;\n\n  const related = ast.related?.map(r => ({\n    ...r,\n    subquery: resolveASTRecursive(r.subquery, tableSpecs, execute, out),\n  }));\n\n  if (where !== ast.where || related !== ast.related) {\n    return {...ast, where, related};\n  }\n  return ast;\n}\n\nfunction resolveCondition(\n  condition: Condition,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n  out: Out,\n): Condition {\n  switch (condition.type) {\n    case 'correlatedSubquery':\n      if (condition.scalar) {\n        return resolveScalarSubquery(condition, tableSpecs, execute, out);\n      }\n      // Non-scalar correlated subquery: recurse into its subquery\n      {\n        const resolvedSubquery = resolveASTRecursive(\n          condition.related.subquery,\n          tableSpecs,\n          execute,\n          out,\n        );\n        if (resolvedSubquery !== condition.related.subquery) {\n          return {\n            ...condition,\n            related: {...condition.related, subquery: resolvedSubquery},\n          };\n        }\n        return condition;\n      }\n    case 'and':\n    case 'or': {\n      const resolved = condition.conditions.map(c =>\n        resolveCondition(c, tableSpecs, execute, out),\n      );\n      if (resolved.every((c, i) => c === condition.conditions[i])) {\n        return condition;\n      }\n      return {type: condition.type, conditions: resolved};\n    }\n    default:\n      return condition;\n  }\n}\n\nfunction resolveScalarSubquery(\n  condition: CorrelatedSubqueryCondition,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n  out: Out,\n): Condition {\n  const parentField = condition.related.correlation.parentField[0];\n  const childField = condition.related.correlation.childField[0];\n\n  // Recursively resolve any scalar subqueries nested in the\n  // subquery's own WHERE (and related) before evaluating this one.\n  const subquery = resolveASTRecursive(\n    condition.related.subquery,\n    tableSpecs,\n    execute,\n    out,\n  );\n\n  if (!isSimpleSubquery(subquery, tableSpecs)) {\n    // The author asked for a scalar rewrite and is not getting one. Record it\n    // so the caller can say so — silently falling back is the whole reason the\n    // hint is easy to get wrong.\n    out.ignoredScalarHints.push({\n      table: subquery.table,\n      uniqueKeys: tableSpecs.get(subquery.table)?.tableSpec.uniqueKeys ?? [],\n    });\n    // Return with the (possibly partially-resolved) subquery.\n    if (subquery !== condition.related.subquery) {\n      return {\n        ...condition,\n        related: {...condition.related, subquery},\n      };\n    }\n    return condition;\n  }\n\n  const value = execute(subquery, childField);\n\n  // Record the companion subquery AST so its rows are synced to the client.\n  // The client rewrites scalar subqueries to EXISTS and needs those rows.\n  out.companions.push({\n    ast: subquery,\n    childField,\n    resolvedValue: value,\n  });\n\n  if (value === undefined || value === null) {\n    // No row matched, or the matched row's `childField` is NULL (which can\n    // never satisfy the correlation, since `parentField = NULL` is never\n    // true). Either way the correlated EXISTS is false for *every* parent\n    // row, so the gate collapses to a constant: false for EXISTS, and its\n    // negation — true — for NOT EXISTS.\n    return condition.op === 'EXISTS' ? ALWAYS_FALSE : ALWAYS_TRUE;\n  }\n\n  const op = condition.op === 'EXISTS' ? '=' : 'IS NOT';\n  return {\n    type: 'simple',\n    op,\n    left: {type: 'column', name: parentField},\n    right: {type: 'literal', value},\n  } satisfies SimpleCondition;\n}\n\nconst ALWAYS_FALSE: SimpleCondition = {\n  type: 'simple',\n  op: '=',\n  left: {type: 'literal', value: 1},\n  right: {type: 'literal', value: 0},\n};\n\nconst ALWAYS_TRUE: SimpleCondition = {\n  type: 'simple',\n  op: '=',\n  left: {type: 'literal', value: 1},\n  right: {type: 'literal', value: 1},\n};\n\n/**\n * Checks if the subquery is guaranteed to return at most one deterministic row.\n *\n * This is true when all columns of at least one unique index on the subquery\n * table are equality-constrained by literal values in the WHERE clause\n * (using only AND conjunctions).\n */\nexport function isSimpleSubquery(\n  subquery: AST,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n): boolean {\n  const spec = tableSpecs.get(subquery.table);\n  if (!spec) {\n    return false;\n  }\n\n  if (!subquery.where) {\n    return false;\n  }\n\n  const constraints = extractLiteralEqualityConstraints(subquery.where);\n  if (constraints.size === 0) {\n    return false;\n  }\n\n  const {uniqueKeys} = spec.tableSpec;\n  return uniqueKeys.some(key => key.every(col => constraints.has(col)));\n}\n\n/**\n * Extracts column=literal equality constraints from a condition tree,\n * only following AND conjunctions (not OR).\n */\nexport function extractLiteralEqualityConstraints(\n  condition: Condition,\n): Map<string, LiteralValue> {\n  const constraints = new Map<string, LiteralValue>();\n  collectConstraints(condition, constraints);\n  return constraints;\n}\n\nfunction collectConstraints(\n  condition: Condition,\n  constraints: Map<string, LiteralValue>,\n): void {\n  switch (condition.type) {\n    case 'simple':\n      if (condition.op === '=') {\n        if (\n          condition.left.type === 'column' &&\n          condition.right.type === 'literal'\n        ) {\n          constraints.set(condition.left.name, condition.right.value);\n        }\n      }\n      break;\n    case 'and':\n      for (const c of condition.conditions) {\n        collectConstraints(c, constraints);\n      }\n      break;\n    // OR, correlatedSubquery (non-scalar) — don't contribute constraints\n    default:\n      break;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AA2EA,SAAgB,8BACd,KACA,YACA,SACe;CACf,MAAM,MAAW;EAAC,YAAY,CAAC;EAAG,oBAAoB,CAAC;CAAC;CAExD,OAAO;EAAC,KADS,oBAAoB,KAAK,YAAY,SAAS,GAClD;EAAU,GAAG;CAAG;AAC/B;AAEA,SAAS,oBACP,KACA,YACA,SACA,KACK;CACL,MAAM,QAAQ,IAAI,QACd,iBAAiB,IAAI,OAAO,YAAY,SAAS,GAAG,IACpD,KAAA;CAEJ,MAAM,UAAU,IAAI,SAAS,KAAI,OAAM;EACrC,GAAG;EACH,UAAU,oBAAoB,EAAE,UAAU,YAAY,SAAS,GAAG;CACpE,EAAE;CAEF,IAAI,UAAU,IAAI,SAAS,YAAY,IAAI,SACzC,OAAO;EAAC,GAAG;EAAK;EAAO;CAAO;CAEhC,OAAO;AACT;AAEA,SAAS,iBACP,WACA,YACA,SACA,KACW;CACX,QAAQ,UAAU,MAAlB;EACE,KAAK;GACH,IAAI,UAAU,QACZ,OAAO,sBAAsB,WAAW,YAAY,SAAS,GAAG;GAGlE;IACE,MAAM,mBAAmB,oBACvB,UAAU,QAAQ,UAClB,YACA,SACA,GACF;IACA,IAAI,qBAAqB,UAAU,QAAQ,UACzC,OAAO;KACL,GAAG;KACH,SAAS;MAAC,GAAG,UAAU;MAAS,UAAU;KAAgB;IAC5D;IAEF,OAAO;GACT;EACF,KAAK;EACL,KAAK,MAAM;GACT,MAAM,WAAW,UAAU,WAAW,KAAI,MACxC,iBAAiB,GAAG,YAAY,SAAS,GAAG,CAC9C;GACA,IAAI,SAAS,OAAO,GAAG,MAAM,MAAM,UAAU,WAAW,EAAE,GACxD,OAAO;GAET,OAAO;IAAC,MAAM,UAAU;IAAM,YAAY;GAAQ;EACpD;EACA,SACE,OAAO;CACX;AACF;AAEA,SAAS,sBACP,WACA,YACA,SACA,KACW;CACX,MAAM,cAAc,UAAU,QAAQ,YAAY,YAAY;CAC9D,MAAM,aAAa,UAAU,QAAQ,YAAY,WAAW;CAI5D,MAAM,WAAW,oBACf,UAAU,QAAQ,UAClB,YACA,SACA,GACF;CAEA,IAAI,CAAC,iBAAiB,UAAU,UAAU,GAAG;EAI3C,IAAI,mBAAmB,KAAK;GAC1B,OAAO,SAAS;GAChB,YAAY,WAAW,IAAI,SAAS,KAAK,GAAG,UAAU,cAAc,CAAC;EACvE,CAAC;EAED,IAAI,aAAa,UAAU,QAAQ,UACjC,OAAO;GACL,GAAG;GACH,SAAS;IAAC,GAAG,UAAU;IAAS;GAAQ;EAC1C;EAEF,OAAO;CACT;CAEA,MAAM,QAAQ,QAAQ,UAAU,UAAU;CAI1C,IAAI,WAAW,KAAK;EAClB,KAAK;EACL;EACA,eAAe;CACjB,CAAC;CAED,IAAI,UAAU,KAAA,KAAa,UAAU,MAMnC,OAAO,UAAU,OAAO,WAAW,eAAe;CAIpD,OAAO;EACL,MAAM;EACN,IAHS,UAAU,OAAO,WAAW,MAAM;EAI3C,MAAM;GAAC,MAAM;GAAU,MAAM;EAAW;EACxC,OAAO;GAAC,MAAM;GAAW;EAAK;CAChC;AACF;AAEA,IAAM,eAAgC;CACpC,MAAM;CACN,IAAI;CACJ,MAAM;EAAC,MAAM;EAAW,OAAO;CAAC;CAChC,OAAO;EAAC,MAAM;EAAW,OAAO;CAAC;AACnC;AAEA,IAAM,cAA+B;CACnC,MAAM;CACN,IAAI;CACJ,MAAM;EAAC,MAAM;EAAW,OAAO;CAAC;CAChC,OAAO;EAAC,MAAM;EAAW,OAAO;CAAC;AACnC;;;;;;;;AASA,SAAgB,iBACd,UACA,YACS;CACT,MAAM,OAAO,WAAW,IAAI,SAAS,KAAK;CAC1C,IAAI,CAAC,MACH,OAAO;CAGT,IAAI,CAAC,SAAS,OACZ,OAAO;CAGT,MAAM,cAAc,kCAAkC,SAAS,KAAK;CACpE,IAAI,YAAY,SAAS,GACvB,OAAO;CAGT,MAAM,EAAC,eAAc,KAAK;CAC1B,OAAO,WAAW,MAAK,QAAO,IAAI,OAAM,QAAO,YAAY,IAAI,GAAG,CAAC,CAAC;AACtE;;;;;AAMA,SAAgB,kCACd,WAC2B;CAC3B,MAAM,8BAAc,IAAI,IAA0B;CAClD,mBAAmB,WAAW,WAAW;CACzC,OAAO;AACT;AAEA,SAAS,mBACP,WACA,aACM;CACN,QAAQ,UAAU,MAAlB;EACE,KAAK;GACH,IAAI,UAAU,OAAO;QAEjB,UAAU,KAAK,SAAS,YACxB,UAAU,MAAM,SAAS,WAEzB,YAAY,IAAI,UAAU,KAAK,MAAM,UAAU,MAAM,KAAK;GAAA;GAG9D;EACF,KAAK;GACH,KAAK,MAAM,KAAK,UAAU,YACxB,mBAAmB,GAAG,WAAW;GAEnC;EAEF,SACE;CACJ;AACF"}
+{"version":3,"file":"resolve-scalar-subqueries.js","names":[],"sources":["../../../../zqlite/src/resolve-scalar-subqueries.ts"],"sourcesContent":["import type {\n  AST,\n  Condition,\n  CorrelatedSubqueryCondition,\n  LiteralValue,\n  SimpleCondition,\n  System,\n} from '../../zero-protocol/src/ast.ts';\nimport type {PrimaryKey} from '../../zero-protocol/src/primary-key.ts';\n\ntype TableSpecWithUniqueKeys = {\n  tableSpec: {\n    uniqueKeys: PrimaryKey[];\n  };\n};\n\nexport type CompanionSubquery = {\n  /** The original scalar subquery AST (the subquery table query). */\n  ast: AST;\n  /** The field in the subquery row whose value was resolved. */\n  childField: string;\n  /** The system that added the gate. */\n  system: System | undefined;\n  /** The resolved value, `null` if a row matched but the field was `NULL`,\n   * or `undefined` if no row matched. */\n  resolvedValue: LiteralValue | null | undefined;\n};\n\n/**\n * A `scalar` hint that could not be honored: the subquery was not provably\n * limited to one row, so the gate was left as a plain EXISTS.\n */\nexport type IgnoredScalarHint = {\n  /** The subquery's table. */\n  table: string;\n  /** The unique keys that were available to pin it. */\n  uniqueKeys: readonly PrimaryKey[];\n};\n\nexport type ResolveResult = {\n  ast: AST;\n  companions: CompanionSubquery[];\n  /**\n   * Hints the caller may want to surface: each one is a `{scalar: true}` the\n   * author asked for and did not get. See {@link IgnoredScalarHint}.\n   */\n  ignoredScalarHints: IgnoredScalarHint[];\n};\n\n/** Accumulators threaded through the recursion. */\ntype Out = {\n  companions: CompanionSubquery[];\n  ignoredScalarHints: IgnoredScalarHint[];\n};\n\n/**\n * Callback that executes a scalar subquery and returns the value of\n * `childField` from the (at most one) matching row, or `undefined`\n * if no rows match.\n */\nexport type ScalarExecutor = (\n  subqueryAST: AST,\n  childField: string,\n) => LiteralValue | null | undefined;\n\n/**\n * Resolves \"simple\" scalar subqueries by calling the provided executor\n * and replacing them with literal conditions. A scalar subquery is simple\n * when all columns of at least one unique index on the subquery table are\n * equality-constrained by literal values in the subquery's WHERE clause\n * (using only AND conjunctions).\n *\n * Non-simple scalar subqueries are left untouched for the existing\n * EXISTS rewrite in buildPipelineInternal.\n *\n * Returns the resolved AST and a list of companion subquery ASTs whose\n * rows need to be synced to the client for the EXISTS rewrite to work.\n */\nexport function resolveSimpleScalarSubqueries(\n  ast: AST,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n): ResolveResult {\n  const out: Out = {companions: [], ignoredScalarHints: []};\n  const resolved = resolveASTRecursive(ast, tableSpecs, execute, out);\n  return {ast: resolved, ...out};\n}\n\nfunction resolveASTRecursive(\n  ast: AST,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n  out: Out,\n): AST {\n  const where = ast.where\n    ? resolveCondition(ast.where, tableSpecs, execute, out)\n    : undefined;\n\n  const related = ast.related?.map(r => ({\n    ...r,\n    subquery: resolveASTRecursive(r.subquery, tableSpecs, execute, out),\n  }));\n\n  if (where !== ast.where || related !== ast.related) {\n    return {...ast, where, related};\n  }\n  return ast;\n}\n\nfunction resolveCondition(\n  condition: Condition,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n  out: Out,\n): Condition {\n  switch (condition.type) {\n    case 'correlatedSubquery':\n      if (condition.scalar) {\n        return resolveScalarSubquery(condition, tableSpecs, execute, out);\n      }\n      // Non-scalar correlated subquery: recurse into its subquery\n      {\n        const resolvedSubquery = resolveASTRecursive(\n          condition.related.subquery,\n          tableSpecs,\n          execute,\n          out,\n        );\n        if (resolvedSubquery !== condition.related.subquery) {\n          return {\n            ...condition,\n            related: {...condition.related, subquery: resolvedSubquery},\n          };\n        }\n        return condition;\n      }\n    case 'and':\n    case 'or': {\n      const resolved = condition.conditions.map(c =>\n        resolveCondition(c, tableSpecs, execute, out),\n      );\n      if (resolved.every((c, i) => c === condition.conditions[i])) {\n        return condition;\n      }\n      return {type: condition.type, conditions: resolved};\n    }\n    default:\n      return condition;\n  }\n}\n\nfunction resolveScalarSubquery(\n  condition: CorrelatedSubqueryCondition,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n  execute: ScalarExecutor,\n  out: Out,\n): Condition {\n  const parentField = condition.related.correlation.parentField[0];\n  const childField = condition.related.correlation.childField[0];\n\n  // Recursively resolve any scalar subqueries nested in the\n  // subquery's own WHERE (and related) before evaluating this one.\n  const subquery = resolveASTRecursive(\n    condition.related.subquery,\n    tableSpecs,\n    execute,\n    out,\n  );\n\n  if (!isSimpleSubquery(subquery, tableSpecs)) {\n    // The author asked for a scalar rewrite and is not getting one. Record it\n    // so the caller can say so — silently falling back is the whole reason the\n    // hint is easy to get wrong.\n    out.ignoredScalarHints.push({\n      table: subquery.table,\n      uniqueKeys: tableSpecs.get(subquery.table)?.tableSpec.uniqueKeys ?? [],\n    });\n    // Return with the (possibly partially-resolved) subquery.\n    if (subquery !== condition.related.subquery) {\n      return {\n        ...condition,\n        related: {...condition.related, subquery},\n      };\n    }\n    return condition;\n  }\n\n  const value = execute(subquery, childField);\n\n  // Record the companion subquery AST so its rows are synced to the client.\n  // The client rewrites scalar subqueries to EXISTS and needs those rows.\n  out.companions.push({\n    ast: subquery,\n    childField,\n    system: condition.related.system,\n    resolvedValue: value,\n  });\n\n  if (value === undefined || value === null) {\n    // No row matched, or the matched row's `childField` is NULL (which can\n    // never satisfy the correlation, since `parentField = NULL` is never\n    // true). Either way the correlated EXISTS is false for *every* parent\n    // row, so the gate collapses to a constant: false for EXISTS, and its\n    // negation — true — for NOT EXISTS.\n    return condition.op === 'EXISTS' ? ALWAYS_FALSE : ALWAYS_TRUE;\n  }\n\n  const op = condition.op === 'EXISTS' ? '=' : 'IS NOT';\n  return {\n    type: 'simple',\n    op,\n    left: {type: 'column', name: parentField},\n    right: {type: 'literal', value},\n  } satisfies SimpleCondition;\n}\n\nconst ALWAYS_FALSE: SimpleCondition = {\n  type: 'simple',\n  op: '=',\n  left: {type: 'literal', value: 1},\n  right: {type: 'literal', value: 0},\n};\n\nconst ALWAYS_TRUE: SimpleCondition = {\n  type: 'simple',\n  op: '=',\n  left: {type: 'literal', value: 1},\n  right: {type: 'literal', value: 1},\n};\n\n/**\n * Checks if the subquery is guaranteed to return at most one deterministic row.\n *\n * This is true when all columns of at least one unique index on the subquery\n * table are equality-constrained by literal values in the WHERE clause\n * (using only AND conjunctions).\n */\nexport function isSimpleSubquery(\n  subquery: AST,\n  tableSpecs: Map<string, TableSpecWithUniqueKeys>,\n): boolean {\n  const spec = tableSpecs.get(subquery.table);\n  if (!spec) {\n    return false;\n  }\n\n  if (!subquery.where) {\n    return false;\n  }\n\n  const constraints = extractLiteralEqualityConstraints(subquery.where);\n  if (constraints.size === 0) {\n    return false;\n  }\n\n  const {uniqueKeys} = spec.tableSpec;\n  return uniqueKeys.some(key => key.every(col => constraints.has(col)));\n}\n\n/**\n * Extracts column=literal equality constraints from a condition tree,\n * only following AND conjunctions (not OR).\n */\nexport function extractLiteralEqualityConstraints(\n  condition: Condition,\n): Map<string, LiteralValue> {\n  const constraints = new Map<string, LiteralValue>();\n  collectConstraints(condition, constraints);\n  return constraints;\n}\n\nfunction collectConstraints(\n  condition: Condition,\n  constraints: Map<string, LiteralValue>,\n): void {\n  switch (condition.type) {\n    case 'simple':\n      if (condition.op === '=') {\n        if (\n          condition.left.type === 'column' &&\n          condition.right.type === 'literal'\n        ) {\n          constraints.set(condition.left.name, condition.right.value);\n        }\n      }\n      break;\n    case 'and':\n      for (const c of condition.conditions) {\n        collectConstraints(c, constraints);\n      }\n      break;\n    // OR, correlatedSubquery (non-scalar) — don't contribute constraints\n    default:\n      break;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AA8EA,SAAgB,8BACd,KACA,YACA,SACe;CACf,MAAM,MAAW;EAAC,YAAY,CAAC;EAAG,oBAAoB,CAAC;CAAC;CAExD,OAAO;EAAC,KADS,oBAAoB,KAAK,YAAY,SAAS,GAClD;EAAU,GAAG;CAAG;AAC/B;AAEA,SAAS,oBACP,KACA,YACA,SACA,KACK;CACL,MAAM,QAAQ,IAAI,QACd,iBAAiB,IAAI,OAAO,YAAY,SAAS,GAAG,IACpD,KAAA;CAEJ,MAAM,UAAU,IAAI,SAAS,KAAI,OAAM;EACrC,GAAG;EACH,UAAU,oBAAoB,EAAE,UAAU,YAAY,SAAS,GAAG;CACpE,EAAE;CAEF,IAAI,UAAU,IAAI,SAAS,YAAY,IAAI,SACzC,OAAO;EAAC,GAAG;EAAK;EAAO;CAAO;CAEhC,OAAO;AACT;AAEA,SAAS,iBACP,WACA,YACA,SACA,KACW;CACX,QAAQ,UAAU,MAAlB;EACE,KAAK;GACH,IAAI,UAAU,QACZ,OAAO,sBAAsB,WAAW,YAAY,SAAS,GAAG;GAGlE;IACE,MAAM,mBAAmB,oBACvB,UAAU,QAAQ,UAClB,YACA,SACA,GACF;IACA,IAAI,qBAAqB,UAAU,QAAQ,UACzC,OAAO;KACL,GAAG;KACH,SAAS;MAAC,GAAG,UAAU;MAAS,UAAU;KAAgB;IAC5D;IAEF,OAAO;GACT;EACF,KAAK;EACL,KAAK,MAAM;GACT,MAAM,WAAW,UAAU,WAAW,KAAI,MACxC,iBAAiB,GAAG,YAAY,SAAS,GAAG,CAC9C;GACA,IAAI,SAAS,OAAO,GAAG,MAAM,MAAM,UAAU,WAAW,EAAE,GACxD,OAAO;GAET,OAAO;IAAC,MAAM,UAAU;IAAM,YAAY;GAAQ;EACpD;EACA,SACE,OAAO;CACX;AACF;AAEA,SAAS,sBACP,WACA,YACA,SACA,KACW;CACX,MAAM,cAAc,UAAU,QAAQ,YAAY,YAAY;CAC9D,MAAM,aAAa,UAAU,QAAQ,YAAY,WAAW;CAI5D,MAAM,WAAW,oBACf,UAAU,QAAQ,UAClB,YACA,SACA,GACF;CAEA,IAAI,CAAC,iBAAiB,UAAU,UAAU,GAAG;EAI3C,IAAI,mBAAmB,KAAK;GAC1B,OAAO,SAAS;GAChB,YAAY,WAAW,IAAI,SAAS,KAAK,GAAG,UAAU,cAAc,CAAC;EACvE,CAAC;EAED,IAAI,aAAa,UAAU,QAAQ,UACjC,OAAO;GACL,GAAG;GACH,SAAS;IAAC,GAAG,UAAU;IAAS;GAAQ;EAC1C;EAEF,OAAO;CACT;CAEA,MAAM,QAAQ,QAAQ,UAAU,UAAU;CAI1C,IAAI,WAAW,KAAK;EAClB,KAAK;EACL;EACA,QAAQ,UAAU,QAAQ;EAC1B,eAAe;CACjB,CAAC;CAED,IAAI,UAAU,KAAA,KAAa,UAAU,MAMnC,OAAO,UAAU,OAAO,WAAW,eAAe;CAIpD,OAAO;EACL,MAAM;EACN,IAHS,UAAU,OAAO,WAAW,MAAM;EAI3C,MAAM;GAAC,MAAM;GAAU,MAAM;EAAW;EACxC,OAAO;GAAC,MAAM;GAAW;EAAK;CAChC;AACF;AAEA,IAAM,eAAgC;CACpC,MAAM;CACN,IAAI;CACJ,MAAM;EAAC,MAAM;EAAW,OAAO;CAAC;CAChC,OAAO;EAAC,MAAM;EAAW,OAAO;CAAC;AACnC;AAEA,IAAM,cAA+B;CACnC,MAAM;CACN,IAAI;CACJ,MAAM;EAAC,MAAM;EAAW,OAAO;CAAC;CAChC,OAAO;EAAC,MAAM;EAAW,OAAO;CAAC;AACnC;;;;;;;;AASA,SAAgB,iBACd,UACA,YACS;CACT,MAAM,OAAO,WAAW,IAAI,SAAS,KAAK;CAC1C,IAAI,CAAC,MACH,OAAO;CAGT,IAAI,CAAC,SAAS,OACZ,OAAO;CAGT,MAAM,cAAc,kCAAkC,SAAS,KAAK;CACpE,IAAI,YAAY,SAAS,GACvB,OAAO;CAGT,MAAM,EAAC,eAAc,KAAK;CAC1B,OAAO,WAAW,MAAK,QAAO,IAAI,OAAM,QAAO,YAAY,IAAI,GAAG,CAAC,CAAC;AACtE;;;;;AAMA,SAAgB,kCACd,WAC2B;CAC3B,MAAM,8BAAc,IAAI,IAA0B;CAClD,mBAAmB,WAAW,WAAW;CACzC,OAAO;AACT;AAEA,SAAS,mBACP,WACA,aACM;CACN,QAAQ,UAAU,MAAlB;EACE,KAAK;GACH,IAAI,UAAU,OAAO;QAEjB,UAAU,KAAK,SAAS,YACxB,UAAU,MAAM,SAAS,WAEzB,YAAY,IAAI,UAAU,KAAK,MAAM,UAAU,MAAM,KAAK;GAAA;GAG9D;EACF,KAAK;GACH,KAAK,MAAM,KAAK,UAAU,YACxB,mBAAmB,GAAG,WAAW;GAEnC;EAEF,SACE;CACJ;AACF"}

package/out/zqlite/src/sqlite-cost-model.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-cost-model.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,sCAAsC,CAAC;AAEtE,OAAO,KAAK,EACV,mBAAmB,EAEpB,MAAM,6CAA6C,CAAC;AAErD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAmBjD;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,QAAQ,EACZ,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE;IAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;CAAC,CAAC,GAC9D,mBAAmB,CA+DrB;AAmFD,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAK9C"}
+{"version":3,"file":"sqlite-cost-model.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,sCAAsC,CAAC;AAEtE,OAAO,KAAK,EAEV,mBAAmB,EAEpB,MAAM,6CAA6C,CAAC;AAErD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAmBjD;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,QAAQ,EACZ,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE;IAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;CAAC,CAAC,GAC9D,mBAAmB,CAgErB;AA8JD,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAK9C"}

package/out/zqlite/src/sqlite-cost-model.js

@@ -17,13 +17,64 @@ import SQLite3Database from "@rocicorp/zero-sqlite3";
 */
 function createSQLiteCostModel(db, tableSpecs) {
 	const fanoutEstimator = new SQLiteStatFanout(db);
+	const tableRows = tableRowsReader(db);
 	return (tableName, sort, filters, constraint) => {
 		const noSubqueryFilters = transformFilters(filters).filters;
 		const { zqlSpec } = must(tableSpecs.get(tableName));
 		const sql = compileInline(buildSelectQuery(tableName, zqlSpec, constraint, noSubqueryFilters, sort, void 0, void 0));
 		const loops = getScanstatusLoops(db.prepare(sql));
 		assert(loops.length > 0, `Expected scanstatus to return at least one loop for query: ${sql}`);
-		return estimateCost(loops, (columns) => fanoutEstimator.getFanout(tableName, columns));
+		return {
+			...estimateCost(loops, (columns) => fanoutEstimator.getFanout(tableName, columns)),
+			plan: accessPlan(loops, tableRows(tableName))
+		};
+	};
+}
+/**
+* Returns a function that reads the number of rows in a table from
+* `sqlite_stat1`, or `undefined` if the table has not been analyzed.
+*
+* The counts are cached: they only feed plan warnings, for which the count
+* as of the first plan is close enough.
+*/
+function tableRowsReader(db) {
+	let stmt;
+	const read = (table) => {
+		try {
+			stmt ??= db.prepare("SELECT stat FROM sqlite_stat1 WHERE tbl = ? LIMIT 1");
+			const row = stmt.get(table);
+			const rows = row ? parseInt(row.stat, 10) : NaN;
+			return Number.isNaN(rows) ? void 0 : rows;
+		} catch {
+			return;
+		}
+	};
+	const cache = /* @__PURE__ */ new Map();
+	return (table) => {
+		if (!cache.has(table)) cache.set(table, read(table));
+		return cache.get(table);
+	};
+}
+/**
+* Describes how SQLite reads the rows, from the EXPLAIN text of the
+* statement's top-level loops, e.g.:
+*
+* - `SEARCH issue USING INDEX issue_project (projectID=?)`
+* - `SCAN comment USING INDEX sqlite_autoindex_comment_1` (every row, in the
+*   order of the index)
+* - `SCAN issue` (every row, in table order)
+* - `USE TEMP B-TREE FOR ORDER BY` (a full sort)
+* - `USE TEMP B-TREE FOR LAST TERM OF ORDER BY` or `... RIGHT PART OF ORDER
+*   BY` (sorting runs of rows that tie on the index)
+*/
+function accessPlan(loops, tableRows) {
+	const [first, ...rest] = loops.filter((loop) => loop.parentId === 0);
+	let sort = "none";
+	for (const { explain } of rest) if (explain.startsWith("USE TEMP B-TREE FOR") && explain.includes("ORDER BY")) sort = explain === "USE TEMP B-TREE FOR ORDER BY" ? "full" : "partial";
+	return {
+		access: first?.explain.startsWith("SCAN ") ? "scan" : "search",
+		sort,
+		tableRows
 	};
 }
 /**
@@ -40,6 +91,7 @@ function getScanstatusLoops(stmt) {
 	for (let idx = 0;; idx++) {
 		const selectId = stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_SELECTID, 1);
 		if (selectId === void 0) break;
+		if (selectId === -1) continue;
 		loops.push({
 			selectId: must(selectId),
 			parentId: must(stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_PARENTID, 1)),

package/out/zqlite/src/sqlite-cost-model.js.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-cost-model.js","names":[],"sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"sourcesContent":["import SQLite3Database from '@rocicorp/zero-sqlite3';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {SchemaValue} from '../../zero-types/src/schema-value.ts';\nimport {transformFilters} from '../../zql/src/builder/filter.ts';\nimport type {\n  ConnectionCostModel,\n  CostModelCost,\n} from '../../zql/src/planner/planner-connection.ts';\nimport type {PlannerConstraint} from '../../zql/src/planner/planner-constraint.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compileInline} from './internal/sql-inline.ts';\nimport {buildSelectQuery} from './query-builder.ts';\nimport {SQLiteStatFanout} from './sqlite-stat-fanout.ts';\n\n/**\n * Loop information returned by SQLite's scanstatus API.\n */\ninterface ScanstatusLoop {\n  /** Unique identifier for this loop */\n  selectId: number;\n  /** Parent loop ID, or 0 for root loops */\n  parentId: number;\n  /** Estimated rows emitted per turn of parent loop */\n  est: number;\n  /** EXPLAIN text for this loop to determine: b-tree vs list subquery */\n  explain: string;\n}\n\n/**\n * Creates a SQLite-based cost model for query planning.\n * Uses SQLite's scanstatus API to estimate query costs based on the actual\n * SQLite query planner's analysis.\n *\n * @param db Database instance for preparing statements\n * @param tableSpecs Map of table names to their table specs with ZQL schemas\n * @returns ConnectionCostModel function for use with the planner\n */\nexport function createSQLiteCostModel(\n  db: Database,\n  tableSpecs: Map<string, {zqlSpec: Record<string, SchemaValue>}>,\n): ConnectionCostModel {\n  const fanoutEstimator = new SQLiteStatFanout(db);\n  return (\n    tableName: string,\n    sort: Ordering,\n    filters: Condition | undefined,\n    constraint: PlannerConstraint | undefined,\n  ): CostModelCost => {\n    // Transform filters to remove correlated subqueries.\n    //\n    // We use `transformFilters` (the same function the runtime uses to\n    // decide what to push to the source at connection time). It returns:\n    // - For AND: the non-CSQ conjuncts (a *superset* of the original).\n    // - For OR with any CSQ branch: `undefined` (the OR-with-CSQ is not\n    //   pushable, and matches a strict superset of any single branch).\n    //\n    // This matches what the runtime actually applies at the source. A\n    // previous implementation here had wrong OR semantics — it dropped the\n    // CSQ branch and returned the simple branch alone, which is a strict\n    // *subset* of the original OR's match set, causing the cost model to\n    // under-estimate scan rows for OR-with-CSQ shapes and biasing the\n    // planner toward semi-join plans. See the comment in\n    // `packages/zql/src/builder/filter.ts:transformFilters`.\n    const noSubqueryFilters = transformFilters(filters).filters;\n\n    // Build the SQL query using the same logic as actual queries\n    const {zqlSpec} = must(tableSpecs.get(tableName));\n\n    const query = buildSelectQuery(\n      tableName,\n      zqlSpec,\n      constraint,\n      noSubqueryFilters,\n      sort,\n      undefined, // reverse is undefined here\n      undefined, // start is undefined here\n    );\n\n    // Use compileInline to inline actual values into the SQL for cost estimation.\n    // This allows SQLite's query planner to see real values and make better decisions\n    // about index usage and query plans. This is safe here because it's only used for\n    // cost estimation, not for executing user-facing queries (which use parameterized\n    // queries via the standard compile() function).\n    const sql = compileInline(query);\n\n    // Prepare statement to get scanstatus information\n    const stmt = db.prepare(sql);\n\n    // Get scanstatus loops from the prepared statement\n    const loops = getScanstatusLoops(stmt);\n\n    // Scanstatus should always be available - if we get no loops, something is wrong\n    assert(\n      loops.length > 0,\n      `Expected scanstatus to return at least one loop for query: ${sql}`,\n    );\n\n    const ret = estimateCost(loops, (columns: string[]) =>\n      fanoutEstimator.getFanout(tableName, columns),\n    );\n\n    return ret;\n  };\n}\n\n/**\n * Gets scanstatus loop information from a prepared statement.\n * Iterates through all query elements and extracts loop statistics.\n *\n * Uses SQLITE_SCANSTAT_COMPLEX flag (1) to get all loops including sorting operations.\n *\n * @param stmt Prepared statement to get scanstatus from\n * @returns Array of loop information, or empty array if scanstatus unavailable\n */\nfunction getScanstatusLoops(stmt: Statement): ScanstatusLoop[] {\n  const loops: ScanstatusLoop[] = [];\n\n  // Iterate through query elements by incrementing idx until we get undefined\n  // which indicates we've reached the end\n  for (let idx = 0; ; idx++) {\n    const selectId = stmt.scanStatus(\n      idx,\n      SQLite3Database.SQLITE_SCANSTAT_SELECTID,\n      1,\n    );\n\n    if (selectId === undefined) {\n      break;\n    }\n\n    loops.push({\n      selectId: must(selectId),\n      parentId: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_PARENTID, 1),\n      ),\n      explain: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EXPLAIN, 1),\n      ),\n      est: must(stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EST, 1)),\n    });\n  }\n\n  return loops.sort((a, b) => a.selectId - b.selectId);\n}\n\n/**\n * Estimates the cost of a query based on scanstats from sqlite3_stmt_scanstatus_v2\n */\nfunction estimateCost(\n  scanstats: ScanstatusLoop[],\n  fanout: CostModelCost['fanout'],\n): CostModelCost {\n  // Sort by selectId to process in execution order\n  const sorted = scanstats.toSorted((a, b) => a.selectId - b.selectId);\n\n  let totalRows = 0;\n  let totalCost = 0;\n\n  // Identify if there are multiple top-level (parentId=0) operations\n  // If so, the first is typically the scan, and subsequent ones are sorts\n  const topLevelOps = sorted.filter(s => s.parentId === 0);\n\n  // We only consider top level ops since ZQL queries are single-table when hitting SQLite.\n  // We do have a nested op in the case of `WHERE x IN (:arg)` but it is negligible\n  // assuming :arg is small.\n  let firstLoop = true;\n  for (const op of topLevelOps) {\n    if (firstLoop) {\n      // First top-level op is the main scan\n      // and determines the total number of rows output.\n      totalRows = op.est;\n      firstLoop = false;\n    } else {\n      if (op.explain.includes('ORDER BY')) {\n        totalCost += btreeCost(totalRows);\n      }\n    }\n  }\n\n  return {\n    rows: totalRows,\n    startupCost: totalCost,\n    fanout,\n  };\n}\n\nexport function btreeCost(rows: number): number {\n  // B-Tree construction is ~O(n log n) so we estimate the cost as such.\n  // We divide the cost by 10 because sorting in SQLite is ~10x faster\n  // than bringing the data into JS and sorting there.\n  return (rows * Math.log2(rows)) / 10;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAuCA,SAAgB,sBACd,IACA,YACqB;CACrB,MAAM,kBAAkB,IAAI,iBAAiB,EAAE;CAC/C,QACE,WACA,MACA,SACA,eACkB;EAgBlB,MAAM,oBAAoB,iBAAiB,OAAO,EAAE;EAGpD,MAAM,EAAC,YAAW,KAAK,WAAW,IAAI,SAAS,CAAC;EAiBhD,MAAM,MAAM,cAfE,iBACZ,WACA,SACA,YACA,mBACA,MACA,KAAA,GACA,KAAA,CAQwB,CAAK;EAM/B,MAAM,QAAQ,mBAHD,GAAG,QAAQ,GAGS,CAAI;EAGrC,OACE,MAAM,SAAS,GACf,8DAA8D,KAChE;EAMA,OAJY,aAAa,QAAQ,YAC/B,gBAAgB,UAAU,WAAW,OAAO,CAGvC;CACT;AACF;;;;;;;;;;AAWA,SAAS,mBAAmB,MAAmC;CAC7D,MAAM,QAA0B,CAAC;CAIjC,KAAK,IAAI,MAAM,IAAK,OAAO;EACzB,MAAM,WAAW,KAAK,WACpB,KACA,gBAAgB,0BAChB,CACF;EAEA,IAAI,aAAa,KAAA,GACf;EAGF,MAAM,KAAK;GACT,UAAU,KAAK,QAAQ;GACvB,UAAU,KACR,KAAK,WAAW,KAAK,gBAAgB,0BAA0B,CAAC,CAClE;GACA,SAAS,KACP,KAAK,WAAW,KAAK,gBAAgB,yBAAyB,CAAC,CACjE;GACA,KAAK,KAAK,KAAK,WAAW,KAAK,gBAAgB,qBAAqB,CAAC,CAAC;EACxE,CAAC;CACH;CAEA,OAAO,MAAM,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACrD;;;;AAKA,SAAS,aACP,WACA,QACe;CAEf,MAAM,SAAS,UAAU,UAAU,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;CAEnE,IAAI,YAAY;CAChB,IAAI,YAAY;CAIhB,MAAM,cAAc,OAAO,QAAO,MAAK,EAAE,aAAa,CAAC;CAKvD,IAAI,YAAY;CAChB,KAAK,MAAM,MAAM,aACf,IAAI,WAAW;EAGb,YAAY,GAAG;EACf,YAAY;CACd,OACE,IAAI,GAAG,QAAQ,SAAS,UAAU,GAChC,aAAa,UAAU,SAAS;CAKtC,OAAO;EACL,MAAM;EACN,aAAa;EACb;CACF;AACF;AAEA,SAAgB,UAAU,MAAsB;CAI9C,OAAQ,OAAO,KAAK,KAAK,IAAI,IAAK;AACpC"}
+{"version":3,"file":"sqlite-cost-model.js","names":[],"sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"sourcesContent":["import SQLite3Database from '@rocicorp/zero-sqlite3';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {SchemaValue} from '../../zero-types/src/schema-value.ts';\nimport {transformFilters} from '../../zql/src/builder/filter.ts';\nimport type {\n  AccessPlan,\n  ConnectionCostModel,\n  CostModelCost,\n} from '../../zql/src/planner/planner-connection.ts';\nimport type {PlannerConstraint} from '../../zql/src/planner/planner-constraint.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compileInline} from './internal/sql-inline.ts';\nimport {buildSelectQuery} from './query-builder.ts';\nimport {SQLiteStatFanout} from './sqlite-stat-fanout.ts';\n\n/**\n * Loop information returned by SQLite's scanstatus API.\n */\ninterface ScanstatusLoop {\n  /** Unique identifier for this loop */\n  selectId: number;\n  /** Parent loop ID, or 0 for root loops */\n  parentId: number;\n  /** Estimated rows emitted per turn of parent loop */\n  est: number;\n  /** EXPLAIN text for this loop to determine: b-tree vs list subquery */\n  explain: string;\n}\n\n/**\n * Creates a SQLite-based cost model for query planning.\n * Uses SQLite's scanstatus API to estimate query costs based on the actual\n * SQLite query planner's analysis.\n *\n * @param db Database instance for preparing statements\n * @param tableSpecs Map of table names to their table specs with ZQL schemas\n * @returns ConnectionCostModel function for use with the planner\n */\nexport function createSQLiteCostModel(\n  db: Database,\n  tableSpecs: Map<string, {zqlSpec: Record<string, SchemaValue>}>,\n): ConnectionCostModel {\n  const fanoutEstimator = new SQLiteStatFanout(db);\n  const tableRows = tableRowsReader(db);\n  return (\n    tableName: string,\n    sort: Ordering,\n    filters: Condition | undefined,\n    constraint: PlannerConstraint | undefined,\n  ): CostModelCost => {\n    // Transform filters to remove correlated subqueries.\n    //\n    // We use `transformFilters` (the same function the runtime uses to\n    // decide what to push to the source at connection time). It returns:\n    // - For AND: the non-CSQ conjuncts (a *superset* of the original).\n    // - For OR with any CSQ branch: `undefined` (the OR-with-CSQ is not\n    //   pushable, and matches a strict superset of any single branch).\n    //\n    // This matches what the runtime actually applies at the source. A\n    // previous implementation here had wrong OR semantics — it dropped the\n    // CSQ branch and returned the simple branch alone, which is a strict\n    // *subset* of the original OR's match set, causing the cost model to\n    // under-estimate scan rows for OR-with-CSQ shapes and biasing the\n    // planner toward semi-join plans. See the comment in\n    // `packages/zql/src/builder/filter.ts:transformFilters`.\n    const noSubqueryFilters = transformFilters(filters).filters;\n\n    // Build the SQL query using the same logic as actual queries\n    const {zqlSpec} = must(tableSpecs.get(tableName));\n\n    const query = buildSelectQuery(\n      tableName,\n      zqlSpec,\n      constraint,\n      noSubqueryFilters,\n      sort,\n      undefined, // reverse is undefined here\n      undefined, // start is undefined here\n    );\n\n    // Use compileInline to inline actual values into the SQL for cost estimation.\n    // This allows SQLite's query planner to see real values and make better decisions\n    // about index usage and query plans. This is safe here because it's only used for\n    // cost estimation, not for executing user-facing queries (which use parameterized\n    // queries via the standard compile() function).\n    const sql = compileInline(query);\n\n    // Prepare statement to get scanstatus information\n    const stmt = db.prepare(sql);\n\n    // Get scanstatus loops from the prepared statement\n    const loops = getScanstatusLoops(stmt);\n\n    // Scanstatus should always be available - if we get no loops, something is wrong\n    assert(\n      loops.length > 0,\n      `Expected scanstatus to return at least one loop for query: ${sql}`,\n    );\n\n    const ret = estimateCost(loops, (columns: string[]) =>\n      fanoutEstimator.getFanout(tableName, columns),\n    );\n\n    return {...ret, plan: accessPlan(loops, tableRows(tableName))};\n  };\n}\n\n/**\n * Returns a function that reads the number of rows in a table from\n * `sqlite_stat1`, or `undefined` if the table has not been analyzed.\n *\n * The counts are cached: they only feed plan warnings, for which the count\n * as of the first plan is close enough.\n */\nfunction tableRowsReader(db: Database): (table: string) => number | undefined {\n  let stmt: Statement | undefined;\n  const read = (table: string): number | undefined => {\n    try {\n      stmt ??= db.prepare(\n        'SELECT stat FROM sqlite_stat1 WHERE tbl = ? LIMIT 1',\n      );\n      // Every row for a table starts with the number of rows in the table.\n      const row = stmt.get<{stat: string} | undefined>(table);\n      const rows = row ? parseInt(row.stat, 10) : NaN;\n      return Number.isNaN(rows) ? undefined : rows;\n    } catch {\n      // sqlite_stat1 does not exist until the database is analyzed.\n      return undefined;\n    }\n  };\n  // Tables without statistics are cached too, as `undefined`.\n  const cache = new Map<string, number | undefined>();\n  return table => {\n    if (!cache.has(table)) {\n      cache.set(table, read(table));\n    }\n    return cache.get(table);\n  };\n}\n\n/**\n * Describes how SQLite reads the rows, from the EXPLAIN text of the\n * statement's top-level loops, e.g.:\n *\n * - `SEARCH issue USING INDEX issue_project (projectID=?)`\n * - `SCAN comment USING INDEX sqlite_autoindex_comment_1` (every row, in the\n *   order of the index)\n * - `SCAN issue` (every row, in table order)\n * - `USE TEMP B-TREE FOR ORDER BY` (a full sort)\n * - `USE TEMP B-TREE FOR LAST TERM OF ORDER BY` or `... RIGHT PART OF ORDER\n *   BY` (sorting runs of rows that tie on the index)\n */\nfunction accessPlan(\n  loops: ScanstatusLoop[],\n  tableRows: number | undefined,\n): AccessPlan {\n  const [first, ...rest] = loops.filter(loop => loop.parentId === 0);\n  let sort: AccessPlan['sort'] = 'none';\n  for (const {explain} of rest) {\n    if (\n      explain.startsWith('USE TEMP B-TREE FOR') &&\n      explain.includes('ORDER BY')\n    ) {\n      sort = explain === 'USE TEMP B-TREE FOR ORDER BY' ? 'full' : 'partial';\n    }\n  }\n  return {\n    access: first?.explain.startsWith('SCAN ') ? 'scan' : 'search',\n    sort,\n    tableRows,\n  };\n}\n\n/**\n * Gets scanstatus loop information from a prepared statement.\n * Iterates through all query elements and extracts loop statistics.\n *\n * Uses SQLITE_SCANSTAT_COMPLEX flag (1) to get all loops including sorting operations.\n *\n * @param stmt Prepared statement to get scanstatus from\n * @returns Array of loop information, or empty array if scanstatus unavailable\n */\nfunction getScanstatusLoops(stmt: Statement): ScanstatusLoop[] {\n  const loops: ScanstatusLoop[] = [];\n\n  // Iterate through query elements by incrementing idx until we get undefined\n  // which indicates we've reached the end\n  for (let idx = 0; ; idx++) {\n    const selectId = stmt.scanStatus(\n      idx,\n      SQLite3Database.SQLITE_SCANSTAT_SELECTID,\n      1,\n    );\n\n    if (selectId === undefined) {\n      break;\n    }\n\n    // A MULTI-INDEX OR nested in a branch of another one gets a scanstatus\n    // entry without an OP_Explain: SQLite reports its SELECTID and PARENTID\n    // as -1 and its EXPLAIN as NULL. The nested OR's own `MULTI-INDEX OR` and\n    // `INDEX n` loops are reported separately, and the entry is never a\n    // top-level loop, so nothing the estimate reads is lost by skipping it.\n    if (selectId === -1) {\n      continue;\n    }\n\n    loops.push({\n      selectId: must(selectId),\n      parentId: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_PARENTID, 1),\n      ),\n      explain: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EXPLAIN, 1),\n      ),\n      est: must(stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EST, 1)),\n    });\n  }\n\n  return loops.sort((a, b) => a.selectId - b.selectId);\n}\n\n/**\n * Estimates the cost of a query based on scanstats from sqlite3_stmt_scanstatus_v2\n */\nfunction estimateCost(\n  scanstats: ScanstatusLoop[],\n  fanout: CostModelCost['fanout'],\n): CostModelCost {\n  // Sort by selectId to process in execution order\n  const sorted = scanstats.toSorted((a, b) => a.selectId - b.selectId);\n\n  let totalRows = 0;\n  let totalCost = 0;\n\n  // Identify if there are multiple top-level (parentId=0) operations\n  // If so, the first is typically the scan, and subsequent ones are sorts\n  const topLevelOps = sorted.filter(s => s.parentId === 0);\n\n  // We only consider top level ops since ZQL queries are single-table when hitting SQLite.\n  // We do have a nested op in the case of `WHERE x IN (:arg)` but it is negligible\n  // assuming :arg is small.\n  let firstLoop = true;\n  for (const op of topLevelOps) {\n    if (firstLoop) {\n      // First top-level op is the main scan\n      // and determines the total number of rows output.\n      totalRows = op.est;\n      firstLoop = false;\n    } else {\n      if (op.explain.includes('ORDER BY')) {\n        totalCost += btreeCost(totalRows);\n      }\n    }\n  }\n\n  return {\n    rows: totalRows,\n    startupCost: totalCost,\n    fanout,\n  };\n}\n\nexport function btreeCost(rows: number): number {\n  // B-Tree construction is ~O(n log n) so we estimate the cost as such.\n  // We divide the cost by 10 because sorting in SQLite is ~10x faster\n  // than bringing the data into JS and sorting there.\n  return (rows * Math.log2(rows)) / 10;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAwCA,SAAgB,sBACd,IACA,YACqB;CACrB,MAAM,kBAAkB,IAAI,iBAAiB,EAAE;CAC/C,MAAM,YAAY,gBAAgB,EAAE;CACpC,QACE,WACA,MACA,SACA,eACkB;EAgBlB,MAAM,oBAAoB,iBAAiB,OAAO,EAAE;EAGpD,MAAM,EAAC,YAAW,KAAK,WAAW,IAAI,SAAS,CAAC;EAiBhD,MAAM,MAAM,cAfE,iBACZ,WACA,SACA,YACA,mBACA,MACA,KAAA,GACA,KAAA,CAQwB,CAAK;EAM/B,MAAM,QAAQ,mBAHD,GAAG,QAAQ,GAGS,CAAI;EAGrC,OACE,MAAM,SAAS,GACf,8DAA8D,KAChE;EAMA,OAAO;GAAC,GAJI,aAAa,QAAQ,YAC/B,gBAAgB,UAAU,WAAW,OAAO,CAGnC;GAAK,MAAM,WAAW,OAAO,UAAU,SAAS,CAAC;EAAC;CAC/D;AACF;;;;;;;;AASA,SAAS,gBAAgB,IAAqD;CAC5E,IAAI;CACJ,MAAM,QAAQ,UAAsC;EAClD,IAAI;GACF,SAAS,GAAG,QACV,qDACF;GAEA,MAAM,MAAM,KAAK,IAAgC,KAAK;GACtD,MAAM,OAAO,MAAM,SAAS,IAAI,MAAM,EAAE,IAAI;GAC5C,OAAO,OAAO,MAAM,IAAI,IAAI,KAAA,IAAY;EAC1C,QAAQ;GAEN;EACF;CACF;CAEA,MAAM,wBAAQ,IAAI,IAAgC;CAClD,QAAO,UAAS;EACd,IAAI,CAAC,MAAM,IAAI,KAAK,GAClB,MAAM,IAAI,OAAO,KAAK,KAAK,CAAC;EAE9B,OAAO,MAAM,IAAI,KAAK;CACxB;AACF;;;;;;;;;;;;;AAcA,SAAS,WACP,OACA,WACY;CACZ,MAAM,CAAC,OAAO,GAAG,QAAQ,MAAM,QAAO,SAAQ,KAAK,aAAa,CAAC;CACjE,IAAI,OAA2B;CAC/B,KAAK,MAAM,EAAC,aAAY,MACtB,IACE,QAAQ,WAAW,qBAAqB,KACxC,QAAQ,SAAS,UAAU,GAE3B,OAAO,YAAY,iCAAiC,SAAS;CAGjE,OAAO;EACL,QAAQ,OAAO,QAAQ,WAAW,OAAO,IAAI,SAAS;EACtD;EACA;CACF;AACF;;;;;;;;;;AAWA,SAAS,mBAAmB,MAAmC;CAC7D,MAAM,QAA0B,CAAC;CAIjC,KAAK,IAAI,MAAM,IAAK,OAAO;EACzB,MAAM,WAAW,KAAK,WACpB,KACA,gBAAgB,0BAChB,CACF;EAEA,IAAI,aAAa,KAAA,GACf;EAQF,IAAI,aAAa,IACf;EAGF,MAAM,KAAK;GACT,UAAU,KAAK,QAAQ;GACvB,UAAU,KACR,KAAK,WAAW,KAAK,gBAAgB,0BAA0B,CAAC,CAClE;GACA,SAAS,KACP,KAAK,WAAW,KAAK,gBAAgB,yBAAyB,CAAC,CACjE;GACA,KAAK,KAAK,KAAK,WAAW,KAAK,gBAAgB,qBAAqB,CAAC,CAAC;EACxE,CAAC;CACH;CAEA,OAAO,MAAM,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACrD;;;;AAKA,SAAS,aACP,WACA,QACe;CAEf,MAAM,SAAS,UAAU,UAAU,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;CAEnE,IAAI,YAAY;CAChB,IAAI,YAAY;CAIhB,MAAM,cAAc,OAAO,QAAO,MAAK,EAAE,aAAa,CAAC;CAKvD,IAAI,YAAY;CAChB,KAAK,MAAM,MAAM,aACf,IAAI,WAAW;EAGb,YAAY,GAAG;EACf,YAAY;CACd,OACE,IAAI,GAAG,QAAQ,SAAS,UAAU,GAChC,aAAa,UAAU,SAAS;CAKtC,OAAO;EACL,MAAM;EACN,aAAa;EACb;CACF;AACF;AAEA,SAAgB,UAAU,MAAsB;CAI9C,OAAQ,OAAO,KAAK,KAAK,IAAI,IAAK;AACpC"}

package/out/zqlite/src/sqlite-stat-fanout.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-stat-fanout.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/sqlite-stat-fanout.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,SAAS,CAAC;AAEtC;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAEpC;;;;;OAKG;IACH,MAAM,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC;CACvC;AAgBD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AACH,qBAAa,gBAAgB;;IAkB3B;;;;;;;;OAQG;IACH,YAAY,EAAE,EAAE,QAAQ,EAAE,aAAa,SAAI,EAyB1C;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACH,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,YAAY,CAgC5D;IAED;;;OAGG;IACH,UAAU,IAAI,IAAI,CAEjB;CAgQF"}
+{"version":3,"file":"sqlite-stat-fanout.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/sqlite-stat-fanout.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,SAAS,CAAC;AAGtC;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAEpC;;;;;OAKG;IACH,MAAM,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC;CACvC;AAgBD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AACH,qBAAa,gBAAgB;;IAkB3B;;;;;;;;OAQG;IACH,YAAY,EAAE,EAAE,QAAQ,EAAE,aAAa,SAAI,EAyB1C;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACH,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,YAAY,CAgC5D;IAED;;;OAGG;IACH,UAAU,IAAI,IAAI,CAEjB;CA0NF"}

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

@@ -1,3 +1,6 @@
+import { getOrInsertComputed } from "../../shared/src/map.js";
+import { newArray } from "../../shared/src/arrays.js";
+import { isSampleNull } from "./sqlite-stat4-sample.js";
 //#region ../zqlite/src/sqlite-stat-fanout.ts
 /**
 * Computes join fanout factors from SQLite statistics tables.
@@ -178,7 +181,7 @@ var SQLiteStatFanout = class {
 				const neqParts = s.neq.split(" ");
 				return {
 					fanout: parseInt(neqParts[neqIndex] ?? neqParts[0], 10),
-					isNull: this.#decodeSampleIsNull(s.sample)
+					isNull: isSampleNull(s.sample)
 				};
 			}).filter((s) => !s.isNull);
 			if (nonNullSamples.length === 0) return {
@@ -252,11 +255,7 @@ var SQLiteStatFanout = class {
 		try {
 			const rows = this.#indexStmt.all(tableName);
 			const indexMap = /* @__PURE__ */ new Map();
-			for (const row of rows) {
-				const cols = indexMap.get(row.index_name) ?? [];
-				cols.push(row.column_name);
-				indexMap.set(row.index_name, cols);
-			}
+			for (const row of rows) getOrInsertComputed(indexMap, row.index_name, newArray).push(row.column_name);
 			for (const [indexName, indexColumns] of indexMap) if (this.#isPrefixMatch(columns, indexColumns)) return {
 				indexName,
 				depth: columns.length
@@ -288,31 +287,6 @@ var SQLiteStatFanout = class {
 		const indexPrefixLower = new Set(indexPrefix.map((col) => col.toLowerCase()));
 		return queryColumns.map((col) => col.toLowerCase()).every((queryCol) => indexPrefixLower.has(queryCol));
 	}
-	/**
-	* Decodes a sqlite_stat4 sample value to check if it's NULL.
-	*
-	* SQLite record format (simplified):
-	* - Varint: header size
-	* - Serial types for each column (one byte each typically)
-	* - Actual data
-	*
-	* Serial type 0 = NULL
-	* Serial type 1 = 8-bit int
-	* Serial type 2 = 16-bit int
-	* Serial type 3 = 24-bit int
-	* etc.
-	*
-	* We only need to check the first column's serial type.
-	*
-	* @param sample Binary-encoded sample from stat4
-	* @returns true if the sample value is NULL
-	*/
-	#decodeSampleIsNull(sample) {
-		if (sample.length === 0) return true;
-		const headerSize = sample[0];
-		if (headerSize === 0 || headerSize >= sample.length) return true;
-		return sample[1] === 0;
-	}
 };
 //#endregion
 export { SQLiteStatFanout };

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

@@ -1 +1 @@
-{"version":3,"file":"sqlite-stat-fanout.js","names":["#db","#defaultFanout","#cache","#stat4Stmt","#stat1Stmt","#indexStmt","#getFanoutFromStat4","#getFanoutFromStat1","#findIndexForColumns","#decodeSampleIsNull","#isPrefixMatch"],"sources":["../../../../zqlite/src/sqlite-stat-fanout.ts"],"sourcesContent":["import type {Database} from './db.ts';\n\n/**\n * Result of fanout calculation from SQLite statistics.\n */\nexport interface FanoutResult {\n  /**\n   * The fanout value (average rows per distinct value of the join column).\n   * For non-NULL joins, this represents how many child rows exist per parent key.\n   */\n  fanout: number;\n  confidence: 'high' | 'med' | 'none';\n\n  /**\n   * Source of the fanout calculation.\n   * - 'stat4': From sqlite_stat4 histogram (most accurate, excludes NULLs)\n   * - 'stat1': From sqlite_stat1 average (includes NULLs, may overestimate)\n   * - 'default': Fallback constant when statistics unavailable\n   */\n  source: 'stat4' | 'stat1' | 'default';\n}\n\n/**\n * Sample from sqlite_stat4 histogram.\n */\ninterface Stat4Sample {\n  /** \"N1 N2\" = rows equal to sample (N1=first col, N2=if composite) */\n  neq: string;\n  /** \"N1 N2\" = rows less than sample */\n  nlt: string;\n  /** \"N1 N2\" = distinct values less than sample */\n  ndlt: string;\n  /** The actual sample value (binary encoded) */\n  sample: Buffer;\n}\n\n/**\n * Computes join fanout factors from SQLite statistics tables.\n *\n * Fanout is the average number of child rows per distinct parent key value,\n * used to estimate join cardinality in query planning.\n *\n * ## Problem\n *\n * sqlite_stat1 includes NULL rows in its calculation, which can significantly\n * overestimate fanout for sparse foreign keys:\n *\n * ```\n * Example: 100 tasks, 20 with project_id, 80 with NULL\n * - stat1 reports: \"100 17\" → fanout = 17 (WRONG - includes NULLs)\n * - stat4 shows: NULL samples with fanout=80, non-NULL samples with fanout=4\n * - True fanout: 4 (CORRECT)\n * ```\n *\n * ## Solution\n *\n * This class uses sqlite_stat4 histogram to separate NULL and non-NULL samples,\n * providing accurate fanout for non-NULL joins.\n *\n * ## Usage\n *\n * ```typescript\n * const calculator = new SQLiteStatFanout(db);\n *\n * // Get fanout for posts.userId → users.id join\n * const result = calculator.getFanout('posts', 'userId');\n *\n * if (result.source === 'stat4') {\n *   // Accurate: excludes NULLs, samples actual distribution\n *   console.log(`Fanout: ${result.fanout} (from stat4)`);\n * } else if (result.source === 'stat1') {\n *   // Conservative: includes NULLs, may overestimate\n *   console.log(`Fanout: ${result.fanout} (from stat1, includes NULLs)`);\n * } else {\n *   // Fallback: no statistics available\n *   console.log(`Fanout: ${result.fanout} (default estimate)`);\n * }\n * ```\n *\n * ## Requirements\n *\n * - SQLite compiled with ENABLE_STAT4 (most builds include this)\n * - `ANALYZE` command run on the database\n * - Index exists on the join column\n *\n * @see https://sqlite.org/fileformat2.html#stat4tab\n * @see packages/zql/src/planner/SELECTIVITY_PLAN.md\n */\nexport class SQLiteStatFanout {\n  readonly #db: Database;\n  readonly #defaultFanout: number;\n\n  /**\n   * Cache of fanout results by table and columns.\n   * Key format: \"tableName:col1,col2,col3\" (sorted alphabetically)\n   */\n  readonly #cache = new Map<string, FanoutResult>();\n\n  /**\n   * Prepared statements for querying SQLite statistics tables.\n   * Prepared once in constructor for performance.\n   */\n  readonly #stat4Stmt: ReturnType<Database['prepare']>;\n  readonly #stat1Stmt: ReturnType<Database['prepare']>;\n  readonly #indexStmt: ReturnType<Database['prepare']>;\n\n  /**\n   * Creates a new fanout calculator.\n   *\n   * @param db Database instance\n   * @param defaultFanout Default fanout when statistics unavailable (default: 3)\n   *                      - 1: Conservative (assumes FK relationships)\n   *                      - 3: Moderate (recommended, safe middle ground)\n   *                      - 10: SQLite's default (optimistic)\n   */\n  constructor(db: Database, defaultFanout = 3) {\n    this.#db = db;\n    this.#defaultFanout = defaultFanout;\n\n    // Prepare SQL statements once for reuse across multiple getFanout() calls\n    this.#stat4Stmt = this.#db.prepare(`\n      SELECT neq, nlt, ndlt, sample\n      FROM sqlite_stat4\n      WHERE tbl = ? AND idx = ?\n      ORDER BY nlt\n    `);\n\n    this.#stat1Stmt = this.#db.prepare(`\n      SELECT stat\n      FROM sqlite_stat1\n      WHERE tbl = ? AND idx = ?\n    `);\n\n    this.#indexStmt = this.#db.prepare(`\n      SELECT il.name as index_name, ii.seqno, ii.name as column_name\n      FROM pragma_index_list(?) il\n      JOIN pragma_index_info(il.name) ii\n      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: this.#decodeSampleIsNull(s.sample),\n        };\n      });\n\n      const nonNullSamples = decodedSamples.filter(s => !s.isNull);\n\n      if (nonNullSamples.length === 0) {\n        // All samples are NULL - return fanout of 0 since NULLs don't match in joins\n        return {\n          fanout: 0,\n          source: 'stat4',\n          confidence: 'high',\n        };\n      }\n\n      // Use median of non-NULL fanouts (more robust than average)\n      const fanouts = nonNullSamples.map(s => s.fanout).sort((a, b) => a - b);\n      const medianFanout =\n        fanouts.length % 2 === 0\n          ? Math.floor(\n              (fanouts[fanouts.length / 2 - 1] + fanouts[fanouts.length / 2]) /\n                2,\n            )\n          : fanouts[Math.floor(fanouts.length / 2)];\n\n      return {\n        fanout: medianFanout,\n        source: 'stat4',\n        confidence: 'high',\n      };\n    } catch {\n      // stat4 table may not exist or query may fail\n      return undefined;\n    }\n  }\n\n  /**\n   * Gets fanout from sqlite_stat1 average.\n   *\n   * Note: This includes NULL rows in the calculation and may overestimate\n   * fanout for sparse foreign keys.\n   *\n   * For compound indexes, uses the stat value at the appropriate depth.\n   *\n   * @param columns Array of column names to get fanout for\n   * @returns Fanout result or undefined if stat1 unavailable\n   */\n  #getFanoutFromStat1(\n    tableName: string,\n    columns: string[],\n  ): FanoutResult | undefined {\n    try {\n      // Find index containing the columns as a prefix\n      const indexInfo = this.#findIndexForColumns(tableName, columns);\n      if (!indexInfo) {\n        return undefined;\n      }\n\n      // Query stat1 for this index (using prepared statement)\n      const result = this.#stat1Stmt.get(tableName, indexInfo.indexName) as\n        | {stat: string}\n        | undefined;\n\n      if (!result) {\n        return undefined;\n      }\n\n      const parts = result.stat.split(' ');\n      // Check if we have enough parts for the requested depth\n      if (parts.length < indexInfo.depth + 1) {\n        return undefined;\n      }\n\n      const fanout = parseInt(parts[indexInfo.depth], 10);\n      if (isNaN(fanout)) {\n        return undefined;\n      }\n\n      return {\n        fanout,\n        source: 'stat1',\n        confidence: 'med',\n      };\n    } catch {\n      return undefined;\n    }\n  }\n\n  /**\n   * Finds an index that can be used to get statistics for column(s).\n   *\n   * Uses pragma_index_list and pragma_index_info to reliably get index\n   * column names, avoiding brittle SQL parsing. Includes all indices:\n   * user-created (CREATE INDEX), PRIMARY KEY, and UNIQUE constraints.\n   *\n   * Uses flexible matching: Finds indexes where ALL columns appear in the\n   * first N positions, regardless of order. This works because SQLite statistics\n   * at depth N represent the fanout for the combination of the first N columns,\n   * and combinations are order-independent.\n   *\n   * Example:\n   * - columns: ['customerId', 'storeId']\n   * - Matches: (customerId, storeId, date) at depth 2 ✅\n   * - Matches: (storeId, customerId, date) at depth 2 ✅ (flexible order)\n   * - Does NOT match: (date, customerId, storeId) ❌ (columns not in first 2 positions)\n   * - Does NOT match: (customerId, date, storeId) ❌ (storeId not in first 2 positions)\n   *\n   * @param columns Array of column names (order-independent for matching)\n   * @returns Index info with name and depth, or undefined if no match\n   */\n  #findIndexForColumns(\n    tableName: string,\n    columns: string[],\n  ): {indexName: string; depth: number} | undefined {\n    try {\n      // Query returns all columns for all indexes (including PK/UNIQUE) in order\n      const rows = this.#indexStmt.all(tableName) as {\n        index_name: string;\n        seqno: number;\n        column_name: string;\n      }[];\n\n      // Group by index name\n      const indexMap = new Map<string, string[]>();\n      for (const row of rows) {\n        const cols = indexMap.get(row.index_name) ?? [];\n        cols.push(row.column_name);\n        indexMap.set(row.index_name, cols);\n      }\n\n      // Check each index for prefix match\n      for (const [indexName, indexColumns] of indexMap) {\n        if (this.#isPrefixMatch(columns, indexColumns)) {\n          return {\n            indexName,\n            depth: columns.length,\n          };\n        }\n      }\n\n      return undefined;\n    } catch {\n      return undefined;\n    }\n  }\n\n  /**\n   * Checks if all queryColumns exist in the first N positions of indexColumns,\n   * regardless of order.\n   *\n   * This allows flexible matching: constraint {a, b} matches both index (a, b, c)\n   * and index (b, a, c) at depth 2, since both represent the fanout for the\n   * combination of columns a and b.\n   *\n   * Gaps are NOT allowed: constraint {a, c} does NOT match index (a, b, c)\n   * because no depth represents just (a, c) without b. Statistics are cumulative\n   * from position 0.\n   *\n   * @param queryColumns Columns we're looking for (from constraint)\n   * @param indexColumns Columns in the index (in order)\n   * @returns true if all queryColumns exist in indexColumns[0...queryColumns.length-1]\n   */\n  #isPrefixMatch(queryColumns: string[], indexColumns: string[]): boolean {\n    if (queryColumns.length > indexColumns.length) {\n      return false;\n    }\n\n    // Get the prefix of the index that we're checking against\n    const indexPrefix = indexColumns.slice(0, queryColumns.length);\n\n    // Normalize to lowercase for case-insensitive comparison\n    const indexPrefixLower = new Set(indexPrefix.map(col => col.toLowerCase()));\n    const queryColumnsLower = queryColumns.map(col => col.toLowerCase());\n\n    // Check if ALL query columns exist in the index prefix\n    return queryColumnsLower.every(queryCol => indexPrefixLower.has(queryCol));\n  }\n\n  /**\n   * Decodes a sqlite_stat4 sample value to check if it's NULL.\n   *\n   * SQLite record format (simplified):\n   * - Varint: header size\n   * - Serial types for each column (one byte each typically)\n   * - Actual data\n   *\n   * Serial type 0 = NULL\n   * Serial type 1 = 8-bit int\n   * Serial type 2 = 16-bit int\n   * Serial type 3 = 24-bit int\n   * etc.\n   *\n   * We only need to check the first column's serial type.\n   *\n   * @param sample Binary-encoded sample from stat4\n   * @returns true if the sample value is NULL\n   */\n  #decodeSampleIsNull(sample: Buffer): boolean {\n    if (sample.length === 0) {\n      return true;\n    }\n\n    // Read header size (varint - simplified: assume single byte)\n    const headerSize = sample[0];\n\n    if (headerSize === 0 || headerSize >= sample.length) {\n      return true;\n    }\n\n    // Read first serial type (at position 1)\n    const serialType = sample[1];\n\n    // Serial type 0 = NULL\n    return serialType === 0;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwFA,IAAa,mBAAb,MAA8B;CAC5B;CACA;;;;;CAMA,yBAAkB,IAAI,IAA0B;;;;;CAMhD;CACA;CACA;;;;;;;;;;CAWA,YAAY,IAAc,gBAAgB,GAAG;EAC3C,KAAKA,MAAM;EACX,KAAKC,iBAAiB;EAGtB,KAAKE,aAAa,KAAKH,IAAI,QAAQ;;;;;KAKlC;EAED,KAAKI,aAAa,KAAKJ,IAAI,QAAQ;;;;KAIlC;EAED,KAAKK,aAAa,KAAKL,IAAI,QAAQ;;;;;;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,KAAKM,oBAAoB,EAAE,MAAM;IAC3C;GACF,CAEuB,EAAe,QAAO,MAAK,CAAC,EAAE,MAAM;GAE3D,IAAI,eAAe,WAAW,GAE5B,OAAO;IACL,QAAQ;IACR,QAAQ;IACR,YAAY;GACd;GAIF,MAAM,UAAU,eAAe,KAAI,MAAK,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;GAStE,OAAO;IACL,QARA,QAAQ,SAAS,MAAM,IACnB,KAAK,OACF,QAAQ,QAAQ,SAAS,IAAI,KAAK,QAAQ,QAAQ,SAAS,MAC1D,CACJ,IACA,QAAQ,KAAK,MAAM,QAAQ,SAAS,CAAC;IAIzC,QAAQ;IACR,YAAY;GACd;EACF,QAAQ;GAEN;EACF;CACF;;;;;;;;;;;;CAaA,oBACE,WACA,SAC0B;EAC1B,IAAI;GAEF,MAAM,YAAY,KAAKD,qBAAqB,WAAW,OAAO;GAC9D,IAAI,CAAC,WACH;GAIF,MAAM,SAAS,KAAKJ,WAAW,IAAI,WAAW,UAAU,SAAS;GAIjE,IAAI,CAAC,QACH;GAGF,MAAM,QAAQ,OAAO,KAAK,MAAM,GAAG;GAEnC,IAAI,MAAM,SAAS,UAAU,QAAQ,GACnC;GAGF,MAAM,SAAS,SAAS,MAAM,UAAU,QAAQ,EAAE;GAClD,IAAI,MAAM,MAAM,GACd;GAGF,OAAO;IACL;IACA,QAAQ;IACR,YAAY;GACd;EACF,QAAQ;GACN;EACF;CACF;;;;;;;;;;;;;;;;;;;;;;;CAwBA,qBACE,WACA,SACgD;EAChD,IAAI;GAEF,MAAM,OAAO,KAAKC,WAAW,IAAI,SAAS;GAO1C,MAAM,2BAAW,IAAI,IAAsB;GAC3C,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,OAAO,SAAS,IAAI,IAAI,UAAU,KAAK,CAAC;IAC9C,KAAK,KAAK,IAAI,WAAW;IACzB,SAAS,IAAI,IAAI,YAAY,IAAI;GACnC;GAGA,KAAK,MAAM,CAAC,WAAW,iBAAiB,UACtC,IAAI,KAAKK,eAAe,SAAS,YAAY,GAC3C,OAAO;IACL;IACA,OAAO,QAAQ;GACjB;GAIJ;EACF,QAAQ;GACN;EACF;CACF;;;;;;;;;;;;;;;;;CAkBA,eAAe,cAAwB,cAAiC;EACtE,IAAI,aAAa,SAAS,aAAa,QACrC,OAAO;EAIT,MAAM,cAAc,aAAa,MAAM,GAAG,aAAa,MAAM;EAG7D,MAAM,mBAAmB,IAAI,IAAI,YAAY,KAAI,QAAO,IAAI,YAAY,CAAC,CAAC;EAI1E,OAH0B,aAAa,KAAI,QAAO,IAAI,YAAY,CAG3D,EAAkB,OAAM,aAAY,iBAAiB,IAAI,QAAQ,CAAC;CAC3E;;;;;;;;;;;;;;;;;;;;CAqBA,oBAAoB,QAAyB;EAC3C,IAAI,OAAO,WAAW,GACpB,OAAO;EAIT,MAAM,aAAa,OAAO;EAE1B,IAAI,eAAe,KAAK,cAAc,OAAO,QAC3C,OAAO;EAOT,OAHmB,OAAO,OAGJ;CACxB;AACF"}
+{"version":3,"file":"sqlite-stat-fanout.js","names":["#db","#defaultFanout","#cache","#stat4Stmt","#stat1Stmt","#indexStmt","#getFanoutFromStat4","#getFanoutFromStat1","#findIndexForColumns","#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"}

package/out/zqlite/src/sqlite-stat4-sample.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Decoding of `sqlite_stat4.sample` values.
+ *
+ * A sample is a SQLite record: a header holding one serial type per column,
+ * followed by the column data. We only ever look at the serial types, which
+ * say what *kind* of value each column holds without revealing the value
+ * itself. Two callers need this:
+ *
+ * - `SQLiteStatFanout`, which separates NULL from non-NULL samples so that
+ *   join fanout is not skewed by a sparse foreign key.
+ * - the `/plannerz` admin endpoint, which reports the shape of the histogram
+ *   without returning row data.
+ *
+ * @see https://sqlite.org/fileformat2.html#record_format
+ * @see https://sqlite.org/fileformat2.html#stat4tab
+ */
+/**
+ * The kind of value a stat4 sample column holds, derived from its serial type.
+ * `unknown` covers the internal serial types 10 and 11, which do not appear in
+ * a well-formed record.
+ */
+export type SampleValueKind = 'null' | 'integer' | 'real' | 'text' | 'blob' | 'unknown';
+/**
+ * Decodes the serial types in a stat4 sample's header.
+ *
+ * The sample's trailing rowid is included as a final column, matching the
+ * record SQLite stores.
+ *
+ * @returns one kind per column, or an empty array if `sample` is empty or its
+ *          header is malformed.
+ */
+export declare function decodeSampleKinds(sample: Buffer): SampleValueKind[];
+/**
+ * Whether the first column of a sample is NULL.
+ */
+export declare function isSampleNull(sample: Buffer): boolean;
+//# sourceMappingURL=sqlite-stat4-sample.d.ts.map

package/out/zqlite/src/sqlite-stat4-sample.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-stat4-sample.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/sqlite-stat4-sample.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH;;;;GAIG;AACH,MAAM,MAAM,eAAe,GACvB,MAAM,GACN,SAAS,GACT,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,CAAC;AAEd;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,eAAe,EAAE,CAuBnE;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAGpD"}