@rocicorp/zero 0.0.0-202410031711

package/out/zql/src/zql/ivm/data.d.ts

@@ -0,0 +1,72 @@
+import type { Ordering } from '../ast/ast.js';
+import type { Stream } from './stream.js';
+/**
+ * The data types that Zero can represent are limited by two things:
+ *
+ * 1. The underlying Replicache sync layer currently can only represent JSON
+ *    types. This could possibly be expanded in the future, but we do want to be
+ *    careful of adding encoding overhead. By using JSON, we are taking
+ *    advantage of IndexedDB’s fast native JSValue [de]serialization which has
+ *    historically been a perf advantage for us.
+ *
+ * 2. IDs in Zero need to be comparable because we use them for sorting and row
+ *    identity. We could expand the set of allowed value types (to include,
+ *    i.e., Objects) but we would then need to restrict IDs to only comparable
+ *    types.
+ *
+ * These two facts leave us with the following allowed types. Zero's replication
+ * layer must convert other types into these for tables to be used with Zero.
+ *
+ * For developer convenience we also allow `undefined`, which we treat
+ * equivalently to `null`.
+ */
+export type Value = undefined | null | boolean | number | string;
+/**
+ * A Row is represented as a JS Object.
+ *
+ * We do everything in IVM as loosely typed values because these pipelines are
+ * going to be constructed at runtime by other code, so type-safety can't buy us
+ * anything.
+ *
+ * Also since the calling code on the client ultimately wants objects to work
+ * with we end up with a lot less copies by using objects throughout.
+ */
+export type Row = Record<string, Value>;
+/**
+ * A row flowing through the pipeline, plus its relationships.
+ * Relationships are generated lazily as read.
+ */
+export type Node = {
+    row: Row;
+    relationships: Record<string, Stream<Node>>;
+};
+/**
+ * Compare two values. The values must be of the same type. This function
+ * throws at runtime if the types differ.
+ *
+ * Note, this function considers `null === null` and
+ * `undefined === undefined`. This is different than SQL. In join code,
+ * null must be treated separately.
+ *
+ * See: https://github.com/rocicorp/mono/pull/2116/files#r1704811479
+ *
+ * @returns < 0 if a < b, 0 if a === b, > 0 if a > b
+ */
+export declare function compareValues(a: Value, b: Value): number;
+export type NormalizedValue = Exclude<Value, undefined>;
+/**
+ * We allow undefined to be passed for the convenience of developers, but we
+ * treat it equivalently to null. It's better for perf to not create an copy
+ * of input values, so we just normalize at use when necessary.
+ */
+export declare function normalizeUndefined(v: Value): NormalizedValue;
+export type Comparator = (r1: Row, r2: Row) => number;
+export declare function makeComparator(order: Ordering): Comparator;
+/**
+ * Determine if two values are equal. Note that unlike compareValues() above,
+ * this function treats `null` as unequal to itself (and same for `undefined`).
+ * This is required to make joins work correctly, but may not be the right
+ * semantic for your application.
+ */
+export declare function valuesEqual(a: Value, b: Value): boolean;
+//# sourceMappingURL=data.d.ts.map

package/out/zql/src/zql/ivm/data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/data.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,eAAe,CAAC;AAC5C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,KAAK,GAAG,SAAS,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;AAEjE;;;;;;;;;GASG;AACH,MAAM,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAExC;;;GAGG;AACH,MAAM,MAAM,IAAI,GAAG;IACjB,GAAG,EAAE,GAAG,CAAC;IACT,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7C,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAkCxD;AAED,MAAM,MAAM,eAAe,GAAG,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;AAExD;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,GAAG,eAAe,CAE5D;AAED,MAAM,MAAM,UAAU,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM,CAAC;AAEtD,wBAAgB,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,CAY1D;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,OAAO,CAOvD"}

package/out/zql/src/zql/ivm/data.js

@@ -0,0 +1,84 @@
+import { compareUTF8 } from 'compare-utf8';
+import { assertBoolean, assertNumber, assertString } from '../../../../shared/src/asserts.js';
+/**
+ * Compare two values. The values must be of the same type. This function
+ * throws at runtime if the types differ.
+ *
+ * Note, this function considers `null === null` and
+ * `undefined === undefined`. This is different than SQL. In join code,
+ * null must be treated separately.
+ *
+ * See: https://github.com/rocicorp/mono/pull/2116/files#r1704811479
+ *
+ * @returns < 0 if a < b, 0 if a === b, > 0 if a > b
+ */
+export function compareValues(a, b) {
+    a = normalizeUndefined(a);
+    b = normalizeUndefined(b);
+    if (a === b) {
+        return 0;
+    }
+    if (a === null) {
+        return -1;
+    }
+    if (b === null) {
+        return 1;
+    }
+    if (typeof a === 'boolean') {
+        assertBoolean(b);
+        return a ? 1 : -1;
+    }
+    if (typeof a === 'number') {
+        assertNumber(b);
+        return a - b;
+    }
+    if (typeof a === 'string') {
+        assertString(b);
+        // We compare all strings in Zero as UTF-8. This is the default on SQLite
+        // and we need to match it. See:
+        // https://blog.replicache.dev/blog/replicache-11-adventures-in-text-encoding.
+        //
+        // TODO: We could change this since SQLite supports UTF-16. Microbenchmark
+        // to see if there's a big win.
+        //
+        // https://www.sqlite.org/c3ref/create_collation.html
+        return compareUTF8(a, b);
+    }
+    throw new Error(`Unsupported type: ${a}`);
+}
+/**
+ * We allow undefined to be passed for the convenience of developers, but we
+ * treat it equivalently to null. It's better for perf to not create an copy
+ * of input values, so we just normalize at use when necessary.
+ */
+export function normalizeUndefined(v) {
+    return v ?? null;
+}
+export function makeComparator(order) {
+    return (a, b) => {
+        // Skip destructuring here since it is hot code.
+        for (const ord of order) {
+            const field = ord[0];
+            const comp = compareValues(a[field], b[field]);
+            if (comp !== 0) {
+                return ord[1] === 'asc' ? comp : -comp;
+            }
+        }
+        return 0;
+    };
+}
+/**
+ * Determine if two values are equal. Note that unlike compareValues() above,
+ * this function treats `null` as unequal to itself (and same for `undefined`).
+ * This is required to make joins work correctly, but may not be the right
+ * semantic for your application.
+ */
+export function valuesEqual(a, b) {
+    a = normalizeUndefined(a);
+    b = normalizeUndefined(b);
+    if (a === null || b === null) {
+        return false;
+    }
+    return a === b;
+}
+//# sourceMappingURL=data.js.map

package/out/zql/src/zql/ivm/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/data.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,WAAW,EAAC,MAAM,cAAc,CAAC;AACzC,OAAO,EAAC,aAAa,EAAE,YAAY,EAAE,YAAY,EAAC,MAAM,uBAAuB,CAAC;AA+ChF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,aAAa,CAAC,CAAQ,EAAE,CAAQ;IAC9C,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAE1B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,OAAO,CAAC,KAAK,SAAS,EAAE,CAAC;QAC3B,aAAa,CAAC,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC1B,YAAY,CAAC,CAAC,CAAC,CAAC;QAChB,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC1B,YAAY,CAAC,CAAC,CAAC,CAAC;QAChB,yEAAyE;QACzE,gCAAgC;QAChC,8EAA8E;QAC9E,EAAE;QACF,0EAA0E;QAC1E,+BAA+B;QAC/B,EAAE;QACF,qDAAqD;QACrD,OAAO,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;AAC5C,CAAC;AAID;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAQ;IACzC,OAAO,CAAC,IAAI,IAAI,CAAC;AACnB,CAAC;AAID,MAAM,UAAU,cAAc,CAAC,KAAe;IAC5C,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACd,gDAAgD;QAChD,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC/C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACf,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACzC,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,CAAQ,EAAE,CAAQ;IAC5C,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC"}

package/out/zql/src/zql/ivm/filter.d.ts

@@ -0,0 +1,27 @@
+import type { Change } from './change.js';
+import type { Node, Row } from './data.js';
+import type { FetchRequest, Input, Operator, Output } from './operator.js';
+import type { TableSchema } from './schema.js';
+import type { Stream } from './stream.js';
+/**
+ * Apply filter to all data flowing through, or just pushes. Pipeline builder
+ * can hoist some filters up to source, so it will tell Filter to apply only to
+ * pushes in that case.
+ */
+export type Mode = 'all' | 'push-only';
+/**
+ * The Filter operator filters data through a predicate. It is stateless.
+ *
+ * The predicate must be pure.
+ */
+export declare class Filter implements Operator {
+    #private;
+    constructor(input: Input, mode: Mode, predicate: (row: Row) => boolean);
+    setOutput(output: Output): void;
+    destroy(): void;
+    getSchema(): TableSchema;
+    fetch(req: FetchRequest): Generator<Node, void, unknown>;
+    cleanup(req: FetchRequest): Stream<Node>;
+    push(change: Change): void;
+}
+//# sourceMappingURL=filter.d.ts.map

package/out/zql/src/zql/ivm/filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/filter.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,KAAK,EAAC,IAAI,EAAE,GAAG,EAAC,MAAM,WAAW,CAAC;AAEzC,OAAO,KAAK,EAAC,YAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAC,MAAM,eAAe,CAAC;AACzE,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,aAAa,CAAC;AAC7C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC;;;;GAIG;AACH,MAAM,MAAM,IAAI,GAAG,KAAK,GAAG,WAAW,CAAC;AAEvC;;;;GAIG;AACH,qBAAa,MAAO,YAAW,QAAQ;;gBAOzB,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO;IAOtE,SAAS,CAAC,MAAM,EAAE,MAAM;IAIxB,OAAO,IAAI,IAAI;IAIf,SAAS,IAAI,WAAW;IAIvB,KAAK,CAAC,GAAG,EAAE,YAAY;IAQxB,OAAO,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC;IAIxC,IAAI,CAAC,MAAM,EAAE,MAAM;CAsBpB"}

package/out/zql/src/zql/ivm/filter.js

@@ -0,0 +1,60 @@
+import { assert, unreachable } from '../../../../shared/src/asserts.js';
+import { maybeSplitAndPushEditChange } from './maybe-split-and-push-edit-change.js';
+/**
+ * The Filter operator filters data through a predicate. It is stateless.
+ *
+ * The predicate must be pure.
+ */
+export class Filter {
+    #input;
+    #mode;
+    #predicate;
+    #output;
+    constructor(input, mode, predicate) {
+        this.#input = input;
+        this.#mode = mode;
+        this.#predicate = predicate;
+        this.#input.setOutput(this);
+    }
+    setOutput(output) {
+        this.#output = output;
+    }
+    destroy() {
+        this.#input.destroy();
+    }
+    getSchema() {
+        return this.#input.getSchema();
+    }
+    *fetch(req) {
+        for (const node of this.#input.fetch(req)) {
+            if (this.#mode === 'push-only' || this.#predicate(node.row)) {
+                yield node;
+            }
+        }
+    }
+    cleanup(req) {
+        return this.fetch(req);
+    }
+    push(change) {
+        assert(this.#output, 'Output not set');
+        switch (change.type) {
+            case 'add':
+            case 'remove':
+                if (this.#predicate(change.node.row)) {
+                    this.#output.push(change);
+                }
+                break;
+            case 'child':
+                if (this.#predicate(change.row)) {
+                    this.#output.push(change);
+                }
+                break;
+            case 'edit':
+                maybeSplitAndPushEditChange(change, this.#predicate, this.#output);
+                break;
+            default:
+                unreachable(change);
+        }
+    }
+}
+//# sourceMappingURL=filter.js.map

package/out/zql/src/zql/ivm/filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.js","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/filter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAE,WAAW,EAAC,MAAM,uBAAuB,CAAC;AAG1D,OAAO,EAAC,2BAA2B,EAAC,MAAM,uCAAuC,CAAC;AAYlF;;;;GAIG;AACH,MAAM,OAAO,MAAM;IACR,MAAM,CAAQ;IACd,KAAK,CAAO;IACZ,UAAU,CAAwB;IAE3C,OAAO,CAAqB;IAE5B,YAAY,KAAY,EAAE,IAAU,EAAE,SAAgC;QACpE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,SAAS,CAAC,MAAc;QACtB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED,OAAO;QACL,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;IACjC,CAAC;IAED,CAAC,KAAK,CAAC,GAAiB;QACtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,KAAK,KAAK,WAAW,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5D,MAAM,IAAI,CAAC;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAiB;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,CAAC,MAAc;QACjB,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAEvC,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,KAAK,CAAC;YACX,KAAK,QAAQ;gBACX,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC5B,CAAC;gBACD,MAAM;YACR,KAAK,OAAO;gBACV,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAChC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC5B,CAAC;gBACD,MAAM;YACR,KAAK,MAAM;gBACT,2BAA2B,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnE,MAAM;YACR;gBACE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;CACF"}

package/out/zql/src/zql/ivm/join.d.ts

@@ -0,0 +1,37 @@
+import { type Node, type NormalizedValue } from './data.js';
+import type { FetchRequest, Input, Output, Storage } from './operator.js';
+import type { TableSchema } from './schema.js';
+import { type Stream } from './stream.js';
+type Args = {
+    parent: Input;
+    child: Input;
+    storage: Storage;
+    parentKey: string;
+    childKey: string;
+    relationshipName: string;
+    hidden: boolean;
+};
+/**
+ * The Join operator joins the output from two upstream inputs. Zero's join
+ * is a little different from SQL's join in that we output hierarchical data,
+ * not a flat table. This makes it a lot more useful for UI programming and
+ * avoids duplicating tons of data like left join would.
+ *
+ * The Nodes output from Join have a new relationship added to them, which has
+ * the name #relationshipName. The value of the relationship is a stream of
+ * child nodes which are the corresponding values from the child source.
+ */
+export declare class Join implements Input {
+    #private;
+    constructor({ parent, child, storage, parentKey, childKey, relationshipName, hidden, }: Args);
+    destroy(): void;
+    setOutput(output: Output): void;
+    getSchema(): TableSchema;
+    fetch(req: FetchRequest): Stream<Node>;
+    cleanup(req: FetchRequest): Stream<Node>;
+}
+/** Exported for testing. */
+export declare function createPrimaryKeySetStorageKey(values: NormalizedValue[]): string;
+export declare function createPrimaryKeySetStorageKeyPrefix(value: NormalizedValue): string;
+export {};
+//# sourceMappingURL=join.d.ts.map

package/out/zql/src/zql/ivm/join.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"join.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/join.ts"],"names":[],"mappings":"AAGA,OAAO,EAEL,KAAK,IAAI,EACT,KAAK,eAAe,EAErB,MAAM,WAAW,CAAC;AACnB,OAAO,KAAK,EAAC,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAC,MAAM,eAAe,CAAC;AACxE,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAc,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AAErD,KAAK,IAAI,GAAG;IACV,MAAM,EAAE,KAAK,CAAC;IACd,KAAK,EAAE,KAAK,CAAC;IACb,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,EAAE,MAAM,CAAC;IACzB,MAAM,EAAE,OAAO,CAAC;CACjB,CAAC;AACF;;;;;;;;;GASG;AACH,qBAAa,IAAK,YAAW,KAAK;;gBAWpB,EACV,MAAM,EACN,KAAK,EACL,OAAO,EACP,SAAS,EACT,QAAQ,EACR,gBAAgB,EAChB,MAAM,GACP,EAAE,IAAI;IA6BP,OAAO,IAAI,IAAI;IAKf,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAI/B,SAAS,IAAI,WAAW;IAIvB,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC;IAUtC,OAAO,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC;CAkM1C;AAID,4BAA4B;AAC5B,wBAAgB,6BAA6B,CAC3C,MAAM,EAAE,eAAe,EAAE,GACxB,MAAM,CAGR;AAED,wBAAgB,mCAAmC,CACjD,KAAK,EAAE,eAAe,GACrB,MAAM,CAER"}

package/out/zql/src/zql/ivm/join.js

@@ -0,0 +1,228 @@
+import { assert, unreachable } from '../../../../shared/src/asserts.js';
+import { must } from '../../../../shared/src/must.js';
+import { normalizeUndefined, } from './data.js';
+import { first, take } from './stream.js';
+/**
+ * The Join operator joins the output from two upstream inputs. Zero's join
+ * is a little different from SQL's join in that we output hierarchical data,
+ * not a flat table. This makes it a lot more useful for UI programming and
+ * avoids duplicating tons of data like left join would.
+ *
+ * The Nodes output from Join have a new relationship added to them, which has
+ * the name #relationshipName. The value of the relationship is a stream of
+ * child nodes which are the corresponding values from the child source.
+ */
+export class Join {
+    #parent;
+    #child;
+    #storage;
+    #parentKey;
+    #childKey;
+    #relationshipName;
+    #schema;
+    #output = null;
+    constructor({ parent, child, storage, parentKey, childKey, relationshipName, hidden, }) {
+        assert(parent !== child, 'Parent and child must be different operators');
+        this.#parent = parent;
+        this.#child = child;
+        this.#storage = storage;
+        this.#parentKey = parentKey;
+        this.#childKey = childKey;
+        this.#relationshipName = relationshipName;
+        const parentSchema = parent.getSchema();
+        const childSchema = child.getSchema();
+        this.#schema = {
+            ...parentSchema,
+            isHidden: hidden,
+            relationships: {
+                ...parentSchema.relationships,
+                [relationshipName]: childSchema,
+            },
+        };
+        parent.setOutput({
+            push: (change) => this.#pushParent(change),
+        });
+        child.setOutput({
+            push: (change) => this.#pushChild(change),
+        });
+    }
+    destroy() {
+        this.#parent.destroy();
+        this.#child.destroy();
+    }
+    setOutput(output) {
+        this.#output = output;
+    }
+    getSchema() {
+        return this.#schema;
+    }
+    *fetch(req) {
+        for (const parentNode of this.#parent.fetch(req)) {
+            yield this.#processParentNode(parentNode.row, parentNode.relationships, 'fetch');
+        }
+    }
+    *cleanup(req) {
+        for (const parentNode of this.#parent.cleanup(req)) {
+            yield this.#processParentNode(parentNode.row, parentNode.relationships, 'cleanup');
+        }
+    }
+    #pushParent(change) {
+        assert(this.#output, 'Output not set');
+        switch (change.type) {
+            case 'add':
+                this.#output.push({
+                    type: 'add',
+                    node: this.#processParentNode(change.node.row, change.node.relationships, 'fetch'),
+                });
+                break;
+            case 'remove':
+                this.#output.push({
+                    type: 'remove',
+                    node: this.#processParentNode(change.node.row, change.node.relationships, 'cleanup'),
+                });
+                break;
+            case 'child':
+                this.#output.push(change);
+                break;
+            case 'edit':
+                // If the join key value didn't change we push the change down
+                if (normalizeUndefined(change.row[this.#parentKey]) ===
+                    normalizeUndefined(change.oldRow[this.#parentKey])) {
+                    this.#output.push(change);
+                }
+                else {
+                    // The join key value changed so we treat this as a remove followed by
+                    // an add.
+                    this.#output.push({
+                        type: 'remove',
+                        node: this.#processParentNode(change.oldRow, {}, 'cleanup'),
+                    });
+                    this.#output.push({
+                        type: 'add',
+                        node: this.#processParentNode(change.row, {}, 'fetch'),
+                    });
+                }
+                break;
+            default:
+                unreachable(change);
+        }
+    }
+    #pushChild(change) {
+        const pushChildChange = (childRow, change) => {
+            assert(this.#output, 'Output not set');
+            const parentNodes = this.#parent.fetch({
+                constraint: {
+                    key: this.#parentKey,
+                    value: childRow[this.#childKey],
+                },
+            });
+            for (const parentNode of parentNodes) {
+                const childChange = {
+                    type: 'child',
+                    row: parentNode.row,
+                    child: {
+                        relationshipName: this.#relationshipName,
+                        change,
+                    },
+                };
+                this.#output.push(childChange);
+            }
+        };
+        switch (change.type) {
+            case 'add':
+            case 'remove':
+                pushChildChange(change.node.row, change);
+                break;
+            case 'child':
+                pushChildChange(change.row, change);
+                break;
+            case 'edit': {
+                const childRow = change.row;
+                const oldChildRow = change.oldRow;
+                if (normalizeUndefined(oldChildRow[this.#childKey]) ===
+                    normalizeUndefined(childRow[this.#childKey])) {
+                    // The child row was edited in a way that does not change the relationship.
+                    // We can therefore just push the change down (wrapped in a child change).
+                    pushChildChange(childRow, change);
+                }
+                else {
+                    // The child row was edited in a way that changes the relationship. We
+                    // therefore treat this as a remove from the old row followed by an
+                    // add to the new row.
+                    const { relationships } = must(first(this.#child.fetch({
+                        constraint: {
+                            key: this.#childKey,
+                            value: oldChildRow[this.#childKey],
+                        },
+                    })));
+                    pushChildChange(oldChildRow, {
+                        type: 'remove',
+                        node: {
+                            row: oldChildRow,
+                            relationships,
+                        },
+                    });
+                    pushChildChange(childRow, {
+                        type: 'add',
+                        node: {
+                            row: childRow,
+                            relationships,
+                        },
+                    });
+                }
+                break;
+            }
+            default:
+                unreachable(change);
+        }
+    }
+    #processParentNode(parentNodeRow, parentNodeRelations, mode) {
+        const parentKeyValue = normalizeUndefined(parentNodeRow[this.#parentKey]);
+        const parentPrimaryKey = [];
+        for (const key of this.#parent.getSchema().primaryKey) {
+            parentPrimaryKey.push(normalizeUndefined(parentNodeRow[key]));
+        }
+        // This storage key tracks the primary keys seen for each unique
+        // value joined on. This is used to know when to cleanup a child's state.
+        const storageKey = createPrimaryKeySetStorageKey([
+            parentKeyValue,
+            ...parentPrimaryKey,
+        ]);
+        let method = mode;
+        if (mode === 'cleanup') {
+            const [, second] = take(this.#storage.scan({
+                prefix: createPrimaryKeySetStorageKeyPrefix(parentKeyValue),
+            }), 2);
+            method = second ? 'fetch' : 'cleanup';
+        }
+        const childStream = this.#child[method]({
+            constraint: {
+                key: this.#childKey,
+                value: parentKeyValue,
+            },
+        });
+        if (mode === 'fetch') {
+            this.#storage.set(storageKey, true);
+        }
+        else {
+            mode;
+            this.#storage.del(storageKey);
+        }
+        return {
+            row: parentNodeRow,
+            relationships: {
+                ...parentNodeRelations,
+                [this.#relationshipName]: childStream,
+            },
+        };
+    }
+}
+/** Exported for testing. */
+export function createPrimaryKeySetStorageKey(values) {
+    const json = JSON.stringify(['pKeySet', ...values]);
+    return json.substring(1, json.length - 1) + ',';
+}
+export function createPrimaryKeySetStorageKeyPrefix(value) {
+    return createPrimaryKeySetStorageKey([value]);
+}
+//# sourceMappingURL=join.js.map

package/out/zql/src/zql/ivm/join.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"join.js","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/join.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAE,WAAW,EAAC,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAC,IAAI,EAAC,MAAM,oBAAoB,CAAC;AAExC,OAAO,EACL,kBAAkB,GAInB,MAAM,WAAW,CAAC;AAGnB,OAAO,EAAC,KAAK,EAAE,IAAI,EAAc,MAAM,aAAa,CAAC;AAWrD;;;;;;;;;GASG;AACH,MAAM,OAAO,IAAI;IACN,OAAO,CAAQ;IACf,MAAM,CAAQ;IACd,QAAQ,CAAU;IAClB,UAAU,CAAS;IACnB,SAAS,CAAS;IAClB,iBAAiB,CAAS;IAC1B,OAAO,CAAc;IAE9B,OAAO,GAAkB,IAAI,CAAC;IAE9B,YAAY,EACV,MAAM,EACN,KAAK,EACL,OAAO,EACP,SAAS,EACT,QAAQ,EACR,gBAAgB,EAChB,MAAM,GACD;QACL,MAAM,CAAC,MAAM,KAAK,KAAK,EAAE,8CAA8C,CAAC,CAAC;QAEzE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;QAE1C,MAAM,YAAY,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,WAAW,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QACtC,IAAI,CAAC,OAAO,GAAG;YACb,GAAG,YAAY;YACf,QAAQ,EAAE,MAAM;YAChB,aAAa,EAAE;gBACb,GAAG,YAAY,CAAC,aAAa;gBAC7B,CAAC,gBAAgB,CAAC,EAAE,WAAW;aAChC;SACF,CAAC;QAEF,MAAM,CAAC,SAAS,CAAC;YACf,IAAI,EAAE,CAAC,MAAc,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;SACnD,CAAC,CAAC;QACH,KAAK,CAAC,SAAS,CAAC;YACd,IAAI,EAAE,CAAC,MAAc,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;SAClD,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED,SAAS,CAAC,MAAc;QACtB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,CAAC,KAAK,CAAC,GAAiB;QACtB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACjD,MAAM,IAAI,CAAC,kBAAkB,CAC3B,UAAU,CAAC,GAAG,EACd,UAAU,CAAC,aAAa,EACxB,OAAO,CACR,CAAC;QACJ,CAAC;IACH,CAAC;IAED,CAAC,OAAO,CAAC,GAAiB;QACxB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,CAAC,kBAAkB,CAC3B,UAAU,CAAC,GAAG,EACd,UAAU,CAAC,aAAa,EACxB,SAAS,CACV,CAAC;QACJ,CAAC;IACH,CAAC;IAED,WAAW,CAAC,MAAc;QACxB,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAEvC,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,KAAK;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;oBAChB,IAAI,EAAE,KAAK;oBACX,IAAI,EAAE,IAAI,CAAC,kBAAkB,CAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,IAAI,CAAC,aAAa,EACzB,OAAO,CACR;iBACF,CAAC,CAAC;gBACH,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;oBAChB,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,IAAI,CAAC,kBAAkB,CAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,IAAI,CAAC,aAAa,EACzB,SAAS,CACV;iBACF,CAAC,CAAC;gBACH,MAAM;YACR,KAAK,OAAO;gBACV,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM;YACR,KAAK,MAAM;gBACT,8DAA8D;gBAC9D,IACE,kBAAkB,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC/C,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAClD,CAAC;oBACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC5B,CAAC;qBAAM,CAAC;oBACN,sEAAsE;oBACtE,UAAU;oBACV,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;wBAChB,IAAI,EAAE,QAAQ;wBACd,IAAI,EAAE,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,SAAS,CAAC;qBAC5D,CAAC,CAAC;oBACH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;wBAChB,IAAI,EAAE,KAAK;wBACX,IAAI,EAAE,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,CAAC;qBACvD,CAAC,CAAC;gBACL,CAAC;gBACD,MAAM;YACR;gBACE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,UAAU,CAAC,MAAc;QACvB,MAAM,eAAe,GAAG,CAAC,QAAa,EAAE,MAAc,EAAE,EAAE;YACxD,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;YAEvC,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;gBACrC,UAAU,EAAE;oBACV,GAAG,EAAE,IAAI,CAAC,UAAU;oBACpB,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC;iBAChC;aACF,CAAC,CAAC;YAEH,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,WAAW,GAAgB;oBAC/B,IAAI,EAAE,OAAO;oBACb,GAAG,EAAE,UAAU,CAAC,GAAG;oBACnB,KAAK,EAAE;wBACL,gBAAgB,EAAE,IAAI,CAAC,iBAAiB;wBACxC,MAAM;qBACP;iBACF,CAAC;gBACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,KAAK,CAAC;YACX,KAAK,QAAQ;gBACX,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBACzC,MAAM;YACR,KAAK,OAAO;gBACV,eAAe,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM;YACR,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC;gBAC5B,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;gBAClC,IACE,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAC/C,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAC5C,CAAC;oBACD,2EAA2E;oBAC3E,0EAA0E;oBAC1E,eAAe,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACN,sEAAsE;oBACtE,mEAAmE;oBACnE,sBAAsB;oBAEtB,MAAM,EAAC,aAAa,EAAC,GAAG,IAAI,CAC1B,KAAK,CACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;wBAChB,UAAU,EAAE;4BACV,GAAG,EAAE,IAAI,CAAC,SAAS;4BACnB,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC;yBACnC;qBACF,CAAC,CACH,CACF,CAAC;oBAEF,eAAe,CAAC,WAAW,EAAE;wBAC3B,IAAI,EAAE,QAAQ;wBACd,IAAI,EAAE;4BACJ,GAAG,EAAE,WAAW;4BAChB,aAAa;yBACd;qBACF,CAAC,CAAC;oBACH,eAAe,CAAC,QAAQ,EAAE;wBACxB,IAAI,EAAE,KAAK;wBACX,IAAI,EAAE;4BACJ,GAAG,EAAE,QAAQ;4BACb,aAAa;yBACd;qBACF,CAAC,CAAC;gBACL,CAAC;gBACD,MAAM;YACR,CAAC;YAED;gBACE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,kBAAkB,CAChB,aAAkB,EAClB,mBAAiD,EACjD,IAAuB;QAEvB,MAAM,cAAc,GAAG,kBAAkB,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC1E,MAAM,gBAAgB,GAAsB,EAAE,CAAC;QAC/C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,UAAU,EAAE,CAAC;YACtD,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,gEAAgE;QAChE,yEAAyE;QACzE,MAAM,UAAU,GAAW,6BAA6B,CAAC;YACvD,cAAc;YACd,GAAG,gBAAgB;SACpB,CAAC,CAAC;QAEH,IAAI,MAAM,GAAsB,IAAI,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,CAAC,EAAE,MAAM,CAAC,GAAG,IAAI,CACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACjB,MAAM,EAAE,mCAAmC,CAAC,cAAc,CAAC;aAC5D,CAAC,EACF,CAAC,CACF,CAAC;YACF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;QACxC,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtC,UAAU,EAAE;gBACV,GAAG,EAAE,IAAI,CAAC,SAAS;gBACnB,KAAK,EAAE,cAAc;aACtB;SACF,CAAC,CAAC;QAEH,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,IAAwB,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAChC,CAAC;QAED,OAAO;YACL,GAAG,EAAE,aAAa;YAClB,aAAa,EAAE;gBACb,GAAG,mBAAmB;gBACtB,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,WAAW;aACtC;SACF,CAAC;IACJ,CAAC;CACF;AAID,4BAA4B;AAC5B,MAAM,UAAU,6BAA6B,CAC3C,MAAyB;IAEzB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;IACpD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,mCAAmC,CACjD,KAAsB;IAEtB,OAAO,6BAA6B,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAChD,CAAC"}

package/out/zql/src/zql/ivm/lookahead-iterator.d.ts

@@ -0,0 +1,13 @@
+/**
+ * A LookaheadIterator is an iterator that reads ahead one value eagerly and
+ * provides access to both the current and next value without having to advance.
+ */
+export declare class LookaheadIterator<T> implements Iterator<[T, ...Array<T | undefined>]> {
+    #private;
+    constructor(iter: Iterator<T>, size?: number);
+    [Symbol.iterator](): Iterator<[T, ...Array<T | undefined>]>;
+    next(): IteratorResult<[T, ...Array<T | undefined>]>;
+    return(value?: unknown): IteratorResult<[T, ...(T | undefined)[]], unknown>;
+    throw(e?: unknown): IteratorResult<[T, ...(T | undefined)[]], unknown>;
+}
+//# sourceMappingURL=lookahead-iterator.d.ts.map

package/out/zql/src/zql/ivm/lookahead-iterator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lookahead-iterator.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/lookahead-iterator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,qBAAa,iBAAiB,CAAC,CAAC,CAC9B,YAAW,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;;gBAOrC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,MAAU;IAK/C,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IAI3D,IAAI,IAAI,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IAuBpD,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;IAK3E,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;CAIvE"}

package/out/zql/src/zql/ivm/lookahead-iterator.js

@@ -0,0 +1,45 @@
+/**
+ * A LookaheadIterator is an iterator that reads ahead one value eagerly and
+ * provides access to both the current and next value without having to advance.
+ */
+export class LookaheadIterator {
+    #iter;
+    #buffer;
+    #initialized = false;
+    constructor(iter, size = 2) {
+        this.#iter = iter;
+        this.#buffer = new Array(size);
+    }
+    [Symbol.iterator]() {
+        return this;
+    }
+    next() {
+        if (!this.#initialized) {
+            for (let i = 0; i < this.#buffer.length; i++) {
+                const r = this.#iter.next();
+                this.#buffer[i] = r.done ? undefined : r.value;
+            }
+            this.#initialized = true;
+        }
+        else {
+            for (let i = 0; i < this.#buffer.length - 1; i++) {
+                this.#buffer[i] = this.#buffer[i + 1];
+            }
+            const r = this.#iter.next();
+            this.#buffer[this.#buffer.length - 1] = r.done ? undefined : r.value;
+        }
+        if (this.#buffer[0] === undefined) {
+            return { done: true, value: undefined };
+        }
+        return { done: false, value: this.#buffer };
+    }
+    return(value) {
+        this.#iter.return?.(value);
+        return { done: true, value: undefined };
+    }
+    throw(e) {
+        this.#iter.throw?.(e);
+        return { done: true, value: undefined };
+    }
+}
+//# sourceMappingURL=lookahead-iterator.js.map

package/out/zql/src/zql/ivm/lookahead-iterator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lookahead-iterator.js","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/lookahead-iterator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IAGnB,KAAK,CAAc;IACnB,OAAO,CAAuB;IAEvC,YAAY,GAAG,KAAK,CAAC;IAErB,YAAY,IAAiB,EAAE,OAAe,CAAC;QAC7C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI;QACF,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACjD,CAAC;YACD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACvE,CAAC;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAClC,OAAO,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAC,CAAC;QACxC,CAAC;QACD,OAAO,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,EAEvC,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,KAAe;QACpB,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC;QAC3B,OAAO,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,CAAW;QACf,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACtB,OAAO,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAC,CAAC;IACxC,CAAC;CACF"}

package/out/zql/src/zql/ivm/maybe-split-and-push-edit-change.d.ts

@@ -0,0 +1,10 @@
+import type { EditChange } from './change.js';
+import type { Row } from './data.js';
+import type { Output } from './operator.js';
+/**
+ * This takes an {@linkcode EditChange} and a predicate that determines if a row
+ * should be present based on the row's data. It then splits the change and
+ * pushes the appropriate changes to the output based on the predicate.
+ */
+export declare function maybeSplitAndPushEditChange(change: EditChange, predicate: (row: Row) => boolean, output: Output): void;
+//# sourceMappingURL=maybe-split-and-push-edit-change.d.ts.map

package/out/zql/src/zql/ivm/maybe-split-and-push-edit-change.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"maybe-split-and-push-edit-change.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/maybe-split-and-push-edit-change.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,aAAa,CAAC;AAC5C,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,WAAW,CAAC;AACnC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,eAAe,CAAC;AAE1C;;;;GAIG;AACH,wBAAgB,2BAA2B,CACzC,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,EAChC,MAAM,EAAE,MAAM,QA2Bf"}