@rocicorp/zero 0.0.0-202410031711

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

@@ -0,0 +1,34 @@
+/**
+ * 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 function maybeSplitAndPushEditChange(change, predicate, output) {
+    const oldWasPresent = predicate(change.oldRow);
+    const newIsPresent = predicate(change.row);
+    if (oldWasPresent && newIsPresent) {
+        output.push(change);
+    }
+    else if (oldWasPresent && !newIsPresent) {
+        // The relationships are empty at this point and that is fine since
+        // splitAndPushEditChange is only used by operators that are before the Join
+        // operator.
+        output.push({
+            type: 'remove',
+            node: {
+                row: change.oldRow,
+                relationships: {},
+            },
+        });
+    }
+    else if (!oldWasPresent && newIsPresent) {
+        output.push({
+            type: 'add',
+            node: {
+                row: change.row,
+                relationships: {},
+            },
+        });
+    }
+}
+//# sourceMappingURL=maybe-split-and-push-edit-change.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"maybe-split-and-push-edit-change.js","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/maybe-split-and-push-edit-change.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CACzC,MAAkB,EAClB,SAAgC,EAChC,MAAc;IAEd,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/C,MAAM,YAAY,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAE3C,IAAI,aAAa,IAAI,YAAY,EAAE,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;SAAM,IAAI,aAAa,IAAI,CAAC,YAAY,EAAE,CAAC;QAC1C,mEAAmE;QACnE,4EAA4E;QAC5E,YAAY;QACZ,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE;gBACJ,GAAG,EAAE,MAAM,CAAC,MAAM;gBAClB,aAAa,EAAE,EAAE;aAClB;SACF,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,aAAa,IAAI,YAAY,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,KAAK;YACX,IAAI,EAAE;gBACJ,GAAG,EAAE,MAAM,CAAC,GAAG;gBACf,aAAa,EAAE,EAAE;aAClB;SACF,CAAC,CAAC;IACL,CAAC;AACH,CAAC"}

package/out/zql/src/zql/ivm/memory-source.d.ts

@@ -0,0 +1,65 @@
+import type { Ordering, SimpleCondition } from '../ast/ast.js';
+import { type Comparator, type Node, type Row } from './data.js';
+import type { Constraint, FetchRequest } from './operator.js';
+import type { PrimaryKey, SchemaValue } from './schema.js';
+import type { Source, SourceChange, SourceInput } from './source.js';
+import type { Stream } from './stream.js';
+export type Overlay = {
+    outputIndex: number;
+    change: SourceChange;
+};
+/**
+ * A `MemorySource` is a source that provides data to the pipeline from an
+ * in-memory data source.
+ *
+ * This data is kept in sorted order as downstream pipelines will always expect
+ * the data they receive from `pull` to be in sorted order.
+ */
+export declare class MemorySource implements Source {
+    #private;
+    constructor(tableName: string, columns: Record<string, SchemaValue>, primaryKey: PrimaryKey);
+    getSchemaInfo(): {
+        tableName: string;
+        columns: Record<string, SchemaValue>;
+        primaryKey: PrimaryKey;
+    };
+    connect(sort: Ordering, optionalFilters?: SimpleCondition[] | undefined): SourceInput;
+    getIndexKeys(): string[];
+    push(change: SourceChange): void;
+}
+/**
+ * If the request basis was `before` then the overlay might be the starting point of the stream.
+ *
+ * This can happen in a case like the following:
+ * Store = [1,2,3, 5,6,7]
+ * Overlay = [4]
+ * Request = fetch starting before 5
+ *
+ * In this case, the overlay value of `4` should be the starting point of the stream, not `3`.
+ */
+export declare function generateWithStart(it: Iterator<Node>, req: FetchRequest, compare: (r1: Row, r2: Row) => number): Stream<Node>;
+/**
+ * Takes an iterator and overlay.
+ * Splices the overlay into the iterator at the correct position.
+ *
+ * @param startAt - if there is a lower bound to the stream. If the lower bound of the stream
+ * is above the overlay, the overlay will be skipped.
+ * @param rows - the stream into which the overlay should be spliced
+ * @param constraint - constraint that was applied to the rowIterator and should
+ * also be applied to the overlay.
+ * @param overlay - the overlay values to splice in
+ * @param compare - the comparator to use to find the position for the overlay
+ */
+export declare function generateWithOverlay(startAt: Row | undefined, rows: Iterable<Row>, constraint: Constraint | undefined, overlay: Overlay | undefined, compare: Comparator): Generator<{
+    row: Row;
+    relationships: {};
+}, void, unknown>;
+export { overlayForStartAt as overlayForStartAtForTest };
+declare function overlayForStartAt(overlay: Overlay | undefined, startAt: Row, compare: Comparator): Overlay | undefined;
+export { overlayForConstraint as overlayForConstraintForTest };
+declare function overlayForConstraint(overlay: Overlay | undefined, constraint: Constraint): Overlay | undefined;
+export declare function generateWithOverlayInner(rowIterator: Iterable<Row>, overlays: [Overlay | undefined, Overlay | undefined], compare: (r1: Row, r2: Row) => number): Generator<{
+    row: Row;
+    relationships: {};
+}, void, unknown>;
+//# sourceMappingURL=memory-source.d.ts.map

package/out/zql/src/zql/ivm/memory-source.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-source.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/memory-source.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,QAAQ,EAAa,eAAe,EAAC,MAAM,eAAe,CAAC;AAIxE,OAAO,EACL,KAAK,UAAU,EAGf,KAAK,IAAI,EACT,KAAK,GAAG,EAGT,MAAM,WAAW,CAAC;AAEnB,OAAO,KAAK,EAAC,UAAU,EAAE,YAAY,EAAgB,MAAM,eAAe,CAAC;AAC3E,OAAO,KAAK,EAAC,UAAU,EAAe,WAAW,EAAC,MAAM,aAAa,CAAC;AACtE,OAAO,KAAK,EACV,MAAM,EACN,YAAY,EAEZ,WAAW,EACZ,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC,MAAM,MAAM,OAAO,GAAG;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,YAAY,CAAC;CACtB,CAAC;AAgBF;;;;;;GAMG;AACH,qBAAa,YAAa,YAAW,MAAM;;gBAWvC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU;IAgBxB,aAAa;;;;;IAoBb,OAAO,CACL,IAAI,EAAE,QAAQ,EACd,eAAe,CAAC,EAAE,eAAe,EAAE,GAAG,SAAS,GAC9C,WAAW;IAoFd,YAAY,IAAI,MAAM,EAAE;IAiJxB,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,IAAI;CAqEjC;AAyBD;;;;;;;;;GASG;AACH,wBAAiB,iBAAiB,CAChC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,EAClB,GAAG,EAAE,YAAY,EACjB,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM,GACpC,MAAM,CAAC,IAAI,CAAC,CA0Bd;AAED;;;;;;;;;;;GAWG;AACH,wBAAiB,mBAAmB,CAClC,OAAO,EAAE,GAAG,GAAG,SAAS,EACxB,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EACnB,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,OAAO,EAAE,UAAU;;;kBAIpB;AAoCD,OAAO,EAAC,iBAAiB,IAAI,wBAAwB,EAAC,CAAC;AAEvD,iBAAS,iBAAiB,CACxB,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,OAAO,EAAE,GAAG,EACZ,OAAO,EAAE,UAAU,GAClB,OAAO,GAAG,SAAS,CAQrB;AAED,OAAO,EAAC,oBAAoB,IAAI,2BAA2B,EAAC,CAAC;AAE7D,iBAAS,oBAAoB,CAC3B,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,UAAU,EAAE,UAAU,GACrB,OAAO,GAAG,SAAS,CASrB;AAyBD,wBAAiB,wBAAwB,CACvC,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,EAC1B,QAAQ,EAAE,CAAC,OAAO,GAAG,SAAS,EAAE,OAAO,GAAG,SAAS,CAAC,EACpD,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM;;;kBAkCtC"}

package/out/zql/src/zql/ivm/memory-source.js

@@ -0,0 +1,508 @@
+import BTree from '../../../../btree/b+tree.js';
+import { assert, unreachable } from '../../../../shared/src/asserts.js';
+import { assertOrderingIncludesPK } from '../builder/builder.js';
+import { createPredicate } from '../builder/filter.js';
+import { compareValues, makeComparator, valuesEqual, } from './data.js';
+import { LookaheadIterator } from './lookahead-iterator.js';
+/**
+ * A `MemorySource` is a source that provides data to the pipeline from an
+ * in-memory data source.
+ *
+ * This data is kept in sorted order as downstream pipelines will always expect
+ * the data they receive from `pull` to be in sorted order.
+ */
+export class MemorySource {
+    #tableName;
+    #columns;
+    #primaryKey;
+    #primaryIndexSort;
+    #indexes = new Map();
+    #connections = [];
+    #overlay;
+    constructor(tableName, columns, primaryKey) {
+        this.#tableName = tableName;
+        this.#columns = columns;
+        this.#primaryKey = primaryKey;
+        this.#primaryIndexSort = primaryKey.map(k => [k, 'asc']);
+        const comparator = makeBoundComparator(this.#primaryIndexSort);
+        this.#indexes.set(JSON.stringify(this.#primaryIndexSort), {
+            comparator,
+            data: new BTree([], comparator),
+            usedBy: new Set(),
+        });
+        assertOrderingIncludesPK(this.#primaryIndexSort, this.#primaryKey);
+    }
+    // Mainly for tests.
+    getSchemaInfo() {
+        return {
+            tableName: this.#tableName,
+            columns: this.#columns,
+            primaryKey: this.#primaryKey,
+        };
+    }
+    #getSchema(connection) {
+        return {
+            tableName: this.#tableName,
+            columns: this.#columns,
+            primaryKey: this.#primaryKey,
+            sort: connection.sort,
+            relationships: {},
+            isHidden: false,
+            compareRows: connection.compareRows,
+        };
+    }
+    connect(sort, optionalFilters) {
+        const input = {
+            getSchema: () => this.#getSchema(connection),
+            fetch: req => this.#fetch(req, connection),
+            cleanup: req => this.#cleanup(req, connection),
+            setOutput: output => {
+                connection.output = output;
+            },
+            destroy: () => {
+                this.#disconnect(input);
+            },
+            appliedFilters: false,
+        };
+        const connection = {
+            input,
+            output: undefined,
+            sort,
+            compareRows: makeComparator(sort),
+            optionalFilters: (optionalFilters ?? []).map(f => createPredicate(f)),
+        };
+        assertOrderingIncludesPK(sort, this.#primaryKey);
+        this.#connections.push(connection);
+        return input;
+    }
+    #disconnect(input) {
+        const idx = this.#connections.findIndex(c => c.input === input);
+        assert(idx !== -1, 'Connection not found');
+        const connection = this.#connections[idx];
+        this.#connections.splice(idx, 1);
+        const primaryIndexKey = JSON.stringify(this.#primaryIndexSort);
+        for (const [key, index] of this.#indexes) {
+            if (key === primaryIndexKey) {
+                continue;
+            }
+            index.usedBy.delete(connection);
+            if (index.usedBy.size === 0) {
+                this.#indexes.delete(key);
+            }
+        }
+    }
+    #getPrimaryIndex() {
+        const index = this.#indexes.get(JSON.stringify(this.#primaryIndexSort));
+        assert(index, 'Primary index not found');
+        return index;
+    }
+    #getOrCreateIndex(sort, usedBy) {
+        const key = JSON.stringify(sort);
+        const index = this.#indexes.get(key);
+        // Future optimization could use existing index if it's the same just sorted
+        // in reverse of needed.
+        if (index) {
+            index.usedBy.add(usedBy);
+            return index;
+        }
+        const comparator = makeBoundComparator(sort);
+        // When creating these synchronously becomes a problem, a few options:
+        // 1. Allow users to specify needed indexes up front
+        // 2. Create indexes in a different thread asynchronously (this would require
+        // modifying the BTree to be able to be passed over structured-clone, or using
+        // a different library.)
+        // 3. We could even theoretically do (2) on multiple threads and then merge the
+        // results!
+        const data = new BTree([], comparator);
+        // I checked, there's no special path for adding data in bulk faster.
+        // The constructor takes an array, but it just calls add/set over and over.
+        for (const row of this.#getPrimaryIndex().data.keys()) {
+            data.add(row, undefined);
+        }
+        const newIndex = { comparator, data, usedBy: new Set([usedBy]) };
+        this.#indexes.set(key, newIndex);
+        return newIndex;
+    }
+    // For unit testing that we correctly clean up indexes.
+    getIndexKeys() {
+        return [...this.#indexes.keys()];
+    }
+    *#fetch(req, from) {
+        let overlay;
+        const callingConnectionNum = this.#connections.indexOf(from);
+        assert(callingConnectionNum !== -1, 'Output not found');
+        const conn = this.#connections[callingConnectionNum];
+        const { sort: requestedSort } = conn;
+        // If there is a constraint, we need an index sorted by it first.
+        const indexSort = [];
+        if (req.constraint) {
+            indexSort.push([req.constraint.key, 'asc']);
+        }
+        // For the special case of constraining by PK, we don't need to worry about
+        // any requested sort since there can only be one result. Otherwise we also
+        // need the index sorted by the requested sort.
+        if (this.#primaryKey.length > 1 ||
+            req.constraint?.key !== this.#primaryKey[0]) {
+            indexSort.push(...requestedSort);
+        }
+        const index = this.#getOrCreateIndex(indexSort, from);
+        const { data, comparator } = index;
+        // When we receive a push, we send it to each output one at a time. Once the
+        // push is sent to an output, it should keep being sent until all datastores
+        // have received it and the change has been made to the datastore.
+        if (this.#overlay) {
+            if (callingConnectionNum <= this.#overlay.outputIndex) {
+                overlay = this.#overlay;
+            }
+        }
+        const matchesConstraint = (row) => {
+            if (!req.constraint) {
+                return true;
+            }
+            const { key, value } = req.constraint;
+            return valuesEqual(row[key], value);
+        };
+        const matchesFilters = (row) => conn.optionalFilters.every(f => f(row));
+        const matchesConstraintAndFilters = (row) => matchesConstraint(row) && matchesFilters(row);
+        // If there is an overlay for this output, does it match the requested
+        // constraints and filters?
+        if (overlay) {
+            // TODO: This looks wrong given that we can have edit changes in the overlay.
+            if (!matchesConstraintAndFilters(overlay.change.row)) {
+                overlay = undefined;
+            }
+        }
+        const nextLowerKey = (row) => {
+            if (!row) {
+                return undefined;
+            }
+            let o = overlay;
+            if (o) {
+                if (comparator(o.change.row, row) >= 0) {
+                    o = undefined;
+                }
+            }
+            while (row !== undefined) {
+                row = data.nextLowerKey(row);
+                if (row && matchesConstraintAndFilters(row)) {
+                    if (o && comparator(o.change.row, row) >= 0) {
+                        return o.change.row;
+                    }
+                    return row;
+                }
+            }
+            return o?.change.row;
+        };
+        let startAt = req.start?.row;
+        if (startAt) {
+            if (req.constraint) {
+                // There's no problem supporting startAt outside of constraints, but I
+                // don't think we have a use case for this – if we see it, it's probably
+                // a bug.
+                if (!matchesConstraint(startAt)) {
+                    assert(false, 'Start row must match constraint');
+                }
+            }
+            if (req.start.basis === 'before') {
+                startAt = nextLowerKey(startAt);
+            }
+        }
+        // If there is a constraint, we want to start our scan at the first row that
+        // matches the constraint. But because the next OrderPart can be `desc`,
+        // it's not true that {[constraintKey]: constraintValue} is the first
+        // matching row. Because in that case, the other fields will all be
+        // `undefined`, and in Zero `undefined` is always less than any other value.
+        // So if the second OrderPart is descending then `undefined` values will
+        // actually be the *last* row. We need a way to stay "start at the first row
+        // with this constraint value". RowBound with the corresponding compareBound
+        // comparator accomplishes this. The right thing is probably to teach the
+        // btree library to support this concept.
+        let scanStart;
+        if (req.constraint) {
+            scanStart = {};
+            for (const [key, dir] of indexSort) {
+                if (key === req.constraint.key) {
+                    scanStart[key] = req.constraint.value;
+                }
+                else {
+                    scanStart[key] = dir === 'asc' ? minValue : maxValue;
+                }
+            }
+        }
+        else {
+            scanStart = startAt;
+        }
+        const withOverlay = generateWithOverlay(startAt, 
+        // 😬 - btree library doesn't support ideas like start "before" this
+        // key.
+        data.keys(scanStart), req.constraint, overlay, comparator);
+        const withFilters = conn.optionalFilters.length
+            ? generateWithFilter(withOverlay, matchesFilters)
+            : withOverlay;
+        yield* generateWithConstraint(generateWithStart(withFilters, req, comparator), req.constraint);
+    }
+    #cleanup(req, connection) {
+        return this.#fetch(req, connection);
+    }
+    push(change) {
+        const primaryIndex = this.#getPrimaryIndex();
+        const { data } = primaryIndex;
+        switch (change.type) {
+            case 'add':
+                if (data.has(change.row)) {
+                    throw new Error(`Row already exists: ` + JSON.stringify(change));
+                }
+                break;
+            case 'remove':
+                if (!data.has(change.row)) {
+                    throw new Error(`Row not found: ` + JSON.stringify(change));
+                }
+                break;
+            case 'edit':
+                if (!data.has(change.oldRow)) {
+                    throw new Error(`Row not found: ` + JSON.stringify(change));
+                }
+                break;
+            default:
+                unreachable(change);
+        }
+        const outputChange = change.type === 'edit'
+            ? change
+            : {
+                type: change.type,
+                node: {
+                    row: change.row,
+                    relationships: {},
+                },
+            };
+        for (const [outputIndex, { output }] of this.#connections.entries()) {
+            if (output) {
+                this.#overlay = { outputIndex, change };
+                output.push(outputChange);
+            }
+        }
+        this.#overlay = undefined;
+        for (const { data } of this.#indexes.values()) {
+            switch (change.type) {
+                case 'add': {
+                    const added = data.add(change.row, undefined);
+                    // must succeed since we checked has() above.
+                    assert(added);
+                    break;
+                }
+                case 'remove': {
+                    const removed = data.delete(change.row);
+                    // must succeed since we checked has() above.
+                    assert(removed);
+                    break;
+                }
+                case 'edit': {
+                    // We cannot just do `set` with the new value since the `oldRow` might
+                    // not map to the same entry as the new `row` in the index btree.
+                    const removed = data.delete(change.oldRow);
+                    // must succeed since we checked has() above.
+                    assert(removed);
+                    data.add(change.row, undefined);
+                    break;
+                }
+                default:
+                    unreachable(change);
+            }
+        }
+    }
+}
+function* generateWithConstraint(it, constraint) {
+    for (const node of it) {
+        if (constraint &&
+            !valuesEqual(node.row[constraint.key], constraint.value)) {
+            break;
+        }
+        yield node;
+    }
+}
+function* generateWithFilter(it, filter) {
+    for (const node of it) {
+        if (filter(node.row)) {
+            yield node;
+        }
+    }
+}
+/**
+ * If the request basis was `before` then the overlay might be the starting point of the stream.
+ *
+ * This can happen in a case like the following:
+ * Store = [1,2,3, 5,6,7]
+ * Overlay = [4]
+ * Request = fetch starting before 5
+ *
+ * In this case, the overlay value of `4` should be the starting point of the stream, not `3`.
+ */
+export function* generateWithStart(it, req, compare) {
+    // Figure out the start row.
+    const cursor = new LookaheadIterator(it, 2);
+    let started = req.start === undefined ? true : false;
+    for (const [curr, next] of cursor) {
+        if (!started) {
+            assert(req.start);
+            if (req.start.basis === 'before') {
+                if (next === undefined || compare(next.row, req.start.row) >= 0) {
+                    started = true;
+                }
+            }
+            else if (req.start.basis === 'at') {
+                if (compare(curr.row, req.start.row) >= 0) {
+                    started = true;
+                }
+            }
+            else if (req.start.basis === 'after') {
+                if (compare(curr.row, req.start.row) > 0) {
+                    started = true;
+                }
+            }
+        }
+        if (started) {
+            yield curr;
+        }
+    }
+}
+/**
+ * Takes an iterator and overlay.
+ * Splices the overlay into the iterator at the correct position.
+ *
+ * @param startAt - if there is a lower bound to the stream. If the lower bound of the stream
+ * is above the overlay, the overlay will be skipped.
+ * @param rows - the stream into which the overlay should be spliced
+ * @param constraint - constraint that was applied to the rowIterator and should
+ * also be applied to the overlay.
+ * @param overlay - the overlay values to splice in
+ * @param compare - the comparator to use to find the position for the overlay
+ */
+export function* generateWithOverlay(startAt, rows, constraint, overlay, compare) {
+    const overlays = computeOverlays(startAt, constraint, overlay, compare);
+    yield* generateWithOverlayInner(rows, overlays, compare);
+}
+function computeOverlays(startAt, constraint, overlay, compare) {
+    let secondOverlay;
+    if (overlay?.change.type === 'edit' &&
+        compare(overlay.change.row, overlay.change.oldRow) !== 0) {
+        // Different PK so we split the edit change into a remove and add.
+        [overlay, secondOverlay] = splitEditChange(overlay, compare);
+    }
+    if (startAt) {
+        overlay = overlayForStartAt(overlay, startAt, compare);
+        secondOverlay = overlayForStartAt(secondOverlay, startAt, compare);
+    }
+    if (constraint) {
+        overlay = overlayForConstraint(overlay, constraint);
+        secondOverlay = overlayForConstraint(secondOverlay, constraint);
+    }
+    if (secondOverlay !== undefined && overlay === undefined) {
+        overlay = secondOverlay;
+        secondOverlay = undefined;
+    }
+    return [overlay, secondOverlay];
+}
+export { overlayForStartAt as overlayForStartAtForTest };
+function overlayForStartAt(overlay, startAt, compare) {
+    if (!overlay) {
+        return undefined;
+    }
+    if (compare(overlay.change.row, startAt) < 0) {
+        return undefined;
+    }
+    return overlay;
+}
+export { overlayForConstraint as overlayForConstraintForTest };
+function overlayForConstraint(overlay, constraint) {
+    if (!overlay) {
+        return undefined;
+    }
+    if (!valuesEqual(overlay.change.row[constraint.key], constraint.value)) {
+        return undefined;
+    }
+    return overlay;
+}
+function splitEditChange(overlay, compare) {
+    const { oldRow, row } = overlay.change;
+    const removeOverlay = {
+        outputIndex: overlay.outputIndex,
+        change: { type: 'remove', row: oldRow },
+    };
+    const addOverlay = {
+        outputIndex: overlay.outputIndex,
+        change: { type: 'add', row },
+    };
+    const cmp = compare(oldRow, row);
+    assert(cmp !== 0, 'We should not split edit change with same PK');
+    if (cmp < 0) {
+        return [removeOverlay, addOverlay];
+    }
+    return [addOverlay, removeOverlay];
+}
+export function* generateWithOverlayInner(rowIterator, overlays, compare) {
+    let [overlay, secondOverlay] = overlays;
+    for (const row of rowIterator) {
+        if (overlay) {
+            if (overlay.change.type === 'add' || overlay.change.type === 'edit') {
+                // For edit changes we can only get here if the edit change was not
+                // split an the row and the oldRow have the same PK.
+                const cmp = compare(overlay.change.row, row);
+                if (cmp < 0) {
+                    yield { row: overlay.change.row, relationships: {} };
+                    overlay = secondOverlay;
+                    secondOverlay = undefined;
+                }
+            }
+            if (overlay?.change.type === 'remove') {
+                const cmp = compare(overlay.change.row, row);
+                if (cmp < 0) {
+                    overlay = secondOverlay;
+                    secondOverlay = undefined;
+                }
+                else if (cmp === 0) {
+                    overlay = secondOverlay;
+                    secondOverlay = undefined;
+                    continue;
+                }
+            }
+        }
+        yield { row, relationships: {} };
+    }
+    if (overlay && overlay.change.type === 'add') {
+        yield { row: overlay.change.row, relationships: {} };
+    }
+}
+const minValue = Symbol('min-value');
+const maxValue = Symbol('max-value');
+function makeBoundComparator(sort) {
+    return (a, b) => {
+        // Hot! Do not use destructuring
+        for (const entry of sort) {
+            const key = entry[0];
+            const cmp = compareBounds(a[key], b[key]);
+            if (cmp !== 0) {
+                return entry[1] === 'asc' ? cmp : -cmp;
+            }
+        }
+        return 0;
+    };
+}
+function compareBounds(a, b) {
+    if (a === b) {
+        return 0;
+    }
+    if (a === minValue) {
+        return -1;
+    }
+    if (b === minValue) {
+        return 1;
+    }
+    if (a === maxValue) {
+        return 1;
+    }
+    if (b === maxValue) {
+        return -1;
+    }
+    return compareValues(a, b);
+}
+//# sourceMappingURL=memory-source.js.map

package/out/zql/src/zql/ivm/memory-source.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-source.js","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/memory-source.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,OAAO,CAAC;AAC1B,OAAO,EAAC,MAAM,EAAE,WAAW,EAAC,MAAM,uBAAuB,CAAC;AAE1D,OAAO,EAAC,wBAAwB,EAAC,MAAM,uBAAuB,CAAC;AAC/D,OAAO,EAAC,eAAe,EAAC,MAAM,sBAAsB,CAAC;AAErD,OAAO,EAEL,aAAa,EACb,cAAc,EAId,WAAW,GACZ,MAAM,WAAW,CAAC;AACnB,OAAO,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AA8B1D;;;;;;GAMG;AACH,MAAM,OAAO,YAAY;IACd,UAAU,CAAS;IACnB,QAAQ,CAA8B;IACtC,WAAW,CAAa;IACxB,iBAAiB,CAAW;IAC5B,QAAQ,GAAuB,IAAI,GAAG,EAAE,CAAC;IACzC,YAAY,GAAiB,EAAE,CAAC;IAEzC,QAAQ,CAAsB;IAE9B,YACE,SAAiB,EACjB,OAAoC,EACpC,UAAsB;QAEtB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,iBAAiB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,mBAAmB,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC/D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE;YACxD,UAAU;YACV,IAAI,EAAE,IAAI,KAAK,CAAiB,EAAE,EAAE,UAAU,CAAC;YAC/C,MAAM,EAAE,IAAI,GAAG,EAAE;SAClB,CAAC,CAAC;QACH,wBAAwB,CAAC,IAAI,CAAC,iBAAiB,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACrE,CAAC;IAED,oBAAoB;IACpB,aAAa;QACX,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,UAAU,EAAE,IAAI,CAAC,WAAW;SAC7B,CAAC;IACJ,CAAC;IAED,UAAU,CAAC,UAAsB;QAC/B,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,UAAU,EAAE,IAAI,CAAC,WAAW;YAC5B,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,aAAa,EAAE,EAAE;YACjB,QAAQ,EAAE,KAAK;YACf,WAAW,EAAE,UAAU,CAAC,WAAW;SACpC,CAAC;IACJ,CAAC;IAED,OAAO,CACL,IAAc,EACd,eAA+C;QAE/C,MAAM,KAAK,GAAgB;YACzB,SAAS,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC;YAC5C,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC;YAC1C,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC;YAC9C,SAAS,EAAE,MAAM,CAAC,EAAE;gBAClB,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC;YAC7B,CAAC;YACD,OAAO,EAAE,GAAG,EAAE;gBACZ,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;YACD,cAAc,EAAE,KAAK;SACtB,CAAC;QAEF,MAAM,UAAU,GAAe;YAC7B,KAAK;YACL,MAAM,EAAE,SAAS;YACjB,IAAI;YACJ,WAAW,EAAE,cAAc,CAAC,IAAI,CAAC;YACjC,eAAe,EAAE,CAAC,eAAe,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;SACtE,CAAC;QACF,wBAAwB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACjD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,WAAW,CAAC,KAAY;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;QAChE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEjC,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAE/D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzC,IAAI,GAAG,KAAK,eAAe,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YACD,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAChC,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,gBAAgB;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;QACxE,MAAM,CAAC,KAAK,EAAE,yBAAyB,CAAC,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iBAAiB,CAAC,IAAc,EAAE,MAAkB;QAClD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,4EAA4E;QAC5E,wBAAwB;QACxB,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,UAAU,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAE7C,sEAAsE;QACtE,oDAAoD;QACpD,6EAA6E;QAC7E,8EAA8E;QAC9E,wBAAwB;QACxB,+EAA+E;QAC/E,WAAW;QACX,MAAM,IAAI,GAAG,IAAI,KAAK,CAAiB,EAAE,EAAE,UAAU,CAAC,CAAC;QAEvD,qEAAqE;QACrE,2EAA2E;QAC3E,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC3B,CAAC;QAED,MAAM,QAAQ,GAAG,EAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,EAAC,CAAC;QAC/D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACjC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,uDAAuD;IACvD,YAAY;QACV,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,CAAC,MAAM,CAAC,GAAiB,EAAE,IAAgB;QACzC,IAAI,OAA4B,CAAC;QAEjC,MAAM,oBAAoB,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7D,MAAM,CAAC,oBAAoB,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC;QACrD,MAAM,EAAC,IAAI,EAAE,aAAa,EAAC,GAAG,IAAI,CAAC;QAEnC,iEAAiE;QACjE,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YACnB,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,2EAA2E;QAC3E,2EAA2E;QAC3E,+CAA+C;QAC/C,IACE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;YAC3B,GAAG,CAAC,UAAU,EAAE,GAAG,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAC3C,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,EAAC,IAAI,EAAE,UAAU,EAAC,GAAG,KAAK,CAAC;QAEjC,4EAA4E;QAC5E,4EAA4E;QAC5E,kEAAkE;QAClE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,IAAI,oBAAoB,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;gBACtD,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,CAAC,GAAQ,EAAE,EAAE;YACrC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;gBACpB,OAAO,IAAI,CAAC;YACd,CAAC;YACD,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,GAAG,CAAC,UAAU,CAAC;YACpC,OAAO,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QACtC,CAAC,CAAC;QAEF,MAAM,cAAc,GAAG,CAAC,GAAQ,EAAE,EAAE,CAClC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE1C,MAAM,2BAA2B,GAAG,CAAC,GAAQ,EAAE,EAAE,CAC/C,iBAAiB,CAAC,GAAG,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC;QAChD,sEAAsE;QACtE,2BAA2B;QAC3B,IAAI,OAAO,EAAE,CAAC;YACZ,6EAA6E;YAC7E,IAAI,CAAC,2BAA2B,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrD,OAAO,GAAG,SAAS,CAAC;YACtB,CAAC;QACH,CAAC;QACD,MAAM,YAAY,GAAG,CAAC,GAAoB,EAAE,EAAE;YAC5C,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,CAAC,GAAG,OAAO,CAAC;YAChB,IAAI,CAAC,EAAE,CAAC;gBACN,IAAI,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvC,CAAC,GAAG,SAAS,CAAC;gBAChB,CAAC;YACH,CAAC;YACD,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;gBACzB,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;gBAC7B,IAAI,GAAG,IAAI,2BAA2B,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC5C,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC5C,OAAO,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;oBACtB,CAAC;oBACD,OAAO,GAAG,CAAC;gBACb,CAAC;YACH,CAAC;YACD,OAAO,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC;QACvB,CAAC,CAAC;QACF,IAAI,OAAO,GAAG,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC;QAC7B,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;gBACnB,sEAAsE;gBACtE,wEAAwE;gBACxE,SAAS;gBACT,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC;oBAChC,MAAM,CAAC,KAAK,EAAE,iCAAiC,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;YACD,IAAI,GAAG,CAAC,KAAM,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAClC,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,wEAAwE;QACxE,qEAAqE;QACrE,mEAAmE;QACnE,4EAA4E;QAC5E,wEAAwE;QACxE,4EAA4E;QAC5E,4EAA4E;QAC5E,yEAAyE;QACzE,yCAAyC;QACzC,IAAI,SAA+B,CAAC;QACpC,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YACnB,SAAS,GAAG,EAAE,CAAC;YACf,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,GAAG,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;oBAC/B,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC;gBACxC,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACvD,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,OAAO,CAAC;QACtB,CAAC;QAED,MAAM,WAAW,GAAG,mBAAmB,CACrC,OAAO;QACP,oEAAoE;QACpE,OAAO;QACP,IAAI,CAAC,IAAI,CAAC,SAAgB,CAAC,EAC3B,GAAG,CAAC,UAAU,EACd,OAAO,EACP,UAAU,CACX,CAAC;QAEF,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM;YAC7C,CAAC,CAAC,kBAAkB,CAAC,WAAW,EAAE,cAAc,CAAC;YACjD,CAAC,CAAC,WAAW,CAAC;QAEhB,KAAK,CAAC,CAAC,sBAAsB,CAC3B,iBAAiB,CAAC,WAAW,EAAE,GAAG,EAAE,UAAU,CAAC,EAC/C,GAAG,CAAC,UAAU,CACf,CAAC;IACJ,CAAC;IAED,QAAQ,CAAC,GAAiB,EAAE,UAAsB;QAChD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,CAAC,MAAoB;QACvB,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC7C,MAAM,EAAC,IAAI,EAAC,GAAG,YAAY,CAAC;QAE5B,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,KAAK;gBACR,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,MAAM,IAAI,KAAK,CAAC,sBAAsB,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;gBACnE,CAAC;gBACD,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC1B,MAAM,IAAI,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC9D,CAAC;gBACD,MAAM;YACR,KAAK,MAAM;gBACT,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC7B,MAAM,IAAI,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC9D,CAAC;gBACD,MAAM;YACR;gBACE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;QAED,MAAM,YAAY,GAChB,MAAM,CAAC,IAAI,KAAK,MAAM;YACpB,CAAC,CAAC,MAAM;YACR,CAAC,CAAC;gBACE,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,IAAI,EAAE;oBACJ,GAAG,EAAE,MAAM,CAAC,GAAG;oBACf,aAAa,EAAE,EAAE;iBAClB;aACF,CAAC;QACR,KAAK,MAAM,CAAC,WAAW,EAAE,EAAC,MAAM,EAAC,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YAClE,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,CAAC,QAAQ,GAAG,EAAC,WAAW,EAAE,MAAM,EAAC,CAAC;gBACtC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,KAAK,MAAM,EAAC,IAAI,EAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;gBACpB,KAAK,KAAK,CAAC,CAAC,CAAC;oBACX,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;oBAC9C,6CAA6C;oBAC7C,MAAM,CAAC,KAAK,CAAC,CAAC;oBACd,MAAM;gBACR,CAAC;gBACD,KAAK,QAAQ,CAAC,CAAC,CAAC;oBACd,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACxC,6CAA6C;oBAC7C,MAAM,CAAC,OAAO,CAAC,CAAC;oBAChB,MAAM;gBACR,CAAC;gBACD,KAAK,MAAM,CAAC,CAAC,CAAC;oBACZ,sEAAsE;oBACtE,iEAAiE;oBACjE,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC3C,6CAA6C;oBAC7C,MAAM,CAAC,OAAO,CAAC,CAAC;oBAChB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;oBAChC,MAAM;gBACR,CAAC;gBACD;oBACE,WAAW,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED,QAAQ,CAAC,CAAC,sBAAsB,CAC9B,EAAgB,EAChB,UAAkC;IAElC,KAAK,MAAM,IAAI,IAAI,EAAE,EAAE,CAAC;QACtB,IACE,UAAU;YACV,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,EACxD,CAAC;YACD,MAAM;QACR,CAAC;QACD,MAAM,IAAI,CAAC;IACb,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,CAAC,kBAAkB,CAAC,EAAgB,EAAE,MAA6B;IAC1E,KAAK,MAAM,IAAI,IAAI,EAAE,EAAE,CAAC;QACtB,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,SAAS,CAAC,CAAC,iBAAiB,CAChC,EAAkB,EAClB,GAAiB,EACjB,OAAqC;IAErC,4BAA4B;IAC5B,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE5C,IAAI,OAAO,GAAG,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IACrD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClB,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACjC,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChE,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;iBAAM,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBACpC,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1C,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;iBAAM,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,OAAO,EAAE,CAAC;gBACvC,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzC,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,SAAS,CAAC,CAAC,mBAAmB,CAClC,OAAwB,EACxB,IAAmB,EACnB,UAAkC,EAClC,OAA4B,EAC5B,OAAmB;IAEnB,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACxE,KAAK,CAAC,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,eAAe,CACtB,OAAwB,EACxB,UAAkC,EAClC,OAA4B,EAC5B,OAAmB;IAEnB,IAAI,aAAkC,CAAC;IAEvC,IACE,OAAO,EAAE,MAAM,CAAC,IAAI,KAAK,MAAM;QAC/B,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EACxD,CAAC;QACD,kEAAkE;QAClE,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,GAAG,iBAAiB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACvD,aAAa,GAAG,iBAAiB,CAAC,aAAa,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IAED,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,GAAG,oBAAoB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACpD,aAAa,GAAG,oBAAoB,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IAClE,CAAC;IAED,IAAI,aAAa,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QACzD,OAAO,GAAG,aAAa,CAAC;QACxB,aAAa,GAAG,SAAS,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAClC,CAAC;AAED,OAAO,EAAC,iBAAiB,IAAI,wBAAwB,EAAC,CAAC;AAEvD,SAAS,iBAAiB,CACxB,OAA4B,EAC5B,OAAY,EACZ,OAAmB;IAEnB,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,OAAO,EAAC,oBAAoB,IAAI,2BAA2B,EAAC,CAAC;AAE7D,SAAS,oBAAoB,CAC3B,OAA4B,EAC5B,UAAsB;IAEtB,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACvE,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,eAAe,CACtB,OAAgB,EAChB,OAAmB;IAEnB,MAAM,EAAC,MAAM,EAAE,GAAG,EAAC,GAAG,OAAO,CAAC,MAA0B,CAAC;IAEzD,MAAM,aAAa,GAAY;QAC7B,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,MAAM,EAAE,EAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAC;KACtC,CAAC;IACF,MAAM,UAAU,GAAY;QAC1B,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,MAAM,EAAE,EAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAC;KAC3B,CAAC;IAEF,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACjC,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,8CAA8C,CAAC,CAAC;IAClE,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;AACrC,CAAC;AAED,MAAM,SAAS,CAAC,CAAC,wBAAwB,CACvC,WAA0B,EAC1B,QAAoD,EACpD,OAAqC;IAErC,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,QAAQ,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACpE,mEAAmE;gBACnE,oDAAoD;gBACpD,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC7C,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;oBACZ,MAAM,EAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,EAAE,EAAE,EAAC,CAAC;oBACnD,OAAO,GAAG,aAAa,CAAC;oBACxB,aAAa,GAAG,SAAS,CAAC;gBAC5B,CAAC;YACH,CAAC;YAED,IAAI,OAAO,EAAE,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACtC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC7C,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;oBACZ,OAAO,GAAG,aAAa,CAAC;oBACxB,aAAa,GAAG,SAAS,CAAC;gBAC5B,CAAC;qBAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;oBACrB,OAAO,GAAG,aAAa,CAAC;oBACxB,aAAa,GAAG,SAAS,CAAC;oBAC1B,SAAS;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,EAAC,GAAG,EAAE,aAAa,EAAE,EAAE,EAAC,CAAC;IACjC,CAAC;IAED,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC7C,MAAM,EAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,EAAE,EAAE,EAAC,CAAC;IACrD,CAAC;AACH,CAAC;AASD,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;AAErC,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;AAGrC,SAAS,mBAAmB,CAAC,IAAc;IACzC,OAAO,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE;QAClC,gCAAgC;QAChC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACd,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACzC,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,CAAQ,EAAE,CAAQ;IACvC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7B,CAAC"}

package/out/zql/src/zql/ivm/memory-storage.d.ts

@@ -0,0 +1,18 @@
+import type { JSONValue } from '../../../../shared/src/json.js';
+import type { Storage } from './operator.js';
+import type { Stream } from './stream.js';
+/**
+ * MemoryStorage is a simple in-memory implementation of `Storage` for use
+ * on the client and in tests.
+ */
+export declare class MemoryStorage implements Storage {
+    #private;
+    set(key: string, value: JSONValue): void;
+    get(key: string, def?: JSONValue): JSONValue | undefined;
+    del(key: string): void;
+    scan(options?: {
+        prefix: string;
+    }): Stream<[string, JSONValue]>;
+    cloneData(): Record<string, JSONValue>;
+}
+//# sourceMappingURL=memory-storage.d.ts.map

package/out/zql/src/zql/ivm/memory-storage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-storage.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/memory-storage.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,oBAAoB,CAAC;AAClD,OAAO,KAAK,EAAC,OAAO,EAAC,MAAM,eAAe,CAAC;AAE3C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC;;;GAGG;AACH,qBAAa,aAAc,YAAW,OAAO;;IAG3C,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS;IAIjC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAQxD,GAAG,CAAC,GAAG,EAAE,MAAM;IAId,IAAI,CAAC,OAAO,CAAC,EAAE;QAAC,MAAM,EAAE,MAAM,CAAA;KAAC,GAAG,MAAM,CAAC,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAS9D,SAAS,IAAI,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC;CAGvC"}