@rocicorp/zero 1.11.0-canary.13 → 1.11.0-canary.14

package/out/zero-cache/src/services/view-syncer/deferred-writes-budget.d.ts

@@ -0,0 +1,81 @@
+/**
+ * The bytes assumed for each row held in memory, which converts the memory
+ * given to deferred writes into rows. The width of the rows an advancement
+ * will hold is not known before it starts.
+ */
+export declare const BYTES_PER_ROW = 1024;
+/**
+ * Bounds the memory that deferred IVM writes (see `deferIvmWrites`) use
+ * across the client groups of one syncer process.
+ *
+ * Each client group holds its own in-memory copy of the changes of the
+ * advancement it is processing, so the copies add up across the groups that
+ * advance at the same time. Before an advancement starts, its pipeline driver
+ * reserves the number of change log entries it advances through (of every
+ * table, since counting only the tables it reads would take a scan of the
+ * entries). That number bounds the rows its sources can hold: the change log
+ * has one entry per row key (a truncation, which does not, resets the
+ * pipelines instead), and a row displaced through a unique key must itself
+ * have changed in the same interval, so it has its own entry. (An entry that
+ * sets a row of a table whose primary key in the client schema is not the key
+ * the change log uses can change the row's primary key, which is two rows, so
+ * the driver reserves a second row for it as it gets to it.) An advancement that does
+ * not fit is written through to the replica snapshot instead, which SQLite
+ * bounds with its page cache and spills to disk.
+ *
+ * The rows are reserved at an assumed {@link BYTES_PER_ROW}, but their width
+ * is not known until they are held. So the advancements also add up the
+ * bytes they are estimated to hold as they go, and the one that takes the
+ * total past the budget writes what it holds through to the replica snapshot,
+ * and the rest of its changes after them.
+ *
+ * The budget is a share of the heap, so it does not depend on how many
+ * client groups are connected: when advancements do not overlap, each one
+ * can use all of it, and when many do, each gets less and the rest write
+ * through.
+ */
+export declare class DeferredWritesBudget {
+    #private;
+    /**
+     * A budget of `proportion` of the heap limit, and the rows that fit in it
+     * at {@link BYTES_PER_ROW}.
+     */
+    static forHeapProportion(proportion: number): DeferredWritesBudget;
+    /** A budget of `bytes`, and the rows that fit in it at {@link BYTES_PER_ROW}. */
+    static forBytes(bytes: number): DeferredWritesBudget;
+    constructor(maxRows: number, maxBytes: number);
+    get maxRows(): number;
+    get maxBytes(): number;
+    get reservedRows(): number;
+    /** The estimated bytes held by the advancements that hold rows. */
+    get heldBytes(): number;
+    /**
+     * Reserves `rows` if they fit in what is left of the budget, and returns
+     * whether they did. A successful reservation must be {@link release}d.
+     */
+    tryReserve(rows: number): boolean;
+    /**
+     * Reserves `rows` more for an advancement that is already holding rows, if
+     * they fit. An advancement reserves a row this way for each change log entry
+     * that can change the primary key of the row it sets, as it gets to it, and
+     * writes through if it does not fit. The rows are {@link release}d with the rest.
+     */
+    tryReserveMore(rows: number): boolean;
+    /**
+     * Adds `bytes` (fewer if negative) to the estimated bytes held by an
+     * advancement that has reserved rows, and returns whether the total is
+     * still within the budget. If it is not, the advancement is expected to
+     * stop holding rows and {@link release} them.
+     */
+    holdBytes(bytes: number): boolean;
+    /**
+     * The advancements that have held more rows than they reserved, which the
+     * reservation is supposed to rule out. Each writes through the rest of its
+     * changes instead.
+     */
+    get rowOverruns(): number;
+    recordRowOverrun(): void;
+    /** Returns an advancement's reserved `rows` and the `bytes` it held. */
+    release(rows: number, bytes: number): void;
+}
+//# sourceMappingURL=deferred-writes-budget.d.ts.map

package/out/zero-cache/src/services/view-syncer/deferred-writes-budget.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deferred-writes-budget.d.ts","sourceRoot":"","sources":["../../../../../../zero-cache/src/services/view-syncer/deferred-writes-budget.ts"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,eAAO,MAAM,aAAa,OAAO,CAAC;AAElC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,qBAAa,oBAAoB;;IAO/B;;;OAGG;IACH,MAAM,CAAC,iBAAiB,CAAC,UAAU,EAAE,MAAM,GAAG,oBAAoB,CAIjE;IAED,iFAAiF;IACjF,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,oBAAoB,CAEnD;IAED,YAAY,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAG5C;IAED,IAAI,OAAO,IAAI,MAAM,CAEpB;IAED,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED,mEAAmE;IACnE,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED;;;OAGG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEhC;IAED;;;;;OAKG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEpC;IAUD;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAIhC;IAED;;;;OAIG;IACH,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,gBAAgB,IAAI,IAAI,CAEvB;IAED,wEAAwE;IACxE,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAYzC;CACF"}

package/out/zero-cache/src/services/view-syncer/deferred-writes-budget.js

@@ -0,0 +1,128 @@
+import { assert } from "../../../../shared/src/asserts.js";
+import { getHeapStatistics } from "node:v8";
+//#region ../zero-cache/src/services/view-syncer/deferred-writes-budget.ts
+/**
+* The bytes assumed for each row held in memory, which converts the memory
+* given to deferred writes into rows. The width of the rows an advancement
+* will hold is not known before it starts.
+*/
+var BYTES_PER_ROW = 1024;
+/**
+* Bounds the memory that deferred IVM writes (see `deferIvmWrites`) use
+* across the client groups of one syncer process.
+*
+* Each client group holds its own in-memory copy of the changes of the
+* advancement it is processing, so the copies add up across the groups that
+* advance at the same time. Before an advancement starts, its pipeline driver
+* reserves the number of change log entries it advances through (of every
+* table, since counting only the tables it reads would take a scan of the
+* entries). That number bounds the rows its sources can hold: the change log
+* has one entry per row key (a truncation, which does not, resets the
+* pipelines instead), and a row displaced through a unique key must itself
+* have changed in the same interval, so it has its own entry. (An entry that
+* sets a row of a table whose primary key in the client schema is not the key
+* the change log uses can change the row's primary key, which is two rows, so
+* the driver reserves a second row for it as it gets to it.) An advancement that does
+* not fit is written through to the replica snapshot instead, which SQLite
+* bounds with its page cache and spills to disk.
+*
+* The rows are reserved at an assumed {@link BYTES_PER_ROW}, but their width
+* is not known until they are held. So the advancements also add up the
+* bytes they are estimated to hold as they go, and the one that takes the
+* total past the budget writes what it holds through to the replica snapshot,
+* and the rest of its changes after them.
+*
+* The budget is a share of the heap, so it does not depend on how many
+* client groups are connected: when advancements do not overlap, each one
+* can use all of it, and when many do, each gets less and the rest write
+* through.
+*/
+var DeferredWritesBudget = class DeferredWritesBudget {
+	#maxRows;
+	#maxBytes;
+	#reservedRows = 0;
+	#heldBytes = 0;
+	#rowOverruns = 0;
+	/**
+	* A budget of `proportion` of the heap limit, and the rows that fit in it
+	* at {@link BYTES_PER_ROW}.
+	*/
+	static forHeapProportion(proportion) {
+		return DeferredWritesBudget.forBytes(Math.floor(getHeapStatistics().heap_size_limit * proportion));
+	}
+	/** A budget of `bytes`, and the rows that fit in it at {@link BYTES_PER_ROW}. */
+	static forBytes(bytes) {
+		return new DeferredWritesBudget(Math.floor(bytes / BYTES_PER_ROW), bytes);
+	}
+	constructor(maxRows, maxBytes) {
+		this.#maxRows = maxRows;
+		this.#maxBytes = maxBytes;
+	}
+	get maxRows() {
+		return this.#maxRows;
+	}
+	get maxBytes() {
+		return this.#maxBytes;
+	}
+	get reservedRows() {
+		return this.#reservedRows;
+	}
+	/** The estimated bytes held by the advancements that hold rows. */
+	get heldBytes() {
+		return this.#heldBytes;
+	}
+	/**
+	* Reserves `rows` if they fit in what is left of the budget, and returns
+	* whether they did. A successful reservation must be {@link release}d.
+	*/
+	tryReserve(rows) {
+		return this.#tryReserve(rows);
+	}
+	/**
+	* Reserves `rows` more for an advancement that is already holding rows, if
+	* they fit. An advancement reserves a row this way for each change log entry
+	* that can change the primary key of the row it sets, as it gets to it, and
+	* writes through if it does not fit. The rows are {@link release}d with the rest.
+	*/
+	tryReserveMore(rows) {
+		return this.#tryReserve(rows);
+	}
+	#tryReserve(rows) {
+		if (this.#reservedRows + rows > this.#maxRows) return false;
+		this.#reservedRows += rows;
+		return true;
+	}
+	/**
+	* Adds `bytes` (fewer if negative) to the estimated bytes held by an
+	* advancement that has reserved rows, and returns whether the total is
+	* still within the budget. If it is not, the advancement is expected to
+	* stop holding rows and {@link release} them.
+	*/
+	holdBytes(bytes) {
+		this.#heldBytes += bytes;
+		assert(this.#heldBytes >= 0, () => `Holding ${this.#heldBytes} bytes`);
+		return this.#heldBytes <= this.#maxBytes;
+	}
+	/**
+	* The advancements that have held more rows than they reserved, which the
+	* reservation is supposed to rule out. Each writes through the rest of its
+	* changes instead.
+	*/
+	get rowOverruns() {
+		return this.#rowOverruns;
+	}
+	recordRowOverrun() {
+		this.#rowOverruns++;
+	}
+	/** Returns an advancement's reserved `rows` and the `bytes` it held. */
+	release(rows, bytes) {
+		assert(rows <= this.#reservedRows, () => `Releasing ${rows} rows but only ${this.#reservedRows} are reserved`);
+		assert(bytes <= this.#heldBytes, () => `Releasing ${bytes} bytes but only ${this.#heldBytes} are held`);
+		this.#reservedRows -= rows;
+		this.#heldBytes -= bytes;
+	}
+};
+//#endregion
+export { DeferredWritesBudget };
+
+//# sourceMappingURL=deferred-writes-budget.js.map

package/out/zero-cache/src/services/view-syncer/deferred-writes-budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deferred-writes-budget.js","names":["#maxRows","#maxBytes","#reservedRows","#heldBytes","#tryReserve","#rowOverruns"],"sources":["../../../../../../zero-cache/src/services/view-syncer/deferred-writes-budget.ts"],"sourcesContent":["import {getHeapStatistics} from 'node:v8';\nimport {assert} from '../../../../shared/src/asserts.ts';\n\n/**\n * The bytes assumed for each row held in memory, which converts the memory\n * given to deferred writes into rows. The width of the rows an advancement\n * will hold is not known before it starts.\n */\nexport const BYTES_PER_ROW = 1024;\n\n/**\n * Bounds the memory that deferred IVM writes (see `deferIvmWrites`) use\n * across the client groups of one syncer process.\n *\n * Each client group holds its own in-memory copy of the changes of the\n * advancement it is processing, so the copies add up across the groups that\n * advance at the same time. Before an advancement starts, its pipeline driver\n * reserves the number of change log entries it advances through (of every\n * table, since counting only the tables it reads would take a scan of the\n * entries). That number bounds the rows its sources can hold: the change log\n * has one entry per row key (a truncation, which does not, resets the\n * pipelines instead), and a row displaced through a unique key must itself\n * have changed in the same interval, so it has its own entry. (An entry that\n * sets a row of a table whose primary key in the client schema is not the key\n * the change log uses can change the row's primary key, which is two rows, so\n * the driver reserves a second row for it as it gets to it.) An advancement that does\n * not fit is written through to the replica snapshot instead, which SQLite\n * bounds with its page cache and spills to disk.\n *\n * The rows are reserved at an assumed {@link BYTES_PER_ROW}, but their width\n * is not known until they are held. So the advancements also add up the\n * bytes they are estimated to hold as they go, and the one that takes the\n * total past the budget writes what it holds through to the replica snapshot,\n * and the rest of its changes after them.\n *\n * The budget is a share of the heap, so it does not depend on how many\n * client groups are connected: when advancements do not overlap, each one\n * can use all of it, and when many do, each gets less and the rest write\n * through.\n */\nexport class DeferredWritesBudget {\n  readonly #maxRows: number;\n  readonly #maxBytes: number;\n  #reservedRows = 0;\n  #heldBytes = 0;\n  #rowOverruns = 0;\n\n  /**\n   * A budget of `proportion` of the heap limit, and the rows that fit in it\n   * at {@link BYTES_PER_ROW}.\n   */\n  static forHeapProportion(proportion: number): DeferredWritesBudget {\n    return DeferredWritesBudget.forBytes(\n      Math.floor(getHeapStatistics().heap_size_limit * proportion),\n    );\n  }\n\n  /** A budget of `bytes`, and the rows that fit in it at {@link BYTES_PER_ROW}. */\n  static forBytes(bytes: number): DeferredWritesBudget {\n    return new DeferredWritesBudget(Math.floor(bytes / BYTES_PER_ROW), bytes);\n  }\n\n  constructor(maxRows: number, maxBytes: number) {\n    this.#maxRows = maxRows;\n    this.#maxBytes = maxBytes;\n  }\n\n  get maxRows(): number {\n    return this.#maxRows;\n  }\n\n  get maxBytes(): number {\n    return this.#maxBytes;\n  }\n\n  get reservedRows(): number {\n    return this.#reservedRows;\n  }\n\n  /** The estimated bytes held by the advancements that hold rows. */\n  get heldBytes(): number {\n    return this.#heldBytes;\n  }\n\n  /**\n   * Reserves `rows` if they fit in what is left of the budget, and returns\n   * whether they did. A successful reservation must be {@link release}d.\n   */\n  tryReserve(rows: number): boolean {\n    return this.#tryReserve(rows);\n  }\n\n  /**\n   * Reserves `rows` more for an advancement that is already holding rows, if\n   * they fit. An advancement reserves a row this way for each change log entry\n   * that can change the primary key of the row it sets, as it gets to it, and\n   * writes through if it does not fit. The rows are {@link release}d with the rest.\n   */\n  tryReserveMore(rows: number): boolean {\n    return this.#tryReserve(rows);\n  }\n\n  #tryReserve(rows: number): boolean {\n    if (this.#reservedRows + rows > this.#maxRows) {\n      return false;\n    }\n    this.#reservedRows += rows;\n    return true;\n  }\n\n  /**\n   * Adds `bytes` (fewer if negative) to the estimated bytes held by an\n   * advancement that has reserved rows, and returns whether the total is\n   * still within the budget. If it is not, the advancement is expected to\n   * stop holding rows and {@link release} them.\n   */\n  holdBytes(bytes: number): boolean {\n    this.#heldBytes += bytes;\n    assert(this.#heldBytes >= 0, () => `Holding ${this.#heldBytes} bytes`);\n    return this.#heldBytes <= this.#maxBytes;\n  }\n\n  /**\n   * The advancements that have held more rows than they reserved, which the\n   * reservation is supposed to rule out. Each writes through the rest of its\n   * changes instead.\n   */\n  get rowOverruns(): number {\n    return this.#rowOverruns;\n  }\n\n  recordRowOverrun(): void {\n    this.#rowOverruns++;\n  }\n\n  /** Returns an advancement's reserved `rows` and the `bytes` it held. */\n  release(rows: number, bytes: number): void {\n    assert(\n      rows <= this.#reservedRows,\n      () =>\n        `Releasing ${rows} rows but only ${this.#reservedRows} are reserved`,\n    );\n    assert(\n      bytes <= this.#heldBytes,\n      () => `Releasing ${bytes} bytes but only ${this.#heldBytes} are held`,\n    );\n    this.#reservedRows -= rows;\n    this.#heldBytes -= bytes;\n  }\n}\n"],"mappings":";;;;;;;;AAQA,IAAa,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgC7B,IAAa,uBAAb,MAAa,qBAAqB;CAChC;CACA;CACA,gBAAgB;CAChB,aAAa;CACb,eAAe;;;;;CAMf,OAAO,kBAAkB,YAA0C;EACjE,OAAO,qBAAqB,SAC1B,KAAK,MAAM,kBAAkB,EAAE,kBAAkB,UAAU,CAC7D;CACF;;CAGA,OAAO,SAAS,OAAqC;EACnD,OAAO,IAAI,qBAAqB,KAAK,MAAM,QAAQ,aAAa,GAAG,KAAK;CAC1E;CAEA,YAAY,SAAiB,UAAkB;EAC7C,KAAKA,WAAW;EAChB,KAAKC,YAAY;CACnB;CAEA,IAAI,UAAkB;EACpB,OAAO,KAAKD;CACd;CAEA,IAAI,WAAmB;EACrB,OAAO,KAAKC;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKC;CACd;;CAGA,IAAI,YAAoB;EACtB,OAAO,KAAKC;CACd;;;;;CAMA,WAAW,MAAuB;EAChC,OAAO,KAAKC,YAAY,IAAI;CAC9B;;;;;;;CAQA,eAAe,MAAuB;EACpC,OAAO,KAAKA,YAAY,IAAI;CAC9B;CAEA,YAAY,MAAuB;EACjC,IAAI,KAAKF,gBAAgB,OAAO,KAAKF,UACnC,OAAO;EAET,KAAKE,iBAAiB;EACtB,OAAO;CACT;;;;;;;CAQA,UAAU,OAAwB;EAChC,KAAKC,cAAc;EACnB,OAAO,KAAKA,cAAc,SAAS,WAAW,KAAKA,WAAW,OAAO;EACrE,OAAO,KAAKA,cAAc,KAAKF;CACjC;;;;;;CAOA,IAAI,cAAsB;EACxB,OAAO,KAAKI;CACd;CAEA,mBAAyB;EACvB,KAAKA;CACP;;CAGA,QAAQ,MAAc,OAAqB;EACzC,OACE,QAAQ,KAAKH,qBAEX,aAAa,KAAK,iBAAiB,KAAKA,cAAc,cAC1D;EACA,OACE,SAAS,KAAKC,kBACR,aAAa,MAAM,kBAAkB,KAAKA,WAAW,UAC7D;EACA,KAAKD,iBAAiB;EACtB,KAAKC,cAAc;CACrB;AACF"}

package/out/zero-cache/src/services/view-syncer/inspect-handler.js

@@ -6,8 +6,8 @@ import { getServerVersion, isAdminPasswordValid } from "../../config/zero-config
 import { Database } from "../../../../zqlite/src/db.js";
 import { loadPermissions } from "../../auth/load-permissions.js";
 import { StatementRunner } from "../../db/statements.js";
-import { inspectAnalyzeQueryUpSchema } from "../../../../zero-protocol/src/inspect-up.js";
 import { _usingCtx } from "../../../../_virtual/_@oxc-project_runtime@0.130.0/helpers/usingCtx.js";
+import { inspectAnalyzeQueryUpSchema } from "../../../../zero-protocol/src/inspect-up.js";
 import { analyzeQuery } from "../analyze.js";
 //#region ../zero-cache/src/services/view-syncer/inspect-handler.ts
 async function handleInspect(lc, body, cvr, client, inspectorDelegate, clientGroupID, authOwner, cvrStore, config, ctx) {

package/out/zero-cache/src/services/view-syncer/pipeline-driver.d.ts

@@ -5,6 +5,7 @@ import type { Row } from '../../../../zero-protocol/src/data.ts';
 import type { PrimaryKey } from '../../../../zero-protocol/src/primary-key.ts';
 import { ChangeType } from '../../../../zql/src/ivm/change-type.ts';
 import { type Input } from '../../../../zql/src/ivm/operator.ts';
+import type { PlanWarning } from '../../../../zql/src/planner/planner-warnings.ts';
 import type { ClientGroupStorage } from '../../../../zqlite/src/database-storage.ts';
 import { type LoadedPermissions } from '../../auth/load-permissions.ts';
 import type { LogConfig, ZeroConfig } from '../../config/zero-config.ts';
@@ -12,6 +13,9 @@ import type { LiteAndZqlSpec } from '../../db/specs.ts';
 import type { InspectorDelegate } from '../../server/inspector-delegate.ts';
 import { type RowKey } from '../../types/row-key.ts';
 import { type ShardID } from '../../types/shards.ts';
+import type { DeferredWritesBudget } from './deferred-writes-budget.ts';
+import { type QueryShape } from './query-shape.ts';
+import type { QueryStats } from './query-stats.ts';
 import type { Snapshotter } from './snapshotter.ts';
 type RowOp<Op extends Omit<ChangeType, ChangeType.CHILD>> = {
     readonly type: Op;
@@ -30,6 +34,21 @@ export type QueryInfo = {
     readonly transformationHash: string;
     readonly queryName?: string | undefined;
 };
+export type HydrationStats = {
+    /** The rows the hydration output. */
+    readonly rowCount: number;
+    /**
+     * The rows the hydration read from the replica, including rows that were
+     * then filtered out, e.g. by a filter that could not be pushed to SQLite or
+     * by an EXISTS that did not match. Much greater than {@link rowCount} means
+     * the query does a lot of work for the rows it returns.
+     */
+    readonly rowsRead: number;
+    /** What the planner warned about the plan it chose for the query. */
+    readonly planWarnings: readonly PlanWarning[];
+    /** The {@link queryShape} of the query, computed when it was hydrated. */
+    readonly shape: QueryShape;
+};
 export type PipelineHydrationReason = 'query-set-sync' | 'unchanged-query-rehydrate';
 type PipelineStopReason = 'replace-query' | 'remove-query' | 'reset' | 'destroy';
 export type Timer = {
@@ -41,7 +60,7 @@ export type Timer = {
  */
 export declare class PipelineDriver {
     #private;
-    constructor(lc: LogContext, logConfig: LogConfig, snapshotter: Snapshotter, shardID: ShardID, storage: ClientGroupStorage, clientGroupID: string, inspectorDelegate: InspectorDelegate, yieldThresholdMs: () => number, enablePlanner?: boolean, config?: ZeroConfig);
+    constructor(lc: LogContext, logConfig: LogConfig, snapshotter: Snapshotter, shardID: ShardID, storage: ClientGroupStorage, clientGroupID: string, inspectorDelegate: InspectorDelegate, yieldThresholdMs: () => number, enablePlanner?: boolean, config?: ZeroConfig, deferredWrites?: DeferredWritesBudget, queryStats?: QueryStats | undefined);
     /**
      * Initializes the PipelineDriver to the current head of the database.
      * Queries can then be added (i.e. hydrated) with {@link addQuery()}.
@@ -91,7 +110,23 @@ export declare class PipelineDriver {
     destroy(): void;
     /** @return Map from query ID to PipelineInfo for all added queries. */
     queries(): ReadonlyMap<string, QueryInfo>;
+    /**
+     * Stats from the hydration of the pipeline for `queryID`, or `undefined` if
+     * the query has no pipeline.
+     */
+    hydrationStats(queryID: string): HydrationStats | undefined;
     totalHydrationTimeMs(): number;
+    /**
+     * The rows the sources hold in memory for the advancement in progress.
+     * The advancement's reservation from the {@link DeferredWritesBudget}
+     * bounds this.
+     */
+    get pendingRows(): number;
+    /**
+     * The estimated bytes of {@link pendingRows}, which are added to the
+     * {@link DeferredWritesBudget}'s held bytes as the advancement goes.
+     */
+    get pendingBytes(): number;
     /**
      * Adds a pipeline for the query. The method will hydrate the query using the
      * driver's current snapshot of the database and return a stream of results.

package/out/zero-cache/src/services/view-syncer/pipeline-driver.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pipeline-driver.d.ts","sourceRoot":"","sources":["../../../../../../zero-cache/src/services/view-syncer/pipeline-driver.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAMjD,OAAO,KAAK,EAAC,GAAG,EAAe,MAAM,sCAAsC,CAAC;AAC5E,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,gDAAgD,CAAC;AACjF,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,uCAAuC,CAAC;AAC/D,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,8CAA8C,CAAC;AAO7E,OAAO,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AAGlE,OAAO,EAIL,KAAK,KAAK,EAIX,MAAM,qCAAqC,CAAC;AAa7C,OAAO,KAAK,EAAC,kBAAkB,EAAC,MAAM,4CAA4C,CAAC;AASnF,OAAO,EAEL,KAAK,iBAAiB,EACvB,MAAM,gCAAgC,CAAC;AACxC,OAAO,KAAK,EAAC,SAAS,EAAE,UAAU,EAAC,MAAM,6BAA6B,CAAC;AAEvE,OAAO,KAAK,EAAC,cAAc,EAAgB,MAAM,mBAAmB,CAAC;AAKrE,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAC,KAAK,MAAM,EAAC,MAAM,wBAAwB,CAAC;AACnD,OAAO,EAAC,KAAK,OAAO,EAAC,MAAM,uBAAuB,CAAC;AAOnD,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,kBAAkB,CAAC;AAGlD,KAAK,KAAK,CAAC,EAAE,SAAS,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI;IAC1D,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;IAClB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;CACnB,CAAC;AAEF,MAAM,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AAE3C,MAAM,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;AAEjD,MAAM,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;AAE7C,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;AAsBrD,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,cAAc,EAAE,GAAG,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC;IACvC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACzC,CAAC;AAeF,MAAM,MAAM,uBAAuB,GAC/B,gBAAgB,GAChB,2BAA2B,CAAC;AAEhC,KAAK,kBAAkB,GACnB,eAAe,GACf,cAAc,GACd,OAAO,GACP,SAAS,CAAC;AA2Bd,MAAM,MAAM,KAAK,GAAG;IAClB,UAAU,EAAE,MAAM,MAAM,CAAC;IACzB,YAAY,EAAE,MAAM,MAAM,CAAC;CAC5B,CAAC;AAuFF;;GAEG;AACH,qBAAa,cAAc;;IA6CzB,YACE,EAAE,EAAE,UAAU,EACd,SAAS,EAAE,SAAS,EACpB,WAAW,EAAE,WAAW,EACxB,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,kBAAkB,EAC3B,aAAa,EAAE,MAAM,EACrB,iBAAiB,EAAE,iBAAiB,EACpC,gBAAgB,EAAE,MAAM,MAAM,EAC9B,aAAa,CAAC,EAAE,OAAO,EACvB,MAAM,CAAC,EAAE,UAAU,EAWpB;IAED;;;;;OAKG;IACH,IAAI,CAAC,YAAY,EAAE,YAAY,QAI9B;IAED;;OAEG;IACH,WAAW,IAAI,OAAO,CAErB;IAED;;;;OAIG;IACH,KAAK,CAAC,YAAY,EAAE,YAAY,QAS/B;IAiCD,mFAAmF;IACnF,IAAI,cAAc,IAAI,MAAM,CAE3B;IAED;;;;OAIG;IACH,cAAc,IAAI,MAAM,CAGvB;IAED;;OAEG;IACH,kBAAkB,IAAI,iBAAiB,GAAG,IAAI,CAiB7C;IAED;;;;;;;;;;;OAWG;IACH,kBAAkB,IAAI,MAAM,CAY3B;IAeD;;;OAGG;IACH,OAAO,SASN;IAED,uEAAuE;IACvE,OAAO,IAAI,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAExC;IAED,oBAAoB,IAAI,MAAM,CAM7B;IAsID;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CACN,kBAAkB,EAAE,MAAM,EAC1B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,GAAG,EACV,KAAK,EAAE,KAAK,EACZ,SAAS,CAAC,EAAE,MAAM,EAClB,eAAe,GAAE,uBAA0C,GAC1D,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAW/B;IA2PD;;;OAGG;IACH,WAAW,CACT,OAAO,EAAE,MAAM,EACf,UAAU,GAAE,kBAAmC,QAShD;IAiCD;;;;OAIG;IACH,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAEnD;IAyBD;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,GAAG,GAAG,SAAS,CAIjD;IAED;;;;;;;;;;OAUG;IACH,OAAO,CAAC,KAAK,EAAE,KAAK,GAAG;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,OAAO,EAAE,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC;KACxC,CAuBA;CAyUF;AA+QD;;;;GAIG;AACH,wBAAgB,OAAO,CACrB,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,YAAY,EAC1B,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GACtC,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAO/B;AAED,wBAAgB,eAAe,CAC7B,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EACpC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GACtC,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAQ/B"}
+{"version":3,"file":"pipeline-driver.d.ts","sourceRoot":"","sources":["../../../../../../zero-cache/src/services/view-syncer/pipeline-driver.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAMjD,OAAO,KAAK,EAAC,GAAG,EAAe,MAAM,sCAAsC,CAAC;AAC5E,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,gDAAgD,CAAC;AACjF,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,uCAAuC,CAAC;AAC/D,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,8CAA8C,CAAC;AAO7E,OAAO,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AAGlE,OAAO,EAIL,KAAK,KAAK,EAIX,MAAM,qCAAqC,CAAC;AAY7C,OAAO,KAAK,EACV,WAAW,EAEZ,MAAM,iDAAiD,CAAC;AAMzD,OAAO,KAAK,EAAC,kBAAkB,EAAC,MAAM,4CAA4C,CAAC;AASnF,OAAO,EAEL,KAAK,iBAAiB,EACvB,MAAM,gCAAgC,CAAC;AACxC,OAAO,KAAK,EAAC,SAAS,EAAE,UAAU,EAAC,MAAM,6BAA6B,CAAC;AAEvE,OAAO,KAAK,EAAC,cAAc,EAAgB,MAAM,mBAAmB,CAAC;AAMrE,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAC,KAAK,MAAM,EAAC,MAAM,wBAAwB,CAAC;AACnD,OAAO,EAAC,KAAK,OAAO,EAAC,MAAM,uBAAuB,CAAC;AAMnD,OAAO,KAAK,EAAC,oBAAoB,EAAC,MAAM,6BAA6B,CAAC;AAEtE,OAAO,EAAa,KAAK,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAC7D,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,kBAAkB,CAAC;AAGlD,KAAK,KAAK,CAAC,EAAE,SAAS,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI;IAC1D,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;IAClB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;CACnB,CAAC;AAEF,MAAM,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AAE3C,MAAM,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;AAEjD,MAAM,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;AAE7C,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;AA0BrD,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,cAAc,EAAE,GAAG,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC;IACvC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACzC,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,qCAAqC;IACrC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;;OAKG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,qEAAqE;IACrE,QAAQ,CAAC,YAAY,EAAE,SAAS,WAAW,EAAE,CAAC;IAC9C,0EAA0E;IAC1E,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;CAC5B,CAAC;AAeF,MAAM,MAAM,uBAAuB,GAC/B,gBAAgB,GAChB,2BAA2B,CAAC;AAEhC,KAAK,kBAAkB,GACnB,eAAe,GACf,cAAc,GACd,OAAO,GACP,SAAS,CAAC;AA4Dd,MAAM,MAAM,KAAK,GAAG;IAClB,UAAU,EAAE,MAAM,MAAM,CAAC;IACzB,YAAY,EAAE,MAAM,MAAM,CAAC;CAC5B,CAAC;AA+GF;;GAEG;AACH,qBAAa,cAAc;;IA0EzB,YACE,EAAE,EAAE,UAAU,EACd,SAAS,EAAE,SAAS,EACpB,WAAW,EAAE,WAAW,EACxB,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,kBAAkB,EAC3B,aAAa,EAAE,MAAM,EACrB,iBAAiB,EAAE,iBAAiB,EACpC,gBAAgB,EAAE,MAAM,MAAM,EAC9B,aAAa,CAAC,EAAE,OAAO,EACvB,MAAM,CAAC,EAAE,UAAU,EACnB,cAAc,CAAC,EAAE,oBAAoB,EACrC,UAAU,CAAC,EAAE,UAAU,GAAG,SAAS,EAqBpC;IAED;;;;;OAKG;IACH,IAAI,CAAC,YAAY,EAAE,YAAY,QAI9B;IAED;;OAEG;IACH,WAAW,IAAI,OAAO,CAErB;IAED;;;;OAIG;IACH,KAAK,CAAC,YAAY,EAAE,YAAY,QAS/B;IAiCD,mFAAmF;IACnF,IAAI,cAAc,IAAI,MAAM,CAE3B;IAED;;;;OAIG;IACH,cAAc,IAAI,MAAM,CAGvB;IAED;;OAEG;IACH,kBAAkB,IAAI,iBAAiB,GAAG,IAAI,CAiB7C;IAED;;;;;;;;;;;OAWG;IACH,kBAAkB,IAAI,MAAM,CAY3B;IAeD;;;OAGG;IACH,OAAO,SASN;IAED,uEAAuE;IACvE,OAAO,IAAI,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAExC;IAED;;;OAGG;IACH,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS,CAU1D;IA6CD,oBAAoB,IAAI,MAAM,CAM7B;IAED;;;;OAIG;IACH,IAAI,WAAW,IAAI,MAAM,CAMxB;IAED;;;OAGG;IACH,IAAI,YAAY,IAAI,MAAM,CAMzB;IA0ID;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CACN,kBAAkB,EAAE,MAAM,EAC1B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,GAAG,EACV,KAAK,EAAE,KAAK,EACZ,SAAS,CAAC,EAAE,MAAM,EAClB,eAAe,GAAE,uBAA0C,GAC1D,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAW/B;IAsSD;;;OAGG;IACH,WAAW,CACT,OAAO,EAAE,MAAM,EACf,UAAU,GAAE,kBAAmC,QAShD;IAiCD;;;;OAIG;IACH,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAEnD;IAyBD;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,GAAG,GAAG,SAAS,CAIjD;IAED;;;;;;;;;;OAUG;IACH,OAAO,CAAC,KAAK,EAAE,KAAK,GAAG;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,OAAO,EAAE,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC;KACxC,CAwBA;CAiqBF;AA2RD;;;;GAIG;AACH,wBAAgB,OAAO,CACrB,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,YAAY,EAC1B,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GACtC,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAO/B;AAED,wBAAgB,eAAe,CAC7B,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EACpC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GACtC,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,CAQ/B"}