@rocicorp/zero 1.11.0-canary.2 → 1.11.0-canary.21

package/out/zqlite/src/database-storage.js.map

@@ -1 +1 @@
-{"version":3,"file":"database-storage.js","names":["#stmts","#options","#db","#checkpoint","#maybeCheckpoint","#numWrites","#scan","#get","#set","#del"],"sources":["../../../../zqlite/src/database-storage.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport type {JSONValue} from '../../shared/src/json.ts';\nimport type {Storage} from '../../zql/src/ivm/operator.ts';\nimport type {Stream} from '../../zql/src/ivm/stream.ts';\nimport type {Statement} from './db.ts';\nimport {Database} from './db.ts';\n\nexport interface ClientGroupStorage {\n  /** Creates a {@link Storage} instance for a single operator. */\n  createStorage(): Storage;\n\n  /** Deletes all storage for the client group. */\n  destroy(): void;\n}\n\ntype Statements = {\n  get: Statement;\n  set: Statement;\n  del: Statement;\n  scan: Statement;\n  clear: Statement;\n  commit: Statement;\n  begin: Statement;\n};\n\n// Exported for testing.\nexport const CREATE_STORAGE_TABLE = `\n  CREATE TABLE storage (\n    clientGroupID TEXT,\n    op NUMBER,\n    key TEXT,\n    val TEXT,\n    PRIMARY KEY(clientGroupID, op, key)\n  )\n  `;\n\nconst defaultOptions = {\n  commitInterval: 5_000,\n  compactionThresholdBytes: 50 * 1024 * 1024,\n};\n\nexport class DatabaseStorage {\n  static create(\n    lc: LogContext,\n    path: string,\n    options = defaultOptions,\n  ): DatabaseStorage {\n    // SQLite is used for ephemeral storage (i.e. similar to RAM) that can spill to\n    // disk to avoid consuming too much memory. Each worker thread gets its own\n    // database (file) and acts as the single reader/writer of the DB, so\n    // `locking_mode` is set to `EXCLUSIVE` for performance. Similarly, since\n    // durability is not important, `synchronous` is set to `OFF` for performance.\n    const db = new Database(lc, path);\n    db.unsafeMode(true); // Allows journal_mode = OFF\n    db.pragma('locking_mode = EXCLUSIVE');\n    db.pragma('foreign_keys = OFF');\n    db.pragma('journal_mode = OFF');\n    db.pragma('synchronous = OFF');\n    db.pragma('auto_vacuum = INCREMENTAL');\n\n    db.prepare(CREATE_STORAGE_TABLE).run();\n    lc.debug?.(`Created DatabaseStorage backed by ${path}`);\n    return new DatabaseStorage(db, options);\n  }\n\n  readonly #stmts: Statements;\n  readonly #options: typeof defaultOptions;\n  readonly #db: Database;\n  #numWrites = 0;\n\n  constructor(db: Database, options = defaultOptions) {\n    this.#stmts = {\n      get: db.prepare(`\n        SELECT val FROM storage WHERE\n          clientGroupID = ? AND op = ? AND key = ?\n      `),\n      set: db.prepare(`\n        INSERT INTO storage (clientGroupID, op, key, val)\n          VALUES(?, ?, ?, ?)\n        ON CONFLICT(clientGroupID, op, key) \n        DO \n          UPDATE SET val = excluded.val\n      `),\n      del: db.prepare(`\n        DELETE FROM storage WHERE\n          clientGroupID = ? AND op = ? AND key = ?\n      `),\n      scan: db.prepare(`\n        SELECT key, val FROM storage WHERE\n          clientGroupID = ? AND op = ? AND key >= ?\n      `),\n      clear: db.prepare(`\n        DELETE FROM storage WHERE clientGroupID = ?\n      `),\n      commit: db.prepare('COMMIT'),\n      begin: db.prepare('BEGIN'),\n    };\n    this.#stmts.begin.run();\n    this.#options = options;\n    this.#db = db;\n  }\n\n  close() {\n    this.#checkpoint();\n    this.#db.close();\n  }\n\n  #get(\n    cgID: string,\n    opID: number,\n    key: string,\n    def?: JSONValue,\n  ): JSONValue | undefined {\n    this.#maybeCheckpoint();\n    const row = this.#stmts.get.get<{val: string}>(cgID, opID, key);\n    return row ? JSON.parse(row.val) : def;\n  }\n\n  #set(cgID: string, opID: number, key: string, val: JSONValue) {\n    this.#maybeCheckpoint();\n    this.#stmts.set.run(cgID, opID, key, JSON.stringify(val));\n  }\n\n  #del(cgID: string, opID: number, key: string) {\n    this.#maybeCheckpoint();\n    this.#stmts.del.run(cgID, opID, key);\n  }\n\n  /**\n   * We don't need to commit every single write to the DB\n   * since we're not concerned with durability.\n   * Waiting on commits can be expensive, so we commit\n   * every `COMMIT_INTERVAL` writes.\n   */\n  #maybeCheckpoint() {\n    if (++this.#numWrites >= this.#options.commitInterval) {\n      this.#checkpoint();\n    }\n  }\n\n  #checkpoint() {\n    this.#stmts.commit.run();\n    this.#stmts.begin.run();\n    this.#numWrites = 0;\n  }\n\n  *#scan(\n    cgID: string,\n    opID: number,\n    opts: {prefix: string} = {prefix: ''},\n  ): Stream<[string, JSONValue]> {\n    const {prefix} = opts;\n    for (const {key, val} of this.#stmts.scan.iterate<{\n      key: string;\n      val: string;\n    }>(cgID, opID, prefix)) {\n      if (!key.startsWith(prefix)) {\n        return;\n      }\n      yield [key, JSON.parse(val)];\n    }\n  }\n\n  createClientGroupStorage(cgID: string): ClientGroupStorage {\n    const destroy = () => {\n      this.#stmts.clear.run(cgID);\n      this.#checkpoint();\n      this.#db.compact(this.#options.compactionThresholdBytes);\n    };\n    this.#stmts.clear.run(cgID);\n\n    let nextOpID = 1;\n    return {\n      createStorage: () => {\n        const opID = nextOpID++;\n        return {\n          get: (key, def?) => this.#get(cgID, opID, key, def),\n          set: (key, val) => this.#set(cgID, opID, key, val),\n          del: key => this.#del(cgID, opID, key),\n          scan: opts => this.#scan(cgID, opID, opts),\n        };\n      },\n\n      destroy,\n    };\n  }\n}\n"],"mappings":";;AA0BA,IAAa,uBAAuB;;;;;;;;;AAUpC,IAAM,iBAAiB;CACrB,gBAAgB;CAChB,0BAA0B,KAAK,OAAO;AACxC;AAEA,IAAa,kBAAb,MAAa,gBAAgB;CAC3B,OAAO,OACL,IACA,MACA,UAAU,gBACO;EAMjB,MAAM,KAAK,IAAI,SAAS,IAAI,IAAI;EAChC,GAAG,WAAW,IAAI;EAClB,GAAG,OAAO,0BAA0B;EACpC,GAAG,OAAO,oBAAoB;EAC9B,GAAG,OAAO,oBAAoB;EAC9B,GAAG,OAAO,mBAAmB;EAC7B,GAAG,OAAO,2BAA2B;EAErC,GAAG,QAAQ,oBAAoB,EAAE,IAAI;EACrC,GAAG,QAAQ,qCAAqC,MAAM;EACtD,OAAO,IAAI,gBAAgB,IAAI,OAAO;CACxC;CAEA;CACA;CACA;CACA,aAAa;CAEb,YAAY,IAAc,UAAU,gBAAgB;EAClD,KAAKA,SAAS;GACZ,KAAK,GAAG,QAAQ;;;OAGf;GACD,KAAK,GAAG,QAAQ;;;;;;OAMf;GACD,KAAK,GAAG,QAAQ;;;OAGf;GACD,MAAM,GAAG,QAAQ;;;OAGhB;GACD,OAAO,GAAG,QAAQ;;OAEjB;GACD,QAAQ,GAAG,QAAQ,QAAQ;GAC3B,OAAO,GAAG,QAAQ,OAAO;EAC3B;EACA,KAAKA,OAAO,MAAM,IAAI;EACtB,KAAKC,WAAW;EAChB,KAAKC,MAAM;CACb;CAEA,QAAQ;EACN,KAAKC,YAAY;EACjB,KAAKD,IAAI,MAAM;CACjB;CAEA,KACE,MACA,MACA,KACA,KACuB;EACvB,KAAKE,iBAAiB;EACtB,MAAM,MAAM,KAAKJ,OAAO,IAAI,IAAmB,MAAM,MAAM,GAAG;EAC9D,OAAO,MAAM,KAAK,MAAM,IAAI,GAAG,IAAI;CACrC;CAEA,KAAK,MAAc,MAAc,KAAa,KAAgB;EAC5D,KAAKI,iBAAiB;EACtB,KAAKJ,OAAO,IAAI,IAAI,MAAM,MAAM,KAAK,KAAK,UAAU,GAAG,CAAC;CAC1D;CAEA,KAAK,MAAc,MAAc,KAAa;EAC5C,KAAKI,iBAAiB;EACtB,KAAKJ,OAAO,IAAI,IAAI,MAAM,MAAM,GAAG;CACrC;;;;;;;CAQA,mBAAmB;EACjB,IAAI,EAAE,KAAKK,cAAc,KAAKJ,SAAS,gBACrC,KAAKE,YAAY;CAErB;CAEA,cAAc;EACZ,KAAKH,OAAO,OAAO,IAAI;EACvB,KAAKA,OAAO,MAAM,IAAI;EACtB,KAAKK,aAAa;CACpB;CAEA,CAACC,MACC,MACA,MACA,OAAyB,EAAC,QAAQ,GAAE,GACP;EAC7B,MAAM,EAAC,WAAU;EACjB,KAAK,MAAM,EAAC,KAAK,SAAQ,KAAKN,OAAO,KAAK,QAGvC,MAAM,MAAM,MAAM,GAAG;GACtB,IAAI,CAAC,IAAI,WAAW,MAAM,GACxB;GAEF,MAAM,CAAC,KAAK,KAAK,MAAM,GAAG,CAAC;EAC7B;CACF;CAEA,yBAAyB,MAAkC;EACzD,MAAM,gBAAgB;GACpB,KAAKA,OAAO,MAAM,IAAI,IAAI;GAC1B,KAAKG,YAAY;GACjB,KAAKD,IAAI,QAAQ,KAAKD,SAAS,wBAAwB;EACzD;EACA,KAAKD,OAAO,MAAM,IAAI,IAAI;EAE1B,IAAI,WAAW;EACf,OAAO;GACL,qBAAqB;IACnB,MAAM,OAAO;IACb,OAAO;KACL,MAAM,KAAK,QAAS,KAAKO,KAAK,MAAM,MAAM,KAAK,GAAG;KAClD,MAAM,KAAK,QAAQ,KAAKC,KAAK,MAAM,MAAM,KAAK,GAAG;KACjD,MAAK,QAAO,KAAKC,KAAK,MAAM,MAAM,GAAG;KACrC,OAAM,SAAQ,KAAKH,MAAM,MAAM,MAAM,IAAI;IAC3C;GACF;GAEA;EACF;CACF;AACF"}
+{"version":3,"file":"database-storage.js","names":["#stmts","#options","#db","#checkpoint","#maybeCheckpoint","#numWrites","#scan","#get","#set","#del","#destroy"],"sources":["../../../../zqlite/src/database-storage.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport type {JSONValue} from '../../shared/src/json.ts';\nimport type {Storage} from '../../zql/src/ivm/operator.ts';\nimport type {Stream} from '../../zql/src/ivm/stream.ts';\nimport type {Statement} from './db.ts';\nimport {Database} from './db.ts';\n\nexport interface ClientGroupStorage {\n  /** Creates a {@link Storage} instance for a single operator. */\n  createStorage(): Storage;\n\n  /** Deletes all storage for the client group. */\n  destroy(): void;\n}\n\ntype Statements = {\n  get: Statement;\n  set: Statement;\n  del: Statement;\n  scan: Statement;\n  clear: Statement;\n  clearOp: Statement;\n  commit: Statement;\n  begin: Statement;\n};\n\n// Exported for testing.\nexport const CREATE_STORAGE_TABLE = `\n  CREATE TABLE storage (\n    clientGroupID TEXT,\n    op NUMBER,\n    key TEXT,\n    val TEXT,\n    PRIMARY KEY(clientGroupID, op, key)\n  )\n  `;\n\nconst defaultOptions = {\n  commitInterval: 5_000,\n  compactionThresholdBytes: 50 * 1024 * 1024,\n};\n\nexport class DatabaseStorage {\n  static create(\n    lc: LogContext,\n    path: string,\n    options = defaultOptions,\n  ): DatabaseStorage {\n    // SQLite is used for ephemeral storage (i.e. similar to RAM) that can spill to\n    // disk to avoid consuming too much memory. Each worker thread gets its own\n    // database (file) and acts as the single reader/writer of the DB, so\n    // `locking_mode` is set to `EXCLUSIVE` for performance. Similarly, since\n    // durability is not important, `synchronous` is set to `OFF` for performance.\n    const db = new Database(lc, path);\n    db.unsafeMode(true); // Allows journal_mode = OFF\n    db.pragma('locking_mode = EXCLUSIVE');\n    db.pragma('foreign_keys = OFF');\n    db.pragma('journal_mode = OFF');\n    db.pragma('synchronous = OFF');\n    db.pragma('auto_vacuum = INCREMENTAL');\n\n    db.prepare(CREATE_STORAGE_TABLE).run();\n    lc.debug?.(`Created DatabaseStorage backed by ${path}`);\n    return new DatabaseStorage(db, options);\n  }\n\n  readonly #stmts: Statements;\n  readonly #options: typeof defaultOptions;\n  readonly #db: Database;\n  #numWrites = 0;\n\n  constructor(db: Database, options = defaultOptions) {\n    this.#stmts = {\n      get: db.prepare(`\n        SELECT val FROM storage WHERE\n          clientGroupID = ? AND op = ? AND key = ?\n      `),\n      set: db.prepare(`\n        INSERT INTO storage (clientGroupID, op, key, val)\n          VALUES(?, ?, ?, ?)\n        ON CONFLICT(clientGroupID, op, key) \n        DO \n          UPDATE SET val = excluded.val\n      `),\n      del: db.prepare(`\n        DELETE FROM storage WHERE\n          clientGroupID = ? AND op = ? AND key = ?\n      `),\n      scan: db.prepare(`\n        SELECT key, val FROM storage WHERE\n          clientGroupID = ? AND op = ? AND key >= ?\n      `),\n      clear: db.prepare(`\n        DELETE FROM storage WHERE clientGroupID = ?\n      `),\n      clearOp: db.prepare(`\n        DELETE FROM storage WHERE clientGroupID = ? AND op = ?\n      `),\n      commit: db.prepare('COMMIT'),\n      begin: db.prepare('BEGIN'),\n    };\n    this.#stmts.begin.run();\n    this.#options = options;\n    this.#db = db;\n  }\n\n  close() {\n    this.#checkpoint();\n    this.#db.close();\n  }\n\n  #get(\n    cgID: string,\n    opID: number,\n    key: string,\n    def?: JSONValue,\n  ): JSONValue | undefined {\n    this.#maybeCheckpoint();\n    const row = this.#stmts.get.get<{val: string}>(cgID, opID, key);\n    return row ? JSON.parse(row.val) : def;\n  }\n\n  #set(cgID: string, opID: number, key: string, val: JSONValue) {\n    this.#maybeCheckpoint();\n    this.#stmts.set.run(cgID, opID, key, JSON.stringify(val));\n  }\n\n  #del(cgID: string, opID: number, key: string) {\n    this.#maybeCheckpoint();\n    this.#stmts.del.run(cgID, opID, key);\n  }\n\n  #destroy(cgID: string, opID: number) {\n    this.#maybeCheckpoint();\n    this.#stmts.clearOp.run(cgID, opID);\n  }\n\n  /**\n   * We don't need to commit every single write to the DB\n   * since we're not concerned with durability.\n   * Waiting on commits can be expensive, so we commit\n   * every `COMMIT_INTERVAL` writes.\n   */\n  #maybeCheckpoint() {\n    if (++this.#numWrites >= this.#options.commitInterval) {\n      this.#checkpoint();\n    }\n  }\n\n  #checkpoint() {\n    this.#stmts.commit.run();\n    this.#stmts.begin.run();\n    this.#numWrites = 0;\n  }\n\n  *#scan(\n    cgID: string,\n    opID: number,\n    opts: {prefix: string} = {prefix: ''},\n  ): Stream<[string, JSONValue]> {\n    const {prefix} = opts;\n    for (const {key, val} of this.#stmts.scan.iterate<{\n      key: string;\n      val: string;\n    }>(cgID, opID, prefix)) {\n      if (!key.startsWith(prefix)) {\n        return;\n      }\n      yield [key, JSON.parse(val)];\n    }\n  }\n\n  createClientGroupStorage(cgID: string): ClientGroupStorage {\n    const destroy = () => {\n      this.#stmts.clear.run(cgID);\n      this.#checkpoint();\n      this.#db.compact(this.#options.compactionThresholdBytes);\n    };\n    this.#stmts.clear.run(cgID);\n\n    let nextOpID = 1;\n    return {\n      createStorage: () => {\n        const opID = nextOpID++;\n        return {\n          get: (key, def?) => this.#get(cgID, opID, key, def),\n          set: (key, val) => this.#set(cgID, opID, key, val),\n          del: key => this.#del(cgID, opID, key),\n          scan: opts => this.#scan(cgID, opID, opts),\n          destroy: () => this.#destroy(cgID, opID),\n        };\n      },\n\n      destroy,\n    };\n  }\n}\n"],"mappings":";;AA2BA,IAAa,uBAAuB;;;;;;;;;AAUpC,IAAM,iBAAiB;CACrB,gBAAgB;CAChB,0BAA0B,KAAK,OAAO;AACxC;AAEA,IAAa,kBAAb,MAAa,gBAAgB;CAC3B,OAAO,OACL,IACA,MACA,UAAU,gBACO;EAMjB,MAAM,KAAK,IAAI,SAAS,IAAI,IAAI;EAChC,GAAG,WAAW,IAAI;EAClB,GAAG,OAAO,0BAA0B;EACpC,GAAG,OAAO,oBAAoB;EAC9B,GAAG,OAAO,oBAAoB;EAC9B,GAAG,OAAO,mBAAmB;EAC7B,GAAG,OAAO,2BAA2B;EAErC,GAAG,QAAQ,oBAAoB,EAAE,IAAI;EACrC,GAAG,QAAQ,qCAAqC,MAAM;EACtD,OAAO,IAAI,gBAAgB,IAAI,OAAO;CACxC;CAEA;CACA;CACA;CACA,aAAa;CAEb,YAAY,IAAc,UAAU,gBAAgB;EAClD,KAAKA,SAAS;GACZ,KAAK,GAAG,QAAQ;;;OAGf;GACD,KAAK,GAAG,QAAQ;;;;;;OAMf;GACD,KAAK,GAAG,QAAQ;;;OAGf;GACD,MAAM,GAAG,QAAQ;;;OAGhB;GACD,OAAO,GAAG,QAAQ;;OAEjB;GACD,SAAS,GAAG,QAAQ;;OAEnB;GACD,QAAQ,GAAG,QAAQ,QAAQ;GAC3B,OAAO,GAAG,QAAQ,OAAO;EAC3B;EACA,KAAKA,OAAO,MAAM,IAAI;EACtB,KAAKC,WAAW;EAChB,KAAKC,MAAM;CACb;CAEA,QAAQ;EACN,KAAKC,YAAY;EACjB,KAAKD,IAAI,MAAM;CACjB;CAEA,KACE,MACA,MACA,KACA,KACuB;EACvB,KAAKE,iBAAiB;EACtB,MAAM,MAAM,KAAKJ,OAAO,IAAI,IAAmB,MAAM,MAAM,GAAG;EAC9D,OAAO,MAAM,KAAK,MAAM,IAAI,GAAG,IAAI;CACrC;CAEA,KAAK,MAAc,MAAc,KAAa,KAAgB;EAC5D,KAAKI,iBAAiB;EACtB,KAAKJ,OAAO,IAAI,IAAI,MAAM,MAAM,KAAK,KAAK,UAAU,GAAG,CAAC;CAC1D;CAEA,KAAK,MAAc,MAAc,KAAa;EAC5C,KAAKI,iBAAiB;EACtB,KAAKJ,OAAO,IAAI,IAAI,MAAM,MAAM,GAAG;CACrC;CAEA,SAAS,MAAc,MAAc;EACnC,KAAKI,iBAAiB;EACtB,KAAKJ,OAAO,QAAQ,IAAI,MAAM,IAAI;CACpC;;;;;;;CAQA,mBAAmB;EACjB,IAAI,EAAE,KAAKK,cAAc,KAAKJ,SAAS,gBACrC,KAAKE,YAAY;CAErB;CAEA,cAAc;EACZ,KAAKH,OAAO,OAAO,IAAI;EACvB,KAAKA,OAAO,MAAM,IAAI;EACtB,KAAKK,aAAa;CACpB;CAEA,CAACC,MACC,MACA,MACA,OAAyB,EAAC,QAAQ,GAAE,GACP;EAC7B,MAAM,EAAC,WAAU;EACjB,KAAK,MAAM,EAAC,KAAK,SAAQ,KAAKN,OAAO,KAAK,QAGvC,MAAM,MAAM,MAAM,GAAG;GACtB,IAAI,CAAC,IAAI,WAAW,MAAM,GACxB;GAEF,MAAM,CAAC,KAAK,KAAK,MAAM,GAAG,CAAC;EAC7B;CACF;CAEA,yBAAyB,MAAkC;EACzD,MAAM,gBAAgB;GACpB,KAAKA,OAAO,MAAM,IAAI,IAAI;GAC1B,KAAKG,YAAY;GACjB,KAAKD,IAAI,QAAQ,KAAKD,SAAS,wBAAwB;EACzD;EACA,KAAKD,OAAO,MAAM,IAAI,IAAI;EAE1B,IAAI,WAAW;EACf,OAAO;GACL,qBAAqB;IACnB,MAAM,OAAO;IACb,OAAO;KACL,MAAM,KAAK,QAAS,KAAKO,KAAK,MAAM,MAAM,KAAK,GAAG;KAClD,MAAM,KAAK,QAAQ,KAAKC,KAAK,MAAM,MAAM,KAAK,GAAG;KACjD,MAAK,QAAO,KAAKC,KAAK,MAAM,MAAM,GAAG;KACrC,OAAM,SAAQ,KAAKH,MAAM,MAAM,MAAM,IAAI;KACzC,eAAe,KAAKI,SAAS,MAAM,IAAI;IACzC;GACF;GAEA;EACF;CACF;AACF"}

package/out/zqlite/src/db.d.ts

@@ -9,7 +9,15 @@ export declare class Database implements Disposable {
     pragma<T = unknown>(sql: string): T[];
     compact(freeableBytesThreshold: number): void;
     unsafeMode(unsafe: boolean): void;
-    close(): void;
+    /**
+     * Closes the database. For writable connections, `PRAGMA optimize` is run
+     * first (as recommended by SQLite) unless `optimize` is `false`, which is
+     * appropriate for short-lived handles on a database whose statistics are
+     * maintained by a longer-lived writer.
+     */
+    close({ optimize }?: {
+        optimize?: boolean | undefined;
+    }): void;
     transaction<T>(fn: () => T): T;
     get name(): string;
     get inTransaction(): boolean;

package/out/zqlite/src/db.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"db.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/db.ts"],"names":[],"mappings":"AAAA,OAAO,EAAQ,KAAK,UAAU,EAAC,MAAM,oBAAoB,CAAC;AAC1D,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AACjD,OAAO,eAAe,EAAE,EAEtB,KAAK,SAAS,EACd,KAAK,SAAS,IAAI,gBAAgB,EACnC,MAAM,wBAAwB,CAAC;AAehC,qBAAa,QAAS,YAAW,UAAU;;IAMzC,YACE,EAAE,EAAE,UAAU,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,eAAe,CAAC,OAAO,EACjC,kBAAkB,SAAM,EAsBzB;IAED,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAY9B;IAED,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAEtB;IAED,MAAM,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,CAEpC;IAMD,OAAO,CAAC,sBAAsB,EAAE,MAAM,QAuCrC;IAED,UAAU,CAAC,MAAM,EAAE,OAAO,QAEzB;IAqBD,KAAK,IAAI,IAAI,CAcZ;IAED,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAE7B;IAED,IAAI,IAAI,WAEP;IAED,IAAI,aAAa,YAEhB;IAED,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAEvB;CACF;AAED,qBAAa,SAAS;;IAKpB,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC,cAAc,CAAC,CAAC;IACtD,QAAQ,CAAC,eAAe,EAAE,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;IAE9D,YACE,EAAE,EAAE,UAAU,EACd,KAAK,EAAE,UAAU,EACjB,IAAI,EAAE,gBAAgB,EACtB,SAAS,EAAE,MAAM,EAQlB;IAED,YAAY,CAAC,SAAS,EAAE,OAAO,GAAG,IAAI,CAGrC;IAED,GAAG,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,CAUnC;IAED,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,CAU9B;IAED,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,CAUhC;IAED,OAAO,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAOpD;CACF;AAkFD;;;;GAIG;AACH,qBAAa,iBAAkB,SAAQ,KAAK;CAAG"}
+{"version":3,"file":"db.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/db.ts"],"names":[],"mappings":"AAAA,OAAO,EAAQ,KAAK,UAAU,EAAC,MAAM,oBAAoB,CAAC;AAC1D,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AACjD,OAAO,eAAe,EAAE,EAEtB,KAAK,SAAS,EACd,KAAK,SAAS,IAAI,gBAAgB,EACnC,MAAM,wBAAwB,CAAC;AAehC,qBAAa,QAAS,YAAW,UAAU;;IAMzC,YACE,EAAE,EAAE,UAAU,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,eAAe,CAAC,OAAO,EACjC,kBAAkB,SAAM,EAsBzB;IAED,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAY9B;IAED,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAEtB;IAED,MAAM,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,CAEpC;IAMD,OAAO,CAAC,sBAAsB,EAAE,MAAM,QAuCrC;IAED,UAAU,CAAC,MAAM,EAAE,OAAO,QAEzB;IAmBD;;;;;OAKG;IACH,KAAK,CAAC,EAAC,QAAe,EAAC,GAAE;QAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;KAAM,GAAG,IAAI,CAcpE;IAED,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAE7B;IAED,IAAI,IAAI,WAEP;IAED,IAAI,aAAa,YAEhB;IAED,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAEvB;CACF;AAED,qBAAa,SAAS;;IAKpB,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC,cAAc,CAAC,CAAC;IACtD,QAAQ,CAAC,eAAe,EAAE,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;IAE9D,YACE,EAAE,EAAE,UAAU,EACd,KAAK,EAAE,UAAU,EACjB,IAAI,EAAE,gBAAgB,EACtB,SAAS,EAAE,MAAM,EAQlB;IAED,YAAY,CAAC,SAAS,EAAE,OAAO,GAAG,IAAI,CAGrC;IAED,GAAG,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,CAKnC;IAED,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,CAK9B;IAED,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,CAKhC;IAWD,OAAO,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAOpD;CACF;AA2FD;;;;GAIG;AACH,qBAAa,iBAAkB,SAAQ,KAAK;CAAG"}

package/out/zqlite/src/db.js

@@ -70,12 +70,19 @@ var Database = class {
 			if (e instanceof SqliteError) e.message += `: ${sql}`;
 			throw e;
 		} finally {
-			logIfSlow(this.#lc.withContext("method", method), performance.now() - start, { method }, this.#threshold);
+			const elapsed = performance.now() - start;
+			if (elapsed >= this.#threshold) logSlow(this.#lc.withContext("method", method), elapsed, { method });
 		}
 	}
-	close() {
+	/**
+	* Closes the database. For writable connections, `PRAGMA optimize` is run
+	* first (as recommended by SQLite) unless `optimize` is `false`, which is
+	* appropriate for short-lived handles on a database whose statistics are
+	* maintained by a longer-lived writer.
+	*/
+	close({ optimize = true } = {}) {
 		const start = Date.now();
-		if (!this.#db.readonly) try {
+		if (optimize && !this.#db.readonly) try {
 			this.#db.pragma("optimize");
 			const elapsed = Date.now() - start;
 			if (elapsed > 2) this.#lc.debug?.(`PRAGMA optimized (${elapsed} ms)`);
@@ -119,32 +126,29 @@ var Statement = class {
 	run(...params) {
 		const start = performance.now();
 		const ret = this.#stmt.run(...params);
-		logIfSlow(this.#lc.withContext("method", "run"), performance.now() - start, {
-			...this.#attrs,
-			method: "run"
-		}, this.#threshold);
+		this.#logIfSlow("run", performance.now() - start);
 		return ret;
 	}
 	get(...params) {
 		const start = performance.now();
 		const ret = this.#stmt.get(...params);
-		logIfSlow(this.#lc.withContext("method", "get"), performance.now() - start, {
-			...this.#attrs,
-			method: "get"
-		}, this.#threshold);
+		this.#logIfSlow("get", performance.now() - start);
 		return ret;
 	}
 	all(...params) {
 		const start = performance.now();
 		const ret = this.#stmt.all(...params);
-		logIfSlow(this.#lc.withContext("method", "all"), performance.now() - start, {
-			...this.#attrs,
-			method: "all"
-		}, this.#threshold);
+		this.#logIfSlow("all", performance.now() - start);
 		return ret;
 	}
+	#logIfSlow(method, elapsed) {
+		if (elapsed >= this.#threshold) logSlow(this.#lc.withContext("method", method), elapsed, {
+			...this.#attrs,
+			method
+		});
+	}
 	iterate(...params) {
-		return new LoggingIterableIterator(this.#lc.withContext("method", "iterate"), this.#attrs, this.#stmt.iterate(...params), this.#threshold);
+		return new LoggingIterableIterator(this.#lc, this.#attrs, this.#stmt.iterate(...params), this.#threshold);
 	}
 };
 var LoggingIterableIterator = class {
@@ -171,16 +175,18 @@ var LoggingIterableIterator = class {
 		return ret;
 	}
 	#log() {
-		logIfSlow(this.#lc.withContext("type", "total"), performance.now() - this.#start, {
+		const totalMs = performance.now() - this.#start;
+		if (totalMs >= this.#threshold) logSlow(this.#lc, totalMs, {
 			...this.#attrs,
 			type: "total",
 			method: "iterate"
-		}, this.#threshold);
-		logIfSlow(this.#lc.withContext("type", "sqlite"), this.#sqliteRowTimeSum, {
+		}, "Slow SQLite iterator total time (including consumer work and waits between rows)");
+		if (this.#sqliteRowTimeSum >= this.#threshold) logSlow(this.#lc.withContext("method", "iterate").withContext("type", "sqlite"), this.#sqliteRowTimeSum, {
 			...this.#attrs,
 			type: "sqlite",
-			method: "iterate"
-		}, this.#threshold);
+			method: "iterate",
+			totalMs
+		});
 	}
 	[Symbol.iterator]() {
 		return this;
@@ -194,12 +200,10 @@ var LoggingIterableIterator = class {
 		return this.#it.throw?.(e);
 	}
 };
-function logIfSlow(lc, elapsed, attrs, threshold) {
-	if (elapsed >= threshold) {
-		for (const [key, value] of Object.entries(attrs)) lc = lc.withContext(key, value);
-		lc.warn?.("Slow SQLite query", elapsed);
-		manualSpan(tracer, "db.slow-query", elapsed, attrs);
-	}
+function logSlow(lc, elapsed, attrs, message = "Slow SQLite query") {
+	for (const [key, value] of Object.entries(attrs)) lc = lc.withContext(key, value);
+	lc.warn?.(message, elapsed);
+	manualSpan(tracer, "db.slow-query", elapsed, attrs);
 }
 /**
 * An error indicating that the Database failed to open. This essentially

package/out/zqlite/src/db.js.map

@@ -1 +1 @@
-{"version":3,"file":"db.js","names":["#db","#threshold","#lc","#pageSize","#run","#bytes","#stmt","#attrs","#it","#start","#sqliteRowTimeSum","#log"],"sources":["../../../../zqlite/src/db.ts"],"sourcesContent":["import {trace, type Attributes} from '@opentelemetry/api';\nimport type {LogContext} from '@rocicorp/logger';\nimport SQLite3Database, {\n  SqliteError,\n  type RunResult,\n  type Statement as SQLite3Statement,\n} from '@rocicorp/zero-sqlite3';\nimport {manualSpan} from '../../otel/src/span.ts';\nimport {version} from '../../otel/src/version.ts';\n\nconst tracer = trace.getTracer('view-syncer', version);\n\n// https://www.sqlite.org/pragma.html#pragma_auto_vacuum\nconst AUTO_VACUUM_INCREMENTAL = 2;\n\nconst MB = 1024 * 1024;\n\nfunction mb(bytes: number): string {\n  return (bytes / MB).toFixed(2);\n}\n\nexport class Database implements Disposable {\n  readonly #db: SQLite3Database.Database;\n  readonly #threshold: number;\n  readonly #lc: LogContext;\n  readonly #pageSize: number;\n\n  constructor(\n    lc: LogContext,\n    path: string,\n    options?: SQLite3Database.Options,\n    slowQueryThreshold = 100,\n  ) {\n    try {\n      this.#lc = lc.withContext('class', 'Database').withContext('path', path);\n      this.#db = new SQLite3Database(path, options);\n      this.#threshold = slowQueryThreshold;\n\n      // Match Postgres LIKE/ILIKE semantics. Postgres LIKE is case-sensitive,\n      // but SQLite's LIKE operator is case-insensitive by default; enable\n      // case-sensitive LIKE so the bare operator matches Postgres. Case-\n      // insensitive ILIKE is handled in query-builder.ts by lower()-ing both\n      // operands (using the Unicode-aware lower() that @rocicorp/zero-sqlite3\n      // provides via ICU).\n      this.pragma('case_sensitive_like = ON');\n\n      const [{page_size: pageSize}] = this.pragma<{page_size: number}>(\n        'page_size',\n      );\n      this.#pageSize = pageSize;\n    } catch (cause) {\n      throw new DatabaseInitError(String(cause), {cause});\n    }\n  }\n\n  prepare(sql: string): Statement {\n    return this.#run(\n      'prepare',\n      sql,\n      () =>\n        new Statement(\n          this.#lc.withContext('sql', sql),\n          {class: 'Statement', sql},\n          this.#db.prepare(sql),\n          this.#threshold,\n        ),\n    );\n  }\n\n  exec(sql: string): void {\n    this.#run('exec', sql, () => this.#db.exec(sql));\n  }\n\n  pragma<T = unknown>(sql: string): T[] {\n    return this.#run<T[]>('pragma', sql, () => this.#db.pragma(sql) as T[]);\n  }\n\n  #bytes(pages: number) {\n    return pages * this.#pageSize;\n  }\n\n  compact(freeableBytesThreshold: number) {\n    const [{freelist_count: freelistCount}] = this.pragma<{\n      freelist_count: number;\n    }>('freelist_count');\n\n    const freeable = this.#bytes(freelistCount);\n    if (freeable < freeableBytesThreshold) {\n      this.#lc.debug?.(\n        `Not compacting ${this.#db.name}: ${mb(freeable)} freeable MB`,\n      );\n      return;\n    }\n    const [{auto_vacuum: autoVacuumMode}] = this.pragma<{auto_vacuum: number}>(\n      'auto_vacuum',\n    );\n    if (autoVacuumMode !== AUTO_VACUUM_INCREMENTAL) {\n      this.#lc.warn?.(\n        `Cannot compact ${mb(freeable)} MB of ` +\n          `${this.#db.name} because AUTO_VACUUM mode is ${autoVacuumMode}.`,\n      );\n      return;\n    }\n    const start = Date.now();\n    const [{page_count: pageCountBefore}] = this.pragma<{page_count: number}>(\n      'page_count',\n    );\n\n    this.pragma('incremental_vacuum');\n\n    const [{page_count: pageCountAfter}] = this.pragma<{page_count: number}>(\n      'page_count',\n    );\n\n    this.#lc.info?.(\n      `Compacted ${this.#db.name} from ` +\n        `${mb(this.#bytes(pageCountBefore))} MB to ` +\n        `${mb(this.#bytes(pageCountAfter))} MB ` +\n        `(${Date.now() - start} ms)`,\n    );\n  }\n\n  unsafeMode(unsafe: boolean) {\n    this.#db.unsafeMode(unsafe);\n  }\n\n  #run<T>(method: string, sql: string, fn: () => T): T {\n    const start = performance.now();\n    try {\n      return fn();\n    } catch (e) {\n      if (e instanceof SqliteError) {\n        e.message += `: ${sql}`;\n      }\n      throw e;\n    } finally {\n      logIfSlow(\n        this.#lc.withContext('method', method),\n        performance.now() - start,\n        {method},\n        this.#threshold,\n      );\n    }\n  }\n\n  close(): void {\n    const start = Date.now();\n    if (!this.#db.readonly) {\n      try {\n        this.#db.pragma('optimize');\n        const elapsed = Date.now() - start;\n        if (elapsed > 2) {\n          this.#lc.debug?.(`PRAGMA optimized (${elapsed} ms)`);\n        }\n      } catch (e) {\n        this.#lc.warn?.('error running PRAGMA optimize', e);\n      }\n    }\n    this.#db.close();\n  }\n\n  transaction<T>(fn: () => T): T {\n    return this.#db.transaction(fn)();\n  }\n\n  get name() {\n    return this.#db.name;\n  }\n\n  get inTransaction() {\n    return this.#db.inTransaction;\n  }\n\n  [Symbol.dispose](): void {\n    this.close();\n  }\n}\n\nexport class Statement {\n  readonly #stmt: SQLite3Statement;\n  readonly #lc: LogContext;\n  readonly #threshold: number;\n  readonly #attrs: Attributes;\n  readonly scanStatus: SQLite3Statement['scanStatusV2'];\n  readonly scanStatusReset: SQLite3Statement['scanStatusReset'];\n\n  constructor(\n    lc: LogContext,\n    attrs: Attributes,\n    stmt: SQLite3Statement,\n    threshold: number,\n  ) {\n    this.#lc = lc.withContext('class', 'Statement');\n    this.#attrs = attrs;\n    this.#stmt = stmt;\n    this.#threshold = threshold;\n    this.scanStatus = this.#stmt.scanStatusV2.bind(this.#stmt);\n    this.scanStatusReset = this.#stmt.scanStatusReset.bind(this.#stmt);\n  }\n\n  safeIntegers(useBigInt: boolean): this {\n    this.#stmt.safeIntegers(useBigInt);\n    return this;\n  }\n\n  run(...params: unknown[]): RunResult {\n    const start = performance.now();\n    const ret = this.#stmt.run(...params);\n    logIfSlow(\n      this.#lc.withContext('method', 'run'),\n      performance.now() - start,\n      {...this.#attrs, method: 'run'},\n      this.#threshold,\n    );\n    return ret;\n  }\n\n  get<T>(...params: unknown[]): T {\n    const start = performance.now();\n    const ret = this.#stmt.get(...params);\n    logIfSlow(\n      this.#lc.withContext('method', 'get'),\n      performance.now() - start,\n      {...this.#attrs, method: 'get'},\n      this.#threshold,\n    );\n    return ret as T;\n  }\n\n  all<T>(...params: unknown[]): T[] {\n    const start = performance.now();\n    const ret = this.#stmt.all(...params);\n    logIfSlow(\n      this.#lc.withContext('method', 'all'),\n      performance.now() - start,\n      {...this.#attrs, method: 'all'},\n      this.#threshold,\n    );\n    return ret as T[];\n  }\n\n  iterate<T>(...params: unknown[]): IterableIterator<T> {\n    return new LoggingIterableIterator(\n      this.#lc.withContext('method', 'iterate'),\n      this.#attrs,\n      this.#stmt.iterate(...params),\n      this.#threshold,\n    ) as IterableIterator<T>;\n  }\n}\n\nclass LoggingIterableIterator<T> implements IterableIterator<T> {\n  readonly #lc: LogContext;\n  readonly #it: IterableIterator<T>;\n  readonly #threshold: number;\n  readonly #attrs: Attributes;\n  #start: number;\n  #sqliteRowTimeSum: number;\n\n  constructor(\n    lc: LogContext,\n    attrs: Attributes,\n    it: IterableIterator<T>,\n    slowQueryThreshold: number,\n  ) {\n    this.#lc = lc;\n    this.#attrs = attrs;\n    this.#it = it;\n    this.#start = performance.now();\n    this.#threshold = slowQueryThreshold;\n    this.#sqliteRowTimeSum = 0;\n  }\n\n  next(): IteratorResult<T> {\n    const start = performance.now();\n    const ret = this.#it.next();\n    const elapsed = performance.now() - start;\n    this.#sqliteRowTimeSum += elapsed;\n    if (ret.done) {\n      this.#log();\n    }\n    return ret;\n  }\n\n  #log() {\n    logIfSlow(\n      this.#lc.withContext('type', 'total'),\n      performance.now() - this.#start,\n      {...this.#attrs, type: 'total', method: 'iterate'},\n      this.#threshold,\n    );\n    logIfSlow(\n      this.#lc.withContext('type', 'sqlite'),\n      this.#sqliteRowTimeSum,\n      {...this.#attrs, type: 'sqlite', method: 'iterate'},\n      this.#threshold,\n    );\n  }\n\n  [Symbol.iterator](): IterableIterator<T> {\n    return this;\n  }\n\n  return(): IteratorResult<T> {\n    this.#log();\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    return this.#it.return?.() as any;\n  }\n\n  throw(e: unknown): IteratorResult<T> {\n    this.#log();\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    return this.#it.throw?.(e) as any;\n  }\n}\n\nfunction logIfSlow(\n  lc: LogContext,\n  elapsed: number,\n  attrs: Attributes,\n  threshold: number,\n): void {\n  if (elapsed >= threshold) {\n    for (const [key, value] of Object.entries(attrs)) {\n      lc = lc.withContext(key, value);\n    }\n    lc.warn?.('Slow SQLite query', elapsed);\n    manualSpan(tracer, 'db.slow-query', elapsed, attrs);\n  }\n}\n\n/**\n * An error indicating that the Database failed to open. This essentially\n * wraps the TypeError thrown by the better-sqlite3 package with something\n * more specific.\n */\nexport class DatabaseInitError extends Error {}\n"],"mappings":";;;;;AAUA,IAAM,SAAS,MAAM,UAAU,eAAe,OAAO;AAGrD,IAAM,0BAA0B;AAEhC,IAAM,KAAK,OAAO;AAElB,SAAS,GAAG,OAAuB;CACjC,QAAQ,QAAQ,IAAI,QAAQ,CAAC;AAC/B;AAEA,IAAa,WAAb,MAA4C;CAC1C;CACA;CACA;CACA;CAEA,YACE,IACA,MACA,SACA,qBAAqB,KACrB;EACA,IAAI;GACF,KAAKE,MAAM,GAAG,YAAY,SAAS,UAAU,EAAE,YAAY,QAAQ,IAAI;GACvE,KAAKF,MAAM,IAAI,gBAAgB,MAAM,OAAO;GAC5C,KAAKC,aAAa;GAQlB,KAAK,OAAO,0BAA0B;GAEtC,MAAM,CAAC,EAAC,WAAW,cAAa,KAAK,OACnC,WACF;GACA,KAAKE,YAAY;EACnB,SAAS,OAAO;GACd,MAAM,IAAI,kBAAkB,OAAO,KAAK,GAAG,EAAC,MAAK,CAAC;EACpD;CACF;CAEA,QAAQ,KAAwB;EAC9B,OAAO,KAAKC,KACV,WACA,WAEE,IAAI,UACF,KAAKF,IAAI,YAAY,OAAO,GAAG,GAC/B;GAAC,OAAO;GAAa;EAAG,GACxB,KAAKF,IAAI,QAAQ,GAAG,GACpB,KAAKC,UACP,CACJ;CACF;CAEA,KAAK,KAAmB;EACtB,KAAKG,KAAK,QAAQ,WAAW,KAAKJ,IAAI,KAAK,GAAG,CAAC;CACjD;CAEA,OAAoB,KAAkB;EACpC,OAAO,KAAKI,KAAU,UAAU,WAAW,KAAKJ,IAAI,OAAO,GAAG,CAAQ;CACxE;CAEA,OAAO,OAAe;EACpB,OAAO,QAAQ,KAAKG;CACtB;CAEA,QAAQ,wBAAgC;EACtC,MAAM,CAAC,EAAC,gBAAgB,mBAAkB,KAAK,OAE5C,gBAAgB;EAEnB,MAAM,WAAW,KAAKE,OAAO,aAAa;EAC1C,IAAI,WAAW,wBAAwB;GACrC,KAAKH,IAAI,QACP,kBAAkB,KAAKF,IAAI,KAAK,IAAI,GAAG,QAAQ,EAAE,aACnD;GACA;EACF;EACA,MAAM,CAAC,EAAC,aAAa,oBAAmB,KAAK,OAC3C,aACF;EACA,IAAI,mBAAmB,yBAAyB;GAC9C,KAAKE,IAAI,OACP,kBAAkB,GAAG,QAAQ,EAAE,SAC1B,KAAKF,IAAI,KAAK,+BAA+B,eAAe,EACnE;GACA;EACF;EACA,MAAM,QAAQ,KAAK,IAAI;EACvB,MAAM,CAAC,EAAC,YAAY,qBAAoB,KAAK,OAC3C,YACF;EAEA,KAAK,OAAO,oBAAoB;EAEhC,MAAM,CAAC,EAAC,YAAY,oBAAmB,KAAK,OAC1C,YACF;EAEA,KAAKE,IAAI,OACP,aAAa,KAAKF,IAAI,KAAK,QACtB,GAAG,KAAKK,OAAO,eAAe,CAAC,EAAE,SACjC,GAAG,KAAKA,OAAO,cAAc,CAAC,EAAE,OAC/B,KAAK,IAAI,IAAI,MAAM,KAC3B;CACF;CAEA,WAAW,QAAiB;EAC1B,KAAKL,IAAI,WAAW,MAAM;CAC5B;CAEA,KAAQ,QAAgB,KAAa,IAAgB;EACnD,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI;GACF,OAAO,GAAG;EACZ,SAAS,GAAG;GACV,IAAI,aAAa,aACf,EAAE,WAAW,KAAK;GAEpB,MAAM;EACR,UAAU;GACR,UACE,KAAKE,IAAI,YAAY,UAAU,MAAM,GACrC,YAAY,IAAI,IAAI,OACpB,EAAC,OAAM,GACP,KAAKD,UACP;EACF;CACF;CAEA,QAAc;EACZ,MAAM,QAAQ,KAAK,IAAI;EACvB,IAAI,CAAC,KAAKD,IAAI,UACZ,IAAI;GACF,KAAKA,IAAI,OAAO,UAAU;GAC1B,MAAM,UAAU,KAAK,IAAI,IAAI;GAC7B,IAAI,UAAU,GACZ,KAAKE,IAAI,QAAQ,qBAAqB,QAAQ,KAAK;EAEvD,SAAS,GAAG;GACV,KAAKA,IAAI,OAAO,iCAAiC,CAAC;EACpD;EAEF,KAAKF,IAAI,MAAM;CACjB;CAEA,YAAe,IAAgB;EAC7B,OAAO,KAAKA,IAAI,YAAY,EAAE,EAAE;CAClC;CAEA,IAAI,OAAO;EACT,OAAO,KAAKA,IAAI;CAClB;CAEA,IAAI,gBAAgB;EAClB,OAAO,KAAKA,IAAI;CAClB;CAEA,CAAC,OAAO,WAAiB;EACvB,KAAK,MAAM;CACb;AACF;AAEA,IAAa,YAAb,MAAuB;CACrB;CACA;CACA;CACA;CACA;CACA;CAEA,YACE,IACA,OACA,MACA,WACA;EACA,KAAKE,MAAM,GAAG,YAAY,SAAS,WAAW;EAC9C,KAAKK,SAAS;EACd,KAAKD,QAAQ;EACb,KAAKL,aAAa;EAClB,KAAK,aAAa,KAAKK,MAAM,aAAa,KAAK,KAAKA,KAAK;EACzD,KAAK,kBAAkB,KAAKA,MAAM,gBAAgB,KAAK,KAAKA,KAAK;CACnE;CAEA,aAAa,WAA0B;EACrC,KAAKA,MAAM,aAAa,SAAS;EACjC,OAAO;CACT;CAEA,IAAI,GAAG,QAA8B;EACnC,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKA,MAAM,IAAI,GAAG,MAAM;EACpC,UACE,KAAKJ,IAAI,YAAY,UAAU,KAAK,GACpC,YAAY,IAAI,IAAI,OACpB;GAAC,GAAG,KAAKK;GAAQ,QAAQ;EAAK,GAC9B,KAAKN,UACP;EACA,OAAO;CACT;CAEA,IAAO,GAAG,QAAsB;EAC9B,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKK,MAAM,IAAI,GAAG,MAAM;EACpC,UACE,KAAKJ,IAAI,YAAY,UAAU,KAAK,GACpC,YAAY,IAAI,IAAI,OACpB;GAAC,GAAG,KAAKK;GAAQ,QAAQ;EAAK,GAC9B,KAAKN,UACP;EACA,OAAO;CACT;CAEA,IAAO,GAAG,QAAwB;EAChC,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKK,MAAM,IAAI,GAAG,MAAM;EACpC,UACE,KAAKJ,IAAI,YAAY,UAAU,KAAK,GACpC,YAAY,IAAI,IAAI,OACpB;GAAC,GAAG,KAAKK;GAAQ,QAAQ;EAAK,GAC9B,KAAKN,UACP;EACA,OAAO;CACT;CAEA,QAAW,GAAG,QAAwC;EACpD,OAAO,IAAI,wBACT,KAAKC,IAAI,YAAY,UAAU,SAAS,GACxC,KAAKK,QACL,KAAKD,MAAM,QAAQ,GAAG,MAAM,GAC5B,KAAKL,UACP;CACF;AACF;AAEA,IAAM,0BAAN,MAAgE;CAC9D;CACA;CACA;CACA;CACA;CACA;CAEA,YACE,IACA,OACA,IACA,oBACA;EACA,KAAKC,MAAM;EACX,KAAKK,SAAS;EACd,KAAKC,MAAM;EACX,KAAKC,SAAS,YAAY,IAAI;EAC9B,KAAKR,aAAa;EAClB,KAAKS,oBAAoB;CAC3B;CAEA,OAA0B;EACxB,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKF,IAAI,KAAK;EAC1B,MAAM,UAAU,YAAY,IAAI,IAAI;EACpC,KAAKE,qBAAqB;EAC1B,IAAI,IAAI,MACN,KAAKC,KAAK;EAEZ,OAAO;CACT;CAEA,OAAO;EACL,UACE,KAAKT,IAAI,YAAY,QAAQ,OAAO,GACpC,YAAY,IAAI,IAAI,KAAKO,QACzB;GAAC,GAAG,KAAKF;GAAQ,MAAM;GAAS,QAAQ;EAAS,GACjD,KAAKN,UACP;EACA,UACE,KAAKC,IAAI,YAAY,QAAQ,QAAQ,GACrC,KAAKQ,mBACL;GAAC,GAAG,KAAKH;GAAQ,MAAM;GAAU,QAAQ;EAAS,GAClD,KAAKN,UACP;CACF;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO;CACT;CAEA,SAA4B;EAC1B,KAAKU,KAAK;EAEV,OAAO,KAAKH,IAAI,SAAS;CAC3B;CAEA,MAAM,GAA+B;EACnC,KAAKG,KAAK;EAEV,OAAO,KAAKH,IAAI,QAAQ,CAAC;CAC3B;AACF;AAEA,SAAS,UACP,IACA,SACA,OACA,WACM;CACN,IAAI,WAAW,WAAW;EACxB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,KAAK,GAAG,YAAY,KAAK,KAAK;EAEhC,GAAG,OAAO,qBAAqB,OAAO;EACtC,WAAW,QAAQ,iBAAiB,SAAS,KAAK;CACpD;AACF;;;;;;AAOA,IAAa,oBAAb,cAAuC,MAAM,CAAC"}
+{"version":3,"file":"db.js","names":["#db","#threshold","#lc","#pageSize","#run","#bytes","#stmt","#attrs","#logIfSlow","#it","#start","#sqliteRowTimeSum","#log"],"sources":["../../../../zqlite/src/db.ts"],"sourcesContent":["import {trace, type Attributes} from '@opentelemetry/api';\nimport type {LogContext} from '@rocicorp/logger';\nimport SQLite3Database, {\n  SqliteError,\n  type RunResult,\n  type Statement as SQLite3Statement,\n} from '@rocicorp/zero-sqlite3';\nimport {manualSpan} from '../../otel/src/span.ts';\nimport {version} from '../../otel/src/version.ts';\n\nconst tracer = trace.getTracer('view-syncer', version);\n\n// https://www.sqlite.org/pragma.html#pragma_auto_vacuum\nconst AUTO_VACUUM_INCREMENTAL = 2;\n\nconst MB = 1024 * 1024;\n\nfunction mb(bytes: number): string {\n  return (bytes / MB).toFixed(2);\n}\n\nexport class Database implements Disposable {\n  readonly #db: SQLite3Database.Database;\n  readonly #threshold: number;\n  readonly #lc: LogContext;\n  readonly #pageSize: number;\n\n  constructor(\n    lc: LogContext,\n    path: string,\n    options?: SQLite3Database.Options,\n    slowQueryThreshold = 100,\n  ) {\n    try {\n      this.#lc = lc.withContext('class', 'Database').withContext('path', path);\n      this.#db = new SQLite3Database(path, options);\n      this.#threshold = slowQueryThreshold;\n\n      // Match Postgres LIKE/ILIKE semantics. Postgres LIKE is case-sensitive,\n      // but SQLite's LIKE operator is case-insensitive by default; enable\n      // case-sensitive LIKE so the bare operator matches Postgres. Case-\n      // insensitive ILIKE is handled in query-builder.ts by lower()-ing both\n      // operands (using the Unicode-aware lower() that @rocicorp/zero-sqlite3\n      // provides via ICU).\n      this.pragma('case_sensitive_like = ON');\n\n      const [{page_size: pageSize}] = this.pragma<{page_size: number}>(\n        'page_size',\n      );\n      this.#pageSize = pageSize;\n    } catch (cause) {\n      throw new DatabaseInitError(String(cause), {cause});\n    }\n  }\n\n  prepare(sql: string): Statement {\n    return this.#run(\n      'prepare',\n      sql,\n      () =>\n        new Statement(\n          this.#lc.withContext('sql', sql),\n          {class: 'Statement', sql},\n          this.#db.prepare(sql),\n          this.#threshold,\n        ),\n    );\n  }\n\n  exec(sql: string): void {\n    this.#run('exec', sql, () => this.#db.exec(sql));\n  }\n\n  pragma<T = unknown>(sql: string): T[] {\n    return this.#run<T[]>('pragma', sql, () => this.#db.pragma(sql) as T[]);\n  }\n\n  #bytes(pages: number) {\n    return pages * this.#pageSize;\n  }\n\n  compact(freeableBytesThreshold: number) {\n    const [{freelist_count: freelistCount}] = this.pragma<{\n      freelist_count: number;\n    }>('freelist_count');\n\n    const freeable = this.#bytes(freelistCount);\n    if (freeable < freeableBytesThreshold) {\n      this.#lc.debug?.(\n        `Not compacting ${this.#db.name}: ${mb(freeable)} freeable MB`,\n      );\n      return;\n    }\n    const [{auto_vacuum: autoVacuumMode}] = this.pragma<{auto_vacuum: number}>(\n      'auto_vacuum',\n    );\n    if (autoVacuumMode !== AUTO_VACUUM_INCREMENTAL) {\n      this.#lc.warn?.(\n        `Cannot compact ${mb(freeable)} MB of ` +\n          `${this.#db.name} because AUTO_VACUUM mode is ${autoVacuumMode}.`,\n      );\n      return;\n    }\n    const start = Date.now();\n    const [{page_count: pageCountBefore}] = this.pragma<{page_count: number}>(\n      'page_count',\n    );\n\n    this.pragma('incremental_vacuum');\n\n    const [{page_count: pageCountAfter}] = this.pragma<{page_count: number}>(\n      'page_count',\n    );\n\n    this.#lc.info?.(\n      `Compacted ${this.#db.name} from ` +\n        `${mb(this.#bytes(pageCountBefore))} MB to ` +\n        `${mb(this.#bytes(pageCountAfter))} MB ` +\n        `(${Date.now() - start} ms)`,\n    );\n  }\n\n  unsafeMode(unsafe: boolean) {\n    this.#db.unsafeMode(unsafe);\n  }\n\n  #run<T>(method: string, sql: string, fn: () => T): T {\n    const start = performance.now();\n    try {\n      return fn();\n    } catch (e) {\n      if (e instanceof SqliteError) {\n        e.message += `: ${sql}`;\n      }\n      throw e;\n    } finally {\n      const elapsed = performance.now() - start;\n      if (elapsed >= this.#threshold) {\n        logSlow(this.#lc.withContext('method', method), elapsed, {method});\n      }\n    }\n  }\n\n  /**\n   * Closes the database. For writable connections, `PRAGMA optimize` is run\n   * first (as recommended by SQLite) unless `optimize` is `false`, which is\n   * appropriate for short-lived handles on a database whose statistics are\n   * maintained by a longer-lived writer.\n   */\n  close({optimize = true}: {optimize?: boolean | undefined} = {}): void {\n    const start = Date.now();\n    if (optimize && !this.#db.readonly) {\n      try {\n        this.#db.pragma('optimize');\n        const elapsed = Date.now() - start;\n        if (elapsed > 2) {\n          this.#lc.debug?.(`PRAGMA optimized (${elapsed} ms)`);\n        }\n      } catch (e) {\n        this.#lc.warn?.('error running PRAGMA optimize', e);\n      }\n    }\n    this.#db.close();\n  }\n\n  transaction<T>(fn: () => T): T {\n    return this.#db.transaction(fn)();\n  }\n\n  get name() {\n    return this.#db.name;\n  }\n\n  get inTransaction() {\n    return this.#db.inTransaction;\n  }\n\n  [Symbol.dispose](): void {\n    this.close();\n  }\n}\n\nexport class Statement {\n  readonly #stmt: SQLite3Statement;\n  readonly #lc: LogContext;\n  readonly #threshold: number;\n  readonly #attrs: Attributes;\n  readonly scanStatus: SQLite3Statement['scanStatusV2'];\n  readonly scanStatusReset: SQLite3Statement['scanStatusReset'];\n\n  constructor(\n    lc: LogContext,\n    attrs: Attributes,\n    stmt: SQLite3Statement,\n    threshold: number,\n  ) {\n    this.#lc = lc.withContext('class', 'Statement');\n    this.#attrs = attrs;\n    this.#stmt = stmt;\n    this.#threshold = threshold;\n    this.scanStatus = this.#stmt.scanStatusV2.bind(this.#stmt);\n    this.scanStatusReset = this.#stmt.scanStatusReset.bind(this.#stmt);\n  }\n\n  safeIntegers(useBigInt: boolean): this {\n    this.#stmt.safeIntegers(useBigInt);\n    return this;\n  }\n\n  run(...params: unknown[]): RunResult {\n    const start = performance.now();\n    const ret = this.#stmt.run(...params);\n    this.#logIfSlow('run', performance.now() - start);\n    return ret;\n  }\n\n  get<T>(...params: unknown[]): T {\n    const start = performance.now();\n    const ret = this.#stmt.get(...params);\n    this.#logIfSlow('get', performance.now() - start);\n    return ret as T;\n  }\n\n  all<T>(...params: unknown[]): T[] {\n    const start = performance.now();\n    const ret = this.#stmt.all(...params);\n    this.#logIfSlow('all', performance.now() - start);\n    return ret as T[];\n  }\n\n  #logIfSlow(method: string, elapsed: number): void {\n    if (elapsed >= this.#threshold) {\n      logSlow(this.#lc.withContext('method', method), elapsed, {\n        ...this.#attrs,\n        method,\n      });\n    }\n  }\n\n  iterate<T>(...params: unknown[]): IterableIterator<T> {\n    return new LoggingIterableIterator(\n      this.#lc,\n      this.#attrs,\n      this.#stmt.iterate(...params),\n      this.#threshold,\n    ) as IterableIterator<T>;\n  }\n}\n\nclass LoggingIterableIterator<T> implements IterableIterator<T> {\n  readonly #lc: LogContext;\n  readonly #it: IterableIterator<T>;\n  readonly #threshold: number;\n  readonly #attrs: Attributes;\n  #start: number;\n  #sqliteRowTimeSum: number;\n\n  constructor(\n    lc: LogContext,\n    attrs: Attributes,\n    it: IterableIterator<T>,\n    slowQueryThreshold: number,\n  ) {\n    this.#lc = lc;\n    this.#attrs = attrs;\n    this.#it = it;\n    this.#start = performance.now();\n    this.#threshold = slowQueryThreshold;\n    this.#sqliteRowTimeSum = 0;\n  }\n\n  next(): IteratorResult<T> {\n    const start = performance.now();\n    const ret = this.#it.next();\n    const elapsed = performance.now() - start;\n    this.#sqliteRowTimeSum += elapsed;\n    if (ret.done) {\n      this.#log();\n    }\n    return ret;\n  }\n\n  #log() {\n    // Total time includes downstream consumer work and waits between rows.\n    // Check it independently of the time spent stepping SQLite.\n    const totalMs = performance.now() - this.#start;\n    if (totalMs >= this.#threshold) {\n      logSlow(\n        this.#lc,\n        totalMs,\n        {...this.#attrs, type: 'total', method: 'iterate'},\n        'Slow SQLite iterator total time (including consumer work and waits between rows)',\n      );\n    }\n    if (this.#sqliteRowTimeSum >= this.#threshold) {\n      logSlow(\n        this.#lc.withContext('method', 'iterate').withContext('type', 'sqlite'),\n        this.#sqliteRowTimeSum,\n        {\n          ...this.#attrs,\n          type: 'sqlite',\n          method: 'iterate',\n          totalMs,\n        },\n      );\n    }\n  }\n\n  [Symbol.iterator](): IterableIterator<T> {\n    return this;\n  }\n\n  return(): IteratorResult<T> {\n    this.#log();\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    return this.#it.return?.() as any;\n  }\n\n  throw(e: unknown): IteratorResult<T> {\n    this.#log();\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    return this.#it.throw?.(e) as any;\n  }\n}\n\nfunction logSlow(\n  lc: LogContext,\n  elapsed: number,\n  attrs: Attributes,\n  message = 'Slow SQLite query',\n): void {\n  for (const [key, value] of Object.entries(attrs)) {\n    lc = lc.withContext(key, value);\n  }\n  lc.warn?.(message, elapsed);\n  manualSpan(tracer, 'db.slow-query', elapsed, attrs);\n}\n\n/**\n * An error indicating that the Database failed to open. This essentially\n * wraps the TypeError thrown by the better-sqlite3 package with something\n * more specific.\n */\nexport class DatabaseInitError extends Error {}\n"],"mappings":";;;;;AAUA,IAAM,SAAS,MAAM,UAAU,eAAe,OAAO;AAGrD,IAAM,0BAA0B;AAEhC,IAAM,KAAK,OAAO;AAElB,SAAS,GAAG,OAAuB;CACjC,QAAQ,QAAQ,IAAI,QAAQ,CAAC;AAC/B;AAEA,IAAa,WAAb,MAA4C;CAC1C;CACA;CACA;CACA;CAEA,YACE,IACA,MACA,SACA,qBAAqB,KACrB;EACA,IAAI;GACF,KAAKE,MAAM,GAAG,YAAY,SAAS,UAAU,EAAE,YAAY,QAAQ,IAAI;GACvE,KAAKF,MAAM,IAAI,gBAAgB,MAAM,OAAO;GAC5C,KAAKC,aAAa;GAQlB,KAAK,OAAO,0BAA0B;GAEtC,MAAM,CAAC,EAAC,WAAW,cAAa,KAAK,OACnC,WACF;GACA,KAAKE,YAAY;EACnB,SAAS,OAAO;GACd,MAAM,IAAI,kBAAkB,OAAO,KAAK,GAAG,EAAC,MAAK,CAAC;EACpD;CACF;CAEA,QAAQ,KAAwB;EAC9B,OAAO,KAAKC,KACV,WACA,WAEE,IAAI,UACF,KAAKF,IAAI,YAAY,OAAO,GAAG,GAC/B;GAAC,OAAO;GAAa;EAAG,GACxB,KAAKF,IAAI,QAAQ,GAAG,GACpB,KAAKC,UACP,CACJ;CACF;CAEA,KAAK,KAAmB;EACtB,KAAKG,KAAK,QAAQ,WAAW,KAAKJ,IAAI,KAAK,GAAG,CAAC;CACjD;CAEA,OAAoB,KAAkB;EACpC,OAAO,KAAKI,KAAU,UAAU,WAAW,KAAKJ,IAAI,OAAO,GAAG,CAAQ;CACxE;CAEA,OAAO,OAAe;EACpB,OAAO,QAAQ,KAAKG;CACtB;CAEA,QAAQ,wBAAgC;EACtC,MAAM,CAAC,EAAC,gBAAgB,mBAAkB,KAAK,OAE5C,gBAAgB;EAEnB,MAAM,WAAW,KAAKE,OAAO,aAAa;EAC1C,IAAI,WAAW,wBAAwB;GACrC,KAAKH,IAAI,QACP,kBAAkB,KAAKF,IAAI,KAAK,IAAI,GAAG,QAAQ,EAAE,aACnD;GACA;EACF;EACA,MAAM,CAAC,EAAC,aAAa,oBAAmB,KAAK,OAC3C,aACF;EACA,IAAI,mBAAmB,yBAAyB;GAC9C,KAAKE,IAAI,OACP,kBAAkB,GAAG,QAAQ,EAAE,SAC1B,KAAKF,IAAI,KAAK,+BAA+B,eAAe,EACnE;GACA;EACF;EACA,MAAM,QAAQ,KAAK,IAAI;EACvB,MAAM,CAAC,EAAC,YAAY,qBAAoB,KAAK,OAC3C,YACF;EAEA,KAAK,OAAO,oBAAoB;EAEhC,MAAM,CAAC,EAAC,YAAY,oBAAmB,KAAK,OAC1C,YACF;EAEA,KAAKE,IAAI,OACP,aAAa,KAAKF,IAAI,KAAK,QACtB,GAAG,KAAKK,OAAO,eAAe,CAAC,EAAE,SACjC,GAAG,KAAKA,OAAO,cAAc,CAAC,EAAE,OAC/B,KAAK,IAAI,IAAI,MAAM,KAC3B;CACF;CAEA,WAAW,QAAiB;EAC1B,KAAKL,IAAI,WAAW,MAAM;CAC5B;CAEA,KAAQ,QAAgB,KAAa,IAAgB;EACnD,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI;GACF,OAAO,GAAG;EACZ,SAAS,GAAG;GACV,IAAI,aAAa,aACf,EAAE,WAAW,KAAK;GAEpB,MAAM;EACR,UAAU;GACR,MAAM,UAAU,YAAY,IAAI,IAAI;GACpC,IAAI,WAAW,KAAKC,YAClB,QAAQ,KAAKC,IAAI,YAAY,UAAU,MAAM,GAAG,SAAS,EAAC,OAAM,CAAC;EAErE;CACF;;;;;;;CAQA,MAAM,EAAC,WAAW,SAA0C,CAAC,GAAS;EACpE,MAAM,QAAQ,KAAK,IAAI;EACvB,IAAI,YAAY,CAAC,KAAKF,IAAI,UACxB,IAAI;GACF,KAAKA,IAAI,OAAO,UAAU;GAC1B,MAAM,UAAU,KAAK,IAAI,IAAI;GAC7B,IAAI,UAAU,GACZ,KAAKE,IAAI,QAAQ,qBAAqB,QAAQ,KAAK;EAEvD,SAAS,GAAG;GACV,KAAKA,IAAI,OAAO,iCAAiC,CAAC;EACpD;EAEF,KAAKF,IAAI,MAAM;CACjB;CAEA,YAAe,IAAgB;EAC7B,OAAO,KAAKA,IAAI,YAAY,EAAE,EAAE;CAClC;CAEA,IAAI,OAAO;EACT,OAAO,KAAKA,IAAI;CAClB;CAEA,IAAI,gBAAgB;EAClB,OAAO,KAAKA,IAAI;CAClB;CAEA,CAAC,OAAO,WAAiB;EACvB,KAAK,MAAM;CACb;AACF;AAEA,IAAa,YAAb,MAAuB;CACrB;CACA;CACA;CACA;CACA;CACA;CAEA,YACE,IACA,OACA,MACA,WACA;EACA,KAAKE,MAAM,GAAG,YAAY,SAAS,WAAW;EAC9C,KAAKK,SAAS;EACd,KAAKD,QAAQ;EACb,KAAKL,aAAa;EAClB,KAAK,aAAa,KAAKK,MAAM,aAAa,KAAK,KAAKA,KAAK;EACzD,KAAK,kBAAkB,KAAKA,MAAM,gBAAgB,KAAK,KAAKA,KAAK;CACnE;CAEA,aAAa,WAA0B;EACrC,KAAKA,MAAM,aAAa,SAAS;EACjC,OAAO;CACT;CAEA,IAAI,GAAG,QAA8B;EACnC,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKA,MAAM,IAAI,GAAG,MAAM;EACpC,KAAKE,WAAW,OAAO,YAAY,IAAI,IAAI,KAAK;EAChD,OAAO;CACT;CAEA,IAAO,GAAG,QAAsB;EAC9B,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKF,MAAM,IAAI,GAAG,MAAM;EACpC,KAAKE,WAAW,OAAO,YAAY,IAAI,IAAI,KAAK;EAChD,OAAO;CACT;CAEA,IAAO,GAAG,QAAwB;EAChC,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKF,MAAM,IAAI,GAAG,MAAM;EACpC,KAAKE,WAAW,OAAO,YAAY,IAAI,IAAI,KAAK;EAChD,OAAO;CACT;CAEA,WAAW,QAAgB,SAAuB;EAChD,IAAI,WAAW,KAAKP,YAClB,QAAQ,KAAKC,IAAI,YAAY,UAAU,MAAM,GAAG,SAAS;GACvD,GAAG,KAAKK;GACR;EACF,CAAC;CAEL;CAEA,QAAW,GAAG,QAAwC;EACpD,OAAO,IAAI,wBACT,KAAKL,KACL,KAAKK,QACL,KAAKD,MAAM,QAAQ,GAAG,MAAM,GAC5B,KAAKL,UACP;CACF;AACF;AAEA,IAAM,0BAAN,MAAgE;CAC9D;CACA;CACA;CACA;CACA;CACA;CAEA,YACE,IACA,OACA,IACA,oBACA;EACA,KAAKC,MAAM;EACX,KAAKK,SAAS;EACd,KAAKE,MAAM;EACX,KAAKC,SAAS,YAAY,IAAI;EAC9B,KAAKT,aAAa;EAClB,KAAKU,oBAAoB;CAC3B;CAEA,OAA0B;EACxB,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,MAAM,KAAKF,IAAI,KAAK;EAC1B,MAAM,UAAU,YAAY,IAAI,IAAI;EACpC,KAAKE,qBAAqB;EAC1B,IAAI,IAAI,MACN,KAAKC,KAAK;EAEZ,OAAO;CACT;CAEA,OAAO;EAGL,MAAM,UAAU,YAAY,IAAI,IAAI,KAAKF;EACzC,IAAI,WAAW,KAAKT,YAClB,QACE,KAAKC,KACL,SACA;GAAC,GAAG,KAAKK;GAAQ,MAAM;GAAS,QAAQ;EAAS,GACjD,kFACF;EAEF,IAAI,KAAKI,qBAAqB,KAAKV,YACjC,QACE,KAAKC,IAAI,YAAY,UAAU,SAAS,EAAE,YAAY,QAAQ,QAAQ,GACtE,KAAKS,mBACL;GACE,GAAG,KAAKJ;GACR,MAAM;GACN,QAAQ;GACR;EACF,CACF;CAEJ;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO;CACT;CAEA,SAA4B;EAC1B,KAAKK,KAAK;EAEV,OAAO,KAAKH,IAAI,SAAS;CAC3B;CAEA,MAAM,GAA+B;EACnC,KAAKG,KAAK;EAEV,OAAO,KAAKH,IAAI,QAAQ,CAAC;CAC3B;AACF;AAEA,SAAS,QACP,IACA,SACA,OACA,UAAU,qBACJ;CACN,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,KAAK,GAAG,YAAY,KAAK,KAAK;CAEhC,GAAG,OAAO,SAAS,OAAO;CAC1B,WAAW,QAAQ,iBAAiB,SAAS,KAAK;AACpD;;;;;;AAOA,IAAa,oBAAb,cAAuC,MAAM,CAAC"}

package/out/zqlite/src/pending-delta.d.ts

@@ -0,0 +1,110 @@
+import type { Ordering } from '../../zero-protocol/src/ast.ts';
+import type { Row } from '../../zero-protocol/src/data.ts';
+import type { PrimaryKey } from '../../zero-protocol/src/primary-key.ts';
+import { type Constraint } from '../../zql/src/ivm/constraint.ts';
+import type { Comparator } from '../../zql/src/ivm/data.ts';
+import type { MultiConstraint } from '../../zql/src/ivm/operator.ts';
+/**
+ * The batch overlay that lets a `TableSource` derive a transaction without
+ * writing to the database it is reading from.
+ *
+ * A `TableSource` normally makes each change durable in its backing SQLite
+ * connection as soon as it has been vended to every output, because change
+ * *k+1* has to read a base that already includes changes *1..k* -- IVM's
+ * joins fetch from the source mid-push. On the server that backing connection
+ * is a `BEGIN CONCURRENT` snapshot that is never committed and always rolled
+ * back, so those writes exist only to serve reads for the rest of the pass.
+ *
+ * A `PendingDelta` holds them in memory instead. The base stays pinned at the
+ * state it had when the pass began and this object supplies *1..k*, merged
+ * into every leaf scan. The durable copy comes from the replicator's own
+ * commit, which the source picks up when it leapfrogs to the next snapshot.
+ *
+ * State is coalesced by primary key: whatever the batch did to a row, all that
+ * matters downstream is the row's final value, or that it is gone. A key that
+ * appears here overrides the base unconditionally -- an added row has no base
+ * to override, an edited row's base copy is suppressed in favor of the new
+ * value, and a removed row's base copy is suppressed with nothing to put in
+ * its place.
+ *
+ * Live rows are additionally kept in lazily built sorted indexes, one per
+ * `[...constraintKeys, ...sort]` shape a fetch has asked for, so that merging
+ * the delta into a constrained scan costs `O(log D + matches)` rather than a
+ * walk of the whole delta. This mirrors `MemorySource`'s index handling; see
+ * its `#fetch` for the bound construction the scans here reproduce.
+ */
+export declare class PendingDelta {
+    #private;
+    constructor(primaryKey: PrimaryKey);
+    /**
+     * True when the source can take its untouched fast path: no suppression
+     * test per base row, no merge, no index maintenance.
+     */
+    get isEmpty(): boolean;
+    /** The number of rows the batch has touched, tombstones included. */
+    get size(): number;
+    /**
+     * Estimated retained bytes, including keys, tombstones, and sorted indexes.
+     * This is a budgeting heuristic, not a measurement of the JavaScript heap.
+     */
+    get estimatedBytes(): number;
+    /** Records that `row` is now present with this value. */
+    set(row: Row): void;
+    /** Records that `row` is now absent. */
+    delete(row: Row): void;
+    /**
+     * Whether the batch overrides this base row. Callers use it to suppress base
+     * rows during a merge, so it must be answered by primary key -- the value
+     * carried by the base row is exactly what the delta is replacing.
+     */
+    overrides(row: Row): boolean;
+    /**
+     * The batch's value for a row, by primary key. Returns `NOT_OVERRIDDEN` when
+     * the batch has not touched the key at all (so the caller should consult the
+     * base) and `undefined` when the batch removed it.
+     */
+    get(row: Row): Row | undefined | typeof NOT_OVERRIDDEN;
+    /**
+     * Looks a row up by an arbitrary (not necessarily primary) unique key. Only
+     * reachable when the delta is non-empty, which is never the case for the one
+     * caller that uses a non-primary key, so a walk is fine here.
+     */
+    getByColumns(keyCols: readonly string[], keyRow: Row): Row | undefined;
+    /**
+     * The live rows this batch contributes to a fetch, in the same order the
+     * backing SQL query returns its rows, so the two streams can be merged.
+     *
+     * `constraint`, `multiConstraints` and `filterPredicate` are the ones SQL
+     * already applied to the base rows; they are applied here so the delta rows
+     * are subject to the same query. `start` is the fetch's start row: the scan
+     * begins there rather than at the start of the constraint span. It is
+     * inclusive, so the caller still applies an `after` basis.
+     */
+    rowsFor(sort: Ordering, constraint: Constraint | undefined, reverse: boolean | undefined, filterPredicate: ((row: Row) => boolean | undefined) | undefined, multiConstraints: readonly MultiConstraint[] | undefined, start?: Row | undefined): Iterable<Row>;
+    /**
+     * A row with the primary key of each row the batch has touched, removed
+     * rows included. A live row is returned as is.
+     */
+    touchedKeys(): Iterable<Row>;
+    /** The rows the batch has added or edited, and not since removed. */
+    liveRows(): Iterable<Row>;
+    /** Drops the batch. Called when the source moves to a snapshot that has it. */
+    clear(): void;
+}
+export declare const NOT_OVERRIDDEN: unique symbol;
+/**
+ * Merges a batch's rows into an ordered base stream and drops the base rows
+ * the batch overrides.
+ *
+ * Both streams must already be in `compare` order. A delta row that ties with
+ * a base row is the *same* row by primary key -- every fetch ordering includes
+ * the primary key -- so the base copy is suppressed and the delta's value
+ * takes its place at that position.
+ */
+export declare function generateWithPendingDelta(baseRows: Iterable<Row>, deltaRows: Iterable<Row>, delta: PendingDelta, compare: Comparator): IterableIterator<Row>;
+/**
+ * The unordered counterpart. Nothing downstream depends on position, so the
+ * surviving base rows are emitted first and the batch's rows follow.
+ */
+export declare function generateWithPendingDeltaUnordered(baseRows: Iterable<Row>, deltaRows: Iterable<Row>, delta: PendingDelta): IterableIterator<Row>;
+//# sourceMappingURL=pending-delta.d.ts.map

package/out/zqlite/src/pending-delta.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pending-delta.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/pending-delta.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,gCAAgC,CAAC;AACxE,OAAO,KAAK,EAAC,GAAG,EAAQ,MAAM,iCAAiC,CAAC;AAChE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AACvE,OAAO,EAGL,KAAK,UAAU,EAChB,MAAM,iCAAiC,CAAC;AACzC,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,2BAA2B,CAAC;AAQ1D,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,+BAA+B,CAAC;AAEnE;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,qBAAa,YAAY;;IA0BvB,YAAY,UAAU,EAAE,UAAU,EAGjC;IAED;;;OAGG;IACH,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,qEAAqE;IACrE,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;OAGG;IACH,IAAI,cAAc,IAAI,MAAM,CAO3B;IAqBD,yDAAyD;IACzD,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAgBlB;IAED,wCAAwC;IACxC,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAUrB;IAED;;;;OAIG;IACH,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAQ3B;IAED;;;;OAIG;IACH,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,GAAG,OAAO,cAAc,CAMrD;IAED;;;;OAIG;IACH,YAAY,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAOrE;IA8BD;;;;;;;;;OASG;IACF,OAAO,CACN,IAAI,EAAE,QAAQ,EACd,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,eAAe,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,GAAG,SAAS,CAAC,GAAG,SAAS,EAChE,gBAAgB,EAAE,SAAS,eAAe,EAAE,GAAG,SAAS,EACxD,KAAK,CAAC,EAAE,GAAG,GAAG,SAAS,GACtB,QAAQ,CAAC,GAAG,CAAC,CAiEf;IAED;;;OAGG;IACF,WAAW,IAAI,QAAQ,CAAC,GAAG,CAAC,CAc5B;IAED,qEAAqE;IACpE,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,CAMzB;IAED,+EAA+E;IAC/E,KAAK,IAAI,IAAI,CAOZ;CACF;AAwBD,eAAO,MAAM,cAAc,eAA2B,CAAC;AAwBvD;;;;;;;;GAQG;AACH,wBAAiB,wBAAwB,CACvC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,EACvB,SAAS,EAAE,QAAQ,CAAC,GAAG,CAAC,EACxB,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,UAAU,GAClB,gBAAgB,CAAC,GAAG,CAAC,CAwBvB;AAED;;;GAGG;AACH,wBAAiB,iCAAiC,CAChD,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,EACvB,SAAS,EAAE,QAAQ,CAAC,GAAG,CAAC,EACxB,KAAK,EAAE,YAAY,GAClB,gBAAgB,CAAC,GAAG,CAAC,CAOvB"}

package/out/zqlite/src/pending-delta.js

@@ -0,0 +1,278 @@
+import { hasOwn } from "../../shared/src/has-own.js";
+import { constraintMatchesPrimaryKey, constraintMatchesRow } from "../../zql/src/ivm/constraint.js";
+import { BTreeSet } from "../../shared/src/btree-set.js";
+import { generateRows, makeBoundComparator, maxValue, minValue } from "../../zql/src/ivm/memory-source.js";
+//#region ../zqlite/src/pending-delta.ts
+/**
+* The batch overlay that lets a `TableSource` derive a transaction without
+* writing to the database it is reading from.
+*
+* A `TableSource` normally makes each change durable in its backing SQLite
+* connection as soon as it has been vended to every output, because change
+* *k+1* has to read a base that already includes changes *1..k* -- IVM's
+* joins fetch from the source mid-push. On the server that backing connection
+* is a `BEGIN CONCURRENT` snapshot that is never committed and always rolled
+* back, so those writes exist only to serve reads for the rest of the pass.
+*
+* A `PendingDelta` holds them in memory instead. The base stays pinned at the
+* state it had when the pass began and this object supplies *1..k*, merged
+* into every leaf scan. The durable copy comes from the replicator's own
+* commit, which the source picks up when it leapfrogs to the next snapshot.
+*
+* State is coalesced by primary key: whatever the batch did to a row, all that
+* matters downstream is the row's final value, or that it is gone. A key that
+* appears here overrides the base unconditionally -- an added row has no base
+* to override, an edited row's base copy is suppressed in favor of the new
+* value, and a removed row's base copy is suppressed with nothing to put in
+* its place.
+*
+* Live rows are additionally kept in lazily built sorted indexes, one per
+* `[...constraintKeys, ...sort]` shape a fetch has asked for, so that merging
+* the delta into a constrained scan costs `O(log D + matches)` rather than a
+* walk of the whole delta. This mirrors `MemorySource`'s index handling; see
+* its `#fetch` for the bound construction the scans here reproduce.
+*/
+var PendingDelta = class {
+	#primaryKey;
+	#singleColumnKey;
+	/**
+	* For a composite primary key, the first key column's value of every key in
+	* `#byKey`. {@link overrides} runs for every base row of a merged fetch, and
+	* building a composite key allocates, so this rules most rows out first.
+	*/
+	#firstKeyValues = /* @__PURE__ */ new Set();
+	/**
+	* The coalesced net state, keyed by primary key. A `undefined` value is a
+	* tombstone: the batch removed the row, so the base copy is suppressed and
+	* nothing replaces it. Membership alone is what suppresses a base row, so
+	* this map is also the "is this key overridden" test.
+	*/
+	#byKey = /* @__PURE__ */ new Map();
+	/** Sorted views over the live (non-tombstone) rows, keyed by `JSON(sort)`. */
+	#indexes = /* @__PURE__ */ new Map();
+	#liveCount = 0;
+	#rowBytes = 0;
+	#indexBytes = 0;
+	constructor(primaryKey) {
+		this.#primaryKey = primaryKey;
+		this.#singleColumnKey = primaryKey.length === 1 ? primaryKey[0] : void 0;
+	}
+	/**
+	* True when the source can take its untouched fast path: no suppression
+	* test per base row, no merge, no index maintenance.
+	*/
+	get isEmpty() {
+		return this.#byKey.size === 0;
+	}
+	/** The number of rows the batch has touched, tombstones included. */
+	get size() {
+		return this.#byKey.size;
+	}
+	/**
+	* Estimated retained bytes, including keys, tombstones, and sorted indexes.
+	* This is a budgeting heuristic, not a measurement of the JavaScript heap.
+	*/
+	get estimatedBytes() {
+		return this.#rowBytes + this.#indexBytes + this.#liveCount * this.#indexes.size * 32;
+	}
+	#key(row) {
+		const single = this.#singleColumnKey;
+		if (single !== void 0) return row[single];
+		const key = this.#primaryKey.map((k) => row[k]);
+		return JSON.stringify(key);
+	}
+	#track(row, key) {
+		if (this.#byKey.has(key)) return;
+		this.#rowBytes += 64 + estimateBytes(key);
+		if (this.#singleColumnKey === void 0) this.#firstKeyValues.add(row[this.#primaryKey[0]]);
+	}
+	/** Records that `row` is now present with this value. */
+	set(row) {
+		const key = this.#key(row);
+		const existing = this.#byKey.get(key);
+		this.#track(row, key);
+		this.#rowBytes += estimateBytes(row) - (existing === void 0 ? 0 : estimateBytes(existing));
+		if (existing !== void 0) {
+			this.#removeFromIndexes(existing);
+			this.#liveCount--;
+		}
+		this.#byKey.set(key, row);
+		this.#addToIndexes(row);
+		this.#liveCount++;
+	}
+	/** Records that `row` is now absent. */
+	delete(row) {
+		const key = this.#key(row);
+		const existing = this.#byKey.get(key);
+		this.#track(row, key);
+		if (existing !== void 0) {
+			this.#rowBytes -= estimateBytes(existing);
+			this.#removeFromIndexes(existing);
+			this.#liveCount--;
+		}
+		this.#byKey.set(key, void 0);
+	}
+	/**
+	* Whether the batch overrides this base row. Callers use it to suppress base
+	* rows during a merge, so it must be answered by primary key -- the value
+	* carried by the base row is exactly what the delta is replacing.
+	*/
+	overrides(row) {
+		if (this.#singleColumnKey === void 0 && !this.#firstKeyValues.has(row[this.#primaryKey[0]])) return false;
+		return this.#byKey.has(this.#key(row));
+	}
+	/**
+	* The batch's value for a row, by primary key. Returns `NOT_OVERRIDDEN` when
+	* the batch has not touched the key at all (so the caller should consult the
+	* base) and `undefined` when the batch removed it.
+	*/
+	get(row) {
+		const key = this.#key(row);
+		if (!this.#byKey.has(key)) return NOT_OVERRIDDEN;
+		return this.#byKey.get(key);
+	}
+	/**
+	* Looks a row up by an arbitrary (not necessarily primary) unique key. Only
+	* reachable when the delta is non-empty, which is never the case for the one
+	* caller that uses a non-primary key, so a walk is fine here.
+	*/
+	getByColumns(keyCols, keyRow) {
+		for (const row of this.#byKey.values()) if (row !== void 0 && keyCols.every((c) => row[c] === keyRow[c])) return row;
+	}
+	#addToIndexes(row) {
+		for (const data of this.#indexes.values()) data.add(row);
+	}
+	#removeFromIndexes(row) {
+		for (const data of this.#indexes.values()) data.delete(row);
+	}
+	#getOrCreateIndex(sort) {
+		const indexKey = JSON.stringify(sort);
+		let data = this.#indexes.get(indexKey);
+		if (data === void 0) {
+			data = new BTreeSet(makeBoundComparator(sort));
+			for (const row of this.#byKey.values()) if (row !== void 0) data.add(row);
+			this.#indexes.set(indexKey, data);
+			this.#indexBytes += 128 + estimateBytes(indexKey) + estimateBytes(sort);
+		}
+		return data;
+	}
+	/**
+	* The live rows this batch contributes to a fetch, in the same order the
+	* backing SQL query returns its rows, so the two streams can be merged.
+	*
+	* `constraint`, `multiConstraints` and `filterPredicate` are the ones SQL
+	* already applied to the base rows; they are applied here so the delta rows
+	* are subject to the same query. `start` is the fetch's start row: the scan
+	* begins there rather than at the start of the constraint span. It is
+	* inclusive, so the caller still applies an `after` basis.
+	*/
+	*rowsFor(sort, constraint, reverse, filterPredicate, multiConstraints, start) {
+		if (this.#liveCount === 0) return;
+		const indexSort = [];
+		if (constraint) for (const key of Object.keys(constraint)) indexSort.push([key, "asc"]);
+		const sorted = !constraint || !constraintMatchesPrimaryKey(constraint, this.#primaryKey);
+		if (sorted) indexSort.push(...sort);
+		const data = this.#getOrCreateIndex(indexSort);
+		let scanStart;
+		if (start !== void 0 && sorted && (!constraint || constraintMatchesRow(constraint, start))) scanStart = start;
+		else if (constraint) {
+			scanStart = {};
+			for (const [key, dir] of indexSort) if (hasOwn(constraint, key)) scanStart[key] = constraint[key];
+			else if (reverse) scanStart[key] = dir === "asc" ? maxValue : minValue;
+			else scanStart[key] = dir === "asc" ? minValue : maxValue;
+		}
+		for (const row of generateRows(data, scanStart, reverse)) {
+			if (constraint && !constraintMatchesRow(constraint, row)) break;
+			if (multiConstraints && !matchesMultiConstraints(row, multiConstraints)) continue;
+			if (filterPredicate && !filterPredicate(row)) continue;
+			yield row;
+		}
+	}
+	/**
+	* A row with the primary key of each row the batch has touched, removed
+	* rows included. A live row is returned as is.
+	*/
+	*touchedKeys() {
+		const single = this.#singleColumnKey;
+		for (const [key, row] of this.#byKey) if (row !== void 0) yield row;
+		else if (single !== void 0) yield { [single]: key };
+		else {
+			const values = JSON.parse(key);
+			yield Object.fromEntries(this.#primaryKey.map((k, i) => [k, values[i]]));
+		}
+	}
+	/** The rows the batch has added or edited, and not since removed. */
+	*liveRows() {
+		for (const row of this.#byKey.values()) if (row !== void 0) yield row;
+	}
+	/** Drops the batch. Called when the source moves to a snapshot that has it. */
+	clear() {
+		this.#byKey.clear();
+		this.#firstKeyValues.clear();
+		this.#indexes.clear();
+		this.#liveCount = 0;
+		this.#rowBytes = 0;
+		this.#indexBytes = 0;
+	}
+};
+function estimateBytes(value) {
+	if (typeof value === "string") return 24 + value.length * 2;
+	if (value === null || typeof value !== "object") return 8;
+	let bytes = 32;
+	if (Array.isArray(value)) for (const item of value) bytes += 8 + estimateBytes(item);
+	else for (const key in value) bytes += 16 + estimateBytes(key) + estimateBytes(value[key]);
+	return bytes;
+}
+var NOT_OVERRIDDEN = Symbol("not-overridden");
+function matchesMultiConstraints(row, multiConstraints) {
+	for (const mc of multiConstraints) {
+		if (mc.length === 0) continue;
+		let any = false;
+		for (const c of mc) if (constraintMatchesRow(c, row)) {
+			any = true;
+			break;
+		}
+		if (!any) return false;
+	}
+	return true;
+}
+/**
+* Merges a batch's rows into an ordered base stream and drops the base rows
+* the batch overrides.
+*
+* Both streams must already be in `compare` order. A delta row that ties with
+* a base row is the *same* row by primary key -- every fetch ordering includes
+* the primary key -- so the base copy is suppressed and the delta's value
+* takes its place at that position.
+*/
+function* generateWithPendingDelta(baseRows, deltaRows, delta, compare) {
+	const deltaIter = deltaRows[Symbol.iterator]();
+	let pending = deltaIter.next();
+	try {
+		for (const row of baseRows) {
+			while (!pending.done && compare(pending.value, row) < 0) {
+				yield pending.value;
+				pending = deltaIter.next();
+			}
+			if (!delta.overrides(row)) yield row;
+		}
+		while (!pending.done) {
+			yield pending.value;
+			pending = deltaIter.next();
+		}
+	} finally {
+		if (!pending.done) deltaIter.return?.(void 0);
+	}
+}
+/**
+* The unordered counterpart. Nothing downstream depends on position, so the
+* surviving base rows are emitted first and the batch's rows follow.
+*/
+function* generateWithPendingDeltaUnordered(baseRows, deltaRows, delta) {
+	for (const row of baseRows) if (!delta.overrides(row)) yield row;
+	yield* deltaRows;
+}
+//#endregion
+export { NOT_OVERRIDDEN, PendingDelta, generateWithPendingDelta, generateWithPendingDeltaUnordered };
+
+//# sourceMappingURL=pending-delta.js.map