@rocicorp/zero 0.0.0-202410031711

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

@@ -0,0 +1,453 @@
+import { assert, unreachable } from '../../../../shared/src/asserts.js';
+import { must } from '../../../../shared/src/must.js';
+import { assertOrderingIncludesPK } from '../builder/builder.js';
+import { normalizeUndefined } from './data.js';
+import { first, take } from './stream.js';
+const MAX_BOUND_KEY = 'maxBound';
+/**
+ * The Take operator is for implementing limit queries. It takes the first n
+ * nodes of its input as determined by the input’s comparator. It then keeps
+ * a *bound* of the last item it has accepted so that it can evaluate whether
+ * new incoming pushes should be accepted or rejected.
+ *
+ * Take can count rows globally or by unique value of some field.
+ */
+export class Take {
+    #input;
+    #storage;
+    #limit;
+    #partitionKey;
+    #output = null;
+    constructor(input, storage, limit, partitionKey) {
+        this.#input = input;
+        this.#storage = storage;
+        this.#limit = limit;
+        this.#partitionKey = partitionKey;
+        assert(limit >= 0);
+        assertOrderingIncludesPK(this.#input.getSchema().sort, this.#input.getSchema().primaryKey);
+        this.#input.setOutput(this);
+    }
+    setOutput(output) {
+        this.#output = output;
+    }
+    getSchema() {
+        return this.#input.getSchema();
+    }
+    *fetch(req) {
+        if (this.#partitionKey === undefined ||
+            req.constraint?.key === this.#partitionKey) {
+            const partitionValue = this.#partitionKey === undefined ? undefined : req.constraint?.value;
+            const takeStateKey = getTakeStateKey(partitionValue);
+            const takeState = this.#storage.get(takeStateKey);
+            if (!takeState) {
+                yield* this.#initialFetch(req);
+                return;
+            }
+            if (takeState.bound === undefined) {
+                return;
+            }
+            for (const inputNode of this.#input.fetch(req)) {
+                if (this.getSchema().compareRows(takeState.bound, inputNode.row) < 0) {
+                    return;
+                }
+                yield inputNode;
+            }
+            return;
+        }
+        // There is a partition key, but the fetch is not constrained or constrained
+        // on a different key.  Thus we don't have a single take state to bound by.
+        // This currently only happens with nested sub-queries
+        // e.g. issues include issuelabels include label.  We could remove this
+        // case if we added a translation layer (powered by some state) in join.
+        // Specifically we need joinKeyValue => parent constraint key
+        const maxBound = this.#storage.get(MAX_BOUND_KEY);
+        if (maxBound === undefined) {
+            return;
+        }
+        for (const inputNode of this.#input.fetch(req)) {
+            if (this.getSchema().compareRows(inputNode.row, maxBound) > 0) {
+                return;
+            }
+            const partitionValue = inputNode.row[this.#partitionKey];
+            const takeStateKey = getTakeStateKey(partitionValue);
+            const takeState = this.#storage.get(takeStateKey);
+            if (takeState?.bound !== undefined &&
+                this.getSchema().compareRows(takeState.bound, inputNode.row) >= 0) {
+                yield inputNode;
+            }
+        }
+    }
+    *#initialFetch(req) {
+        assert(req.start === undefined);
+        assert(this.#partitionKey === undefined ||
+            (req.constraint !== undefined &&
+                req.constraint.key === this.#partitionKey));
+        if (this.#limit === 0) {
+            return;
+        }
+        const partitionValue = this.#partitionKey === undefined ? undefined : req.constraint?.value;
+        const takeStateKey = getTakeStateKey(partitionValue);
+        assert(this.#storage.get(takeStateKey) === undefined);
+        let size = 0;
+        let bound;
+        let downstreamEarlyReturn = true;
+        try {
+            for (const inputNode of this.#input.fetch(req)) {
+                yield inputNode;
+                bound = inputNode.row;
+                size++;
+                if (size === this.#limit) {
+                    break;
+                }
+            }
+            downstreamEarlyReturn = false;
+        }
+        finally {
+            this.#setTakeState(takeStateKey, size, bound, this.#storage.get(MAX_BOUND_KEY));
+            // If it becomes necessary to support downstream early return, this
+            // assert should be removed, and replaced with code that consumes
+            // the input stream until limit is reached or the input stream is
+            // exhausted so that takeState is properly hydrated.
+            assert(!downstreamEarlyReturn, 'Unexpected early return prevented full hydration');
+        }
+    }
+    *cleanup(req) {
+        assert(req.start === undefined);
+        assert(this.#partitionKey === undefined ||
+            (req.constraint !== undefined &&
+                req.constraint.key === this.#partitionKey));
+        let takeState;
+        if (this.#limit > 0) {
+            const partitionValue = this.#partitionKey === undefined ? undefined : req.constraint?.value;
+            const takeStateKey = getTakeStateKey(partitionValue);
+            takeState = this.#storage.get(takeStateKey);
+            assert(takeState !== undefined);
+            this.#storage.del(takeStateKey);
+        }
+        for (const inputNode of this.#input.cleanup(req)) {
+            if (takeState?.bound === undefined ||
+                this.getSchema().compareRows(takeState.bound, inputNode.row) < 0) {
+                return;
+            }
+            yield inputNode;
+        }
+    }
+    #getStateAndConstraint(row) {
+        const partitionValue = this.#partitionKey === undefined ? undefined : row[this.#partitionKey];
+        const takeStateKey = getTakeStateKey(partitionValue);
+        const takeState = this.#storage.get(takeStateKey);
+        let maxBound;
+        let constraint;
+        // The partition key was never fetched, so this push can be discarded.
+        if (takeState) {
+            maxBound = this.#storage.get(MAX_BOUND_KEY);
+            constraint = this.#partitionKey
+                ? {
+                    key: this.#partitionKey,
+                    value: partitionValue,
+                }
+                : undefined;
+        }
+        return { takeState, takeStateKey, maxBound, constraint };
+    }
+    push(change) {
+        if (change.type === 'edit') {
+            this.#pushEditChange(change);
+            return;
+        }
+        assert(this.#output, 'Output not set');
+        // When take below join is supported, this assert should be removed
+        // and a 'child' change should be pushed to output if its row
+        // is <= bound.
+        assert(change.type !== 'child', 'child changes are not supported');
+        const { takeState, takeStateKey, maxBound, constraint } = this.#getStateAndConstraint(change.node.row);
+        if (!takeState) {
+            return;
+        }
+        const { compareRows } = this.getSchema();
+        if (change.type === 'add') {
+            if (takeState.size < this.#limit) {
+                this.#setTakeState(takeStateKey, takeState.size + 1, takeState.bound === undefined ||
+                    compareRows(takeState.bound, change.node.row) < 0
+                    ? change.node.row
+                    : takeState.bound, maxBound);
+                this.#output.push(change);
+                return;
+            }
+            // size === limit
+            if (takeState.bound === undefined ||
+                compareRows(change.node.row, takeState.bound) >= 0) {
+                return;
+            }
+            // added row < bound
+            let beforeBoundNode;
+            let boundNode;
+            if (this.#limit === 1) {
+                boundNode = must(first(this.#input.fetch({
+                    start: {
+                        row: takeState.bound,
+                        basis: 'at',
+                    },
+                    constraint,
+                })));
+            }
+            else {
+                [beforeBoundNode, boundNode] = take(this.#input.fetch({
+                    start: {
+                        row: takeState.bound,
+                        basis: 'before',
+                    },
+                    constraint,
+                }), 2);
+            }
+            const removeChange = {
+                type: 'remove',
+                node: boundNode,
+            };
+            this.#setTakeState(takeStateKey, takeState.size, beforeBoundNode === undefined ||
+                compareRows(change.node.row, beforeBoundNode.row) > 0
+                ? change.node.row
+                : beforeBoundNode.row, maxBound);
+            this.#output.push(removeChange);
+            this.#output.push(change);
+        }
+        else if (change.type === 'remove') {
+            if (takeState.bound === undefined) {
+                // change is after bound
+                return;
+            }
+            const compToBound = compareRows(change.node.row, takeState.bound);
+            if (compToBound > 0) {
+                // change is after bound
+                return;
+            }
+            if (takeState.size === 1) {
+                this.#storage.set(takeStateKey, {
+                    size: 0,
+                    bound: undefined,
+                });
+                this.#output.push(change);
+                return;
+            }
+            // The bound is removed
+            let beforeBoundNode;
+            let afterBoundNode;
+            if (compToBound === 0) {
+                [beforeBoundNode, afterBoundNode] = take(this.#input.fetch({
+                    start: {
+                        row: takeState.bound,
+                        basis: 'before',
+                    },
+                    constraint,
+                }), 2);
+            }
+            else {
+                [beforeBoundNode, , afterBoundNode] = take(this.#input.fetch({
+                    start: {
+                        row: takeState.bound,
+                        basis: 'before',
+                    },
+                    constraint,
+                }), 3);
+            }
+            if (afterBoundNode) {
+                this.#setTakeState(takeStateKey, takeState.size, afterBoundNode.row, maxBound);
+                this.#output.push(change);
+                this.#output.push({
+                    type: 'add',
+                    node: afterBoundNode,
+                });
+                return;
+            }
+            this.#setTakeState(takeStateKey, takeState.size - 1, compToBound === 0 ? beforeBoundNode.row : takeState.bound, maxBound);
+            this.#output.push(change);
+        }
+    }
+    #pushEditChange(change) {
+        assert(this.#output, 'Output not set');
+        if (this.#partitionKey !== undefined &&
+            change.oldRow[this.#partitionKey] !== change.row[this.#partitionKey]) {
+            // different partition key so fall back to remove/add.
+            // TODO: So in some cases these don't need to be transformed into a remove
+            // + add.
+            //
+            // If the oldRow was <= the bound of the old partition value, and the
+            // newRow is <= the bound of the new partition value, this can be sent as
+            // an edit, as the row is present in the output of this operator before
+            // and after applying this push.
+            // We do not need the relationships because Take comes before Join
+            this.push({
+                type: 'remove',
+                node: {
+                    row: change.oldRow,
+                    relationships: {},
+                },
+            });
+            this.push({
+                type: 'add',
+                node: {
+                    row: change.row,
+                    relationships: {},
+                },
+            });
+            return;
+        }
+        const { takeState, takeStateKey, maxBound, constraint } = this.#getStateAndConstraint(change.oldRow);
+        if (!takeState) {
+            return;
+        }
+        assert(takeState.bound, 'Bound should be set');
+        const { compareRows } = this.getSchema();
+        const oldCmp = compareRows(change.oldRow, takeState.bound);
+        const newCmp = compareRows(change.row, takeState.bound);
+        const replaceBoundAndForwardChange = () => {
+            this.#setTakeState(takeStateKey, takeState.size, change.row, maxBound);
+            this.#output.push(change);
+        };
+        // The bounds row was changed.
+        if (oldCmp === 0) {
+            // The new row is the new bound.
+            if (newCmp === 0) {
+                // no need to update the state since we are keeping the bounds
+                this.#output.push(change);
+                return;
+            }
+            if (newCmp < 0) {
+                if (this.#limit === 1) {
+                    replaceBoundAndForwardChange();
+                    return;
+                }
+                // New row will be in the result but it might not be the bounds any
+                // more. We need to find the row before the bounds to determine the new
+                // bounds.
+                const beforeBoundNode = must(first(this.#input.fetch({
+                    start: {
+                        row: takeState.bound,
+                        basis: 'before',
+                    },
+                    constraint,
+                })));
+                this.#setTakeState(takeStateKey, takeState.size, beforeBoundNode.row, maxBound);
+                this.#output.push(change);
+                return;
+            }
+            assert(newCmp > 0);
+            // Find the first item at the old bounds. This will be the new bounds.
+            const newBoundNode = must(first(this.#input.fetch({
+                start: {
+                    row: takeState.bound,
+                    basis: 'at',
+                },
+                constraint,
+            })));
+            // The next row is the new row. We can replace the bounds and keep the
+            // edit change.
+            if (compareRows(newBoundNode.row, change.row) === 0) {
+                replaceBoundAndForwardChange();
+                return;
+            }
+            // The new row is now outside the bounds, so we need to remove the old
+            // row and add the new bounds row.
+            this.#setTakeState(takeStateKey, takeState.size, newBoundNode.row, maxBound);
+            this.#output.push({
+                type: 'remove',
+                node: {
+                    row: change.oldRow,
+                    relationships: {},
+                },
+            });
+            this.#output.push({
+                type: 'add',
+                node: newBoundNode,
+            });
+            return;
+        }
+        if (oldCmp > 0) {
+            assert(newCmp !== 0, 'Invalid state. Row has duplicate primary key');
+            // Both old and new outside of bounds
+            if (newCmp > 0) {
+                return;
+            }
+            // old was outside, new is inside. Pushing out the old bounds
+            assert(newCmp < 0);
+            const [newBoundNode, oldBoundNode] = take(this.#input.fetch({
+                start: {
+                    row: takeState.bound,
+                    basis: 'before',
+                },
+                constraint,
+            }), 2);
+            this.#setTakeState(takeStateKey, takeState.size, newBoundNode.row, maxBound);
+            this.#output.push({
+                type: 'remove',
+                node: oldBoundNode,
+            });
+            // We do not need the relationships because Take comes before Join
+            this.#output.push({
+                type: 'add',
+                node: {
+                    row: change.row,
+                    relationships: {},
+                },
+            });
+            return;
+        }
+        if (oldCmp < 0) {
+            assert(newCmp !== 0, 'Invalid state. Row has duplicate primary key');
+            // Both old and new inside of bounds
+            if (newCmp < 0) {
+                this.#output.push(change);
+                return;
+            }
+            // old was inside, new is larger than old bound
+            assert(newCmp > 0);
+            // at this point we need to find the row after the bound and use that or
+            // the newRow as the new bound.
+            const afterBoundNode = must(first(this.#input.fetch({
+                start: {
+                    row: takeState.bound,
+                    basis: 'after',
+                },
+                constraint,
+            })));
+            // The new row is the new bound. Use an edit change.
+            if (compareRows(afterBoundNode.row, change.row) === 0) {
+                replaceBoundAndForwardChange();
+                return;
+            }
+            this.#setTakeState(takeStateKey, takeState.size, afterBoundNode.row, maxBound);
+            // We do not need the relationships because Take comes before Join
+            this.#output.push({
+                type: 'remove',
+                node: {
+                    row: change.oldRow,
+                    relationships: {},
+                },
+            });
+            this.#output.push({
+                type: 'add',
+                node: afterBoundNode,
+            });
+            return;
+        }
+        unreachable();
+    }
+    #setTakeState(takeStateKey, size, bound, maxBound) {
+        this.#storage.set(takeStateKey, {
+            size,
+            bound,
+        });
+        if (bound !== undefined &&
+            (maxBound === undefined ||
+                this.getSchema().compareRows(bound, maxBound) > 0)) {
+            this.#storage.set(MAX_BOUND_KEY, bound);
+        }
+    }
+    destroy() {
+        this.#input.destroy();
+    }
+}
+function getTakeStateKey(partitionValue) {
+    return JSON.stringify(['take', normalizeUndefined(partitionValue)]);
+}
+//# sourceMappingURL=take.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"take.js","sourceRoot":"","sources":["../../../../../../zql/src/zql/ivm/take.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAE,WAAW,EAAC,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAC,IAAI,EAAC,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAC,wBAAwB,EAAC,MAAM,uBAAuB,CAAC;AAE/D,OAAO,EAAC,kBAAkB,EAAkC,MAAM,WAAW,CAAC;AAU9E,OAAO,EAAC,KAAK,EAAE,IAAI,EAAc,MAAM,aAAa,CAAC;AAErD,MAAM,aAAa,GAAG,UAAU,CAAC;AAcjC;;;;;;;GAOG;AACH,MAAM,OAAO,IAAI;IACN,MAAM,CAAQ;IACd,QAAQ,CAAc;IACtB,MAAM,CAAS;IACf,aAAa,CAAqB;IAE3C,OAAO,GAAkB,IAAI,CAAC;IAE9B,YACE,KAAY,EACZ,OAAgB,EAChB,KAAa,EACb,YAAiC;QAEjC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAsB,CAAC;QACvC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QACnB,wBAAwB,CACtB,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,EAC5B,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,UAAU,CACnC,CAAC;QACF,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,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;IACjC,CAAC;IAED,CAAC,KAAK,CAAC,GAAiB;QACtB,IACE,IAAI,CAAC,aAAa,KAAK,SAAS;YAChC,GAAG,CAAC,UAAU,EAAE,GAAG,KAAK,IAAI,CAAC,aAAa,EAC1C,CAAC;YACD,MAAM,cAAc,GAClB,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC;YACvE,MAAM,YAAY,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC;YACrD,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAClD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;gBAC/B,OAAO;YACT,CAAC;YACD,IAAI,SAAS,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAClC,OAAO;YACT,CAAC;YACD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/C,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACrE,OAAO;gBACT,CAAC;gBACD,MAAM,SAAS,CAAC;YAClB,CAAC;YACD,OAAO;QACT,CAAC;QACD,4EAA4E;QAC5E,2EAA2E;QAC3E,sDAAsD;QACtD,uEAAuE;QACvE,wEAAwE;QACxE,6DAA6D;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAClD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QACD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/C,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9D,OAAO;YACT,CAAC;YACD,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACzD,MAAM,YAAY,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC;YACrD,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAClD,IACE,SAAS,EAAE,KAAK,KAAK,SAAS;gBAC9B,IAAI,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EACjE,CAAC;gBACD,MAAM,SAAS,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,CAAC,aAAa,CAAC,GAAiB;QAC9B,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QAChC,MAAM,CACJ,IAAI,CAAC,aAAa,KAAK,SAAS;YAC9B,CAAC,GAAG,CAAC,UAAU,KAAK,SAAS;gBAC3B,GAAG,CAAC,UAAU,CAAC,GAAG,KAAK,IAAI,CAAC,aAAa,CAAC,CAC/C,CAAC;QAEF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO;QACT,CAAC;QAED,MAAM,cAAc,GAClB,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC;QACvE,MAAM,YAAY,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,SAAS,CAAC,CAAC;QAEtD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAsB,CAAC;QAC3B,IAAI,qBAAqB,GAAG,IAAI,CAAC;QACjC,IAAI,CAAC;YACH,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/C,MAAM,SAAS,CAAC;gBAChB,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC;gBACtB,IAAI,EAAE,CAAC;gBACP,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;oBACzB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,qBAAqB,GAAG,KAAK,CAAC;QAChC,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,IAAI,EACJ,KAAK,EACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,CACjC,CAAC;YACF,mEAAmE;YACnE,iEAAiE;YACjE,iEAAiE;YACjE,oDAAoD;YACpD,MAAM,CACJ,CAAC,qBAAqB,EACtB,kDAAkD,CACnD,CAAC;QACJ,CAAC;IACH,CAAC;IAED,CAAC,OAAO,CAAC,GAAiB;QACxB,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QAChC,MAAM,CACJ,IAAI,CAAC,aAAa,KAAK,SAAS;YAC9B,CAAC,GAAG,CAAC,UAAU,KAAK,SAAS;gBAC3B,GAAG,CAAC,UAAU,CAAC,GAAG,KAAK,IAAI,CAAC,aAAa,CAAC,CAC/C,CAAC;QAEF,IAAI,SAAgC,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,cAAc,GAClB,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC;YACvE,MAAM,YAAY,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC;YACrD,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAC5C,MAAM,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACjD,IACE,SAAS,EAAE,KAAK,KAAK,SAAS;gBAC9B,IAAI,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAChE,CAAC;gBACD,OAAO;YACT,CAAC;YACD,MAAM,SAAS,CAAC;QAClB,CAAC;IACH,CAAC;IAED,sBAAsB,CAAC,GAAQ;QAC7B,MAAM,cAAc,GAClB,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAClD,IAAI,QAAyB,CAAC;QAC9B,IAAI,UAAkC,CAAC;QACvC,sEAAsE;QACtE,IAAI,SAAS,EAAE,CAAC;YACd,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAC5C,UAAU,GAAG,IAAI,CAAC,aAAa;gBAC7B,CAAC,CAAC;oBACE,GAAG,EAAE,IAAI,CAAC,aAAa;oBACvB,KAAK,EAAE,cAAc;iBACtB;gBACH,CAAC,CAAC,SAAS,CAAC;QAChB,CAAC;QAED,OAAO,EAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAYhD,CAAC;IACR,CAAC;IAED,IAAI,CAAC,MAAc;QACjB,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QACvC,mEAAmE;QACnE,6DAA6D;QAC7D,eAAe;QACf,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,iCAAiC,CAAC,CAAC;QAEnE,MAAM,EAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAC,GACnD,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO;QACT,CAAC;QACD,MAAM,EAAC,WAAW,EAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAEvC,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC1B,IAAI,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjC,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,GAAG,CAAC,EAClB,SAAS,CAAC,KAAK,KAAK,SAAS;oBAC3B,WAAW,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBACjD,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG;oBACjB,CAAC,CAAC,SAAS,CAAC,KAAK,EACnB,QAAQ,CACT,CAAC;gBACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,OAAO;YACT,CAAC;YACD,iBAAiB;YACjB,IACE,SAAS,CAAC,KAAK,KAAK,SAAS;gBAC7B,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAClD,CAAC;gBACD,OAAO;YACT,CAAC;YACD,oBAAoB;YACpB,IAAI,eAAiC,CAAC;YACtC,IAAI,SAAe,CAAC;YACpB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,SAAS,GAAG,IAAI,CACd,KAAK,CACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;oBAChB,KAAK,EAAE;wBACL,GAAG,EAAE,SAAS,CAAC,KAAK;wBACpB,KAAK,EAAE,IAAI;qBACZ;oBACD,UAAU;iBACX,CAAC,CACH,CACF,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,CAAC,eAAe,EAAE,SAAS,CAAC,GAAG,IAAI,CACjC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;oBAChB,KAAK,EAAE;wBACL,GAAG,EAAE,SAAS,CAAC,KAAK;wBACpB,KAAK,EAAE,QAAQ;qBAChB;oBACD,UAAU;iBACX,CAAC,EACF,CAAC,CACF,CAAC;YACJ,CAAC;YACD,MAAM,YAAY,GAAiB;gBACjC,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,SAAS;aAChB,CAAC;YACF,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,EACd,eAAe,KAAK,SAAS;gBAC3B,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC;gBACrD,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG;gBACjB,CAAC,CAAC,eAAe,CAAC,GAAG,EACvB,QAAQ,CACT,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;aAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACpC,IAAI,SAAS,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAClC,wBAAwB;gBACxB,OAAO;YACT,CAAC;YACD,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;YAClE,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;gBACpB,wBAAwB;gBACxB,OAAO;YACT,CAAC;YACD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE;oBAC9B,IAAI,EAAE,CAAC;oBACP,KAAK,EAAE,SAAS;iBACjB,CAAC,CAAC;gBACH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,OAAO;YACT,CAAC;YACD,uBAAuB;YACvB,IAAI,eAAiC,CAAC;YACtC,IAAI,cAAgC,CAAC;YACrC,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;gBACtB,CAAC,eAAe,EAAE,cAAc,CAAC,GAAG,IAAI,CACtC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;oBAChB,KAAK,EAAE;wBACL,GAAG,EAAE,SAAS,CAAC,KAAK;wBACpB,KAAK,EAAE,QAAQ;qBAChB;oBACD,UAAU;iBACX,CAAC,EACF,CAAC,CACF,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,CAAC,eAAe,EAAE,AAAD,EAAG,cAAc,CAAC,GAAG,IAAI,CACxC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;oBAChB,KAAK,EAAE;wBACL,GAAG,EAAE,SAAS,CAAC,KAAK;wBACpB,KAAK,EAAE,QAAQ;qBAChB;oBACD,UAAU;iBACX,CAAC,EACF,CAAC,CACF,CAAC;YACJ,CAAC;YAED,IAAI,cAAc,EAAE,CAAC;gBACnB,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,EACd,cAAc,CAAC,GAAG,EAClB,QAAQ,CACT,CAAC;gBACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;oBAChB,IAAI,EAAE,KAAK;oBACX,IAAI,EAAE,cAAc;iBACrB,CAAC,CAAC;gBACH,OAAO;YACT,CAAC;YACD,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,GAAG,CAAC,EAClB,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EACzD,QAAQ,CACT,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,eAAe,CAAC,MAAkB;QAChC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAEvC,IACE,IAAI,CAAC,aAAa,KAAK,SAAS;YAChC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,EACpE,CAAC;YACD,sDAAsD;YAEtD,0EAA0E;YAC1E,SAAS;YACT,EAAE;YACF,qEAAqE;YACrE,yEAAyE;YACzE,uEAAuE;YACvE,gCAAgC;YAEhC,kEAAkE;YAClE,IAAI,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE;oBACJ,GAAG,EAAE,MAAM,CAAC,MAAM;oBAClB,aAAa,EAAE,EAAE;iBAClB;aACF,CAAC,CAAC;YACH,IAAI,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE;oBACJ,GAAG,EAAE,MAAM,CAAC,GAAG;oBACf,aAAa,EAAE,EAAE;iBAClB;aACF,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,MAAM,EAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAC,GACnD,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO;QACT,CAAC;QAED,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;QAC/C,MAAM,EAAC,WAAW,EAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;QAExD,MAAM,4BAA4B,GAAG,GAAG,EAAE;YACxC,IAAI,CAAC,aAAa,CAAC,YAAY,EAAE,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACvE,IAAI,CAAC,OAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC,CAAC;QAEF,8BAA8B;QAC9B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,gCAAgC;YAChC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,8DAA8D;gBAC9D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,OAAO;YACT,CAAC;YAED,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACtB,4BAA4B,EAAE,CAAC;oBAC/B,OAAO;gBACT,CAAC;gBAED,mEAAmE;gBACnE,uEAAuE;gBACvE,UAAU;gBAEV,MAAM,eAAe,GAAG,IAAI,CAC1B,KAAK,CACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;oBAChB,KAAK,EAAE;wBACL,GAAG,EAAE,SAAS,CAAC,KAAK;wBACpB,KAAK,EAAE,QAAQ;qBAChB;oBACD,UAAU;iBACX,CAAC,CACH,CACF,CAAC;gBAEF,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,EACd,eAAe,CAAC,GAAG,EACnB,QAAQ,CACT,CAAC;gBACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,OAAO;YACT,CAAC;YAED,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnB,sEAAsE;YACtE,MAAM,YAAY,GAAG,IAAI,CACvB,KAAK,CACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;gBAChB,KAAK,EAAE;oBACL,GAAG,EAAE,SAAS,CAAC,KAAK;oBACpB,KAAK,EAAE,IAAI;iBACZ;gBACD,UAAU;aACX,CAAC,CACH,CACF,CAAC;YAEF,sEAAsE;YACtE,eAAe;YACf,IAAI,WAAW,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,4BAA4B,EAAE,CAAC;gBAC/B,OAAO;YACT,CAAC;YAED,sEAAsE;YACtE,kCAAkC;YAClC,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,EACd,YAAY,CAAC,GAAG,EAChB,QAAQ,CACT,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;gBAChB,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE;oBACJ,GAAG,EAAE,MAAM,CAAC,MAAM;oBAClB,aAAa,EAAE,EAAE;iBAClB;aACF,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;gBAChB,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,YAAY;aACnB,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,8CAA8C,CAAC,CAAC;YAErE,qCAAqC;YACrC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,OAAO;YACT,CAAC;YAED,6DAA6D;YAC7D,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAEnB,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,GAAG,IAAI,CACvC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;gBAChB,KAAK,EAAE;oBACL,GAAG,EAAE,SAAS,CAAC,KAAK;oBACpB,KAAK,EAAE,QAAQ;iBAChB;gBACD,UAAU;aACX,CAAC,EACF,CAAC,CACF,CAAC;YAEF,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,EACd,YAAY,CAAC,GAAG,EAChB,QAAQ,CACT,CAAC;YAEF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;gBAChB,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,YAAY;aACnB,CAAC,CAAC;YAEH,kEAAkE;YAClE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;gBAChB,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE;oBACJ,GAAG,EAAE,MAAM,CAAC,GAAG;oBACf,aAAa,EAAE,EAAE;iBAClB;aACF,CAAC,CAAC;YAEH,OAAO;QACT,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,8CAA8C,CAAC,CAAC;YAErE,oCAAoC;YACpC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,OAAO;YACT,CAAC;YAED,+CAA+C;YAE/C,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAEnB,wEAAwE;YACxE,+BAA+B;YAC/B,MAAM,cAAc,GAAG,IAAI,CACzB,KAAK,CACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;gBAChB,KAAK,EAAE;oBACL,GAAG,EAAE,SAAS,CAAC,KAAK;oBACpB,KAAK,EAAE,OAAO;iBACf;gBACD,UAAU;aACX,CAAC,CACH,CACF,CAAC;YAEF,oDAAoD;YACpD,IAAI,WAAW,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACtD,4BAA4B,EAAE,CAAC;gBAC/B,OAAO;YACT,CAAC;YAED,IAAI,CAAC,aAAa,CAChB,YAAY,EACZ,SAAS,CAAC,IAAI,EACd,cAAc,CAAC,GAAG,EAClB,QAAQ,CACT,CAAC;YAEF,kEAAkE;YAClE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;gBAChB,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE;oBACJ,GAAG,EAAE,MAAM,CAAC,MAAM;oBAClB,aAAa,EAAE,EAAE;iBAClB;aACF,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;gBAChB,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,cAAc;aACrB,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,WAAW,EAAE,CAAC;IAChB,CAAC;IAED,aAAa,CACX,YAAoB,EACpB,IAAY,EACZ,KAAsB,EACtB,QAAyB;QAEzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE;YAC9B,IAAI;YACJ,KAAK;SACN,CAAC,CAAC;QACH,IACE,KAAK,KAAK,SAAS;YACnB,CAAC,QAAQ,KAAK,SAAS;gBACrB,IAAI,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EACpD,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,OAAO;QACL,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;CACF;AAED,SAAS,eAAe,CAAC,cAAqB;IAC5C,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,kBAAkB,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;AACtE,CAAC"}

package/out/zql/src/zql/query/query-impl.d.ts

@@ -0,0 +1,45 @@
+import type { AST } from '../ast/ast.js';
+import { type BuilderDelegate } from '../builder/builder.js';
+import { type Format } from '../ivm/array-view.js';
+import type { AddSelections, AddSubselect, DefaultQueryResultRow, GetFieldTypeNoNullOrUndefined, MakeSingular, Operator, Parameter, Query, QueryType, SchemaToRow, Selector, Smash } from './query.js';
+import { type PullSchemaForRelationship, type TableSchema } from './schema.js';
+import type { TypedView } from './typed-view.js';
+export declare function newQuery<TSchema extends TableSchema, TReturn extends QueryType = DefaultQueryResultRow<TSchema>>(delegate: QueryDelegate, tableSchema: TSchema): Query<TSchema, TReturn>;
+export type CommitListener = () => void;
+export interface QueryDelegate extends BuilderDelegate {
+    addServerQuery(ast: AST): () => void;
+    onTransactionCommit(cb: CommitListener): () => void;
+}
+export declare function staticParam<TAnchor, TField extends keyof TAnchor>(anchorClass: 'authData' | 'preMutationRow', field: TField): Parameter<TAnchor, TField, TAnchor[TField]>;
+export declare abstract class AbstractQuery<TSchema extends TableSchema, TReturn extends QueryType = DefaultQueryResultRow<TSchema>> implements Query<TSchema, TReturn> {
+    #private;
+    constructor(schema: TSchema, ast?: AST | undefined, format?: Format | undefined);
+    get ast(): AST;
+    select<TFields extends Selector<TSchema>[]>(..._fields: TFields): Query<TSchema, AddSelections<TSchema, TFields, TReturn>>;
+    protected abstract _newQuery<TSchema extends TableSchema, TReturn extends QueryType>(schema: TSchema, ast: AST, format: Format | undefined): Query<TSchema, TReturn>;
+    one(): Query<TSchema, MakeSingular<TReturn>>;
+    related<TRelationship extends keyof TSchema['relationships']>(relationship: TRelationship): Query<TSchema, AddSubselect<Query<PullSchemaForRelationship<TSchema, TRelationship>, DefaultQueryResultRow<PullSchemaForRelationship<TSchema, TRelationship>>>, TReturn, TRelationship & string>>;
+    where(field: any, opOrValue: Operator | GetFieldTypeNoNullOrUndefined<any, any, any> | Parameter<any, any, any>, value?: GetFieldTypeNoNullOrUndefined<any, any, any> | Parameter<any, any, any>): Query<TSchema, TReturn>;
+    start(row: Partial<SchemaToRow<TSchema>>, opts?: {
+        inclusive: boolean;
+    } | undefined): Query<TSchema, TReturn>;
+    limit(limit: number): Query<TSchema, TReturn>;
+    orderBy<TSelector extends keyof TSchema['columns']>(field: TSelector, direction: 'asc' | 'desc'): Query<TSchema, TReturn>;
+    protected _completeAst(): AST;
+    abstract materialize(): TypedView<Smash<TReturn>>;
+    abstract preload(): {
+        cleanup: () => void;
+    };
+}
+export declare class QueryImpl<TSchema extends TableSchema, TReturn extends QueryType = DefaultQueryResultRow<TSchema>> extends AbstractQuery<TSchema, TReturn> {
+    #private;
+    constructor(delegate: QueryDelegate, schema: TSchema, ast?: AST | undefined, format?: Format | undefined);
+    get format(): Format;
+    get singular(): TReturn['singular'];
+    protected _newQuery<TSchema extends TableSchema, TReturn extends QueryType>(schema: TSchema, ast: AST, format: Format | undefined): Query<TSchema, TReturn>;
+    materialize(): TypedView<Smash<TReturn>>;
+    preload(): {
+        cleanup: () => void;
+    };
+}
+//# sourceMappingURL=query-impl.d.ts.map

package/out/zql/src/zql/query/query-impl.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-impl.d.ts","sourceRoot":"","sources":["../../../../../../zql/src/zql/query/query-impl.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAC,GAAG,EAAW,MAAM,eAAe,CAAC;AACjD,OAAO,EAAC,KAAK,eAAe,EAAgB,MAAM,uBAAuB,CAAC;AAC1E,OAAO,EAAY,KAAK,MAAM,EAAC,MAAM,sBAAsB,CAAC;AAE5D,OAAO,KAAK,EACV,aAAa,EACb,YAAY,EACZ,qBAAqB,EACrB,6BAA6B,EAC7B,YAAY,EACZ,QAAQ,EACR,SAAS,EACT,KAAK,EACL,SAAS,EACT,WAAW,EACX,QAAQ,EACR,KAAK,EACN,MAAM,YAAY,CAAC;AACpB,OAAO,EAIL,KAAK,yBAAyB,EAC9B,KAAK,WAAW,EACjB,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAE/C,wBAAgB,QAAQ,CACtB,OAAO,SAAS,WAAW,EAC3B,OAAO,SAAS,SAAS,GAAG,qBAAqB,CAAC,OAAO,CAAC,EAC1D,QAAQ,EAAE,aAAa,EAAE,WAAW,EAAE,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAExE;AAcD,MAAM,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC;AACxC,MAAM,WAAW,aAAc,SAAQ,eAAe;IACpD,cAAc,CAAC,GAAG,EAAE,GAAG,GAAG,MAAM,IAAI,CAAC;IACrC,mBAAmB,CAAC,EAAE,EAAE,cAAc,GAAG,MAAM,IAAI,CAAC;CACrD;AAED,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,SAAS,MAAM,OAAO,EAC/D,WAAW,EAAE,UAAU,GAAG,gBAAgB,EAC1C,KAAK,EAAE,MAAM,GACZ,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAM7C;AAED,8BAAsB,aAAa,CACjC,OAAO,SAAS,WAAW,EAC3B,OAAO,SAAS,SAAS,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAC1D,YAAW,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC;;gBAOhC,MAAM,EAAE,OAAO,EACf,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,EACrB,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS;IAS7B,IAAI,GAAG,QAEN;IAED,MAAM,CAAC,OAAO,SAAS,QAAQ,CAAC,OAAO,CAAC,EAAE,EACxC,GAAG,OAAO,EAAE,OAAO,GAClB,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAK3D,SAAS,CAAC,QAAQ,CAAC,SAAS,CAC1B,OAAO,SAAS,WAAW,EAC3B,OAAO,SAAS,SAAS,EAEzB,MAAM,EAAE,OAAO,EACf,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,GAAG,SAAS,GACzB,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC;IAc5C,OAAO,CAAC,aAAa,SAAS,MAAM,OAAO,CAAC,eAAe,CAAC,EAC1D,YAAY,EAAE,aAAa,GAC1B,KAAK,CACN,OAAO,EACP,YAAY,CACV,KAAK,CACH,yBAAyB,CAAC,OAAO,EAAE,aAAa,CAAC,EACjD,qBAAqB,CAAC,yBAAyB,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CACzE,EACD,OAAO,EACP,aAAa,GAAG,MAAM,CACvB,CACF;IAgHD,KAAK,CACH,KAAK,EAAE,GAAG,EACV,SAAS,EACL,QAAQ,GACR,6BAA6B,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAC5C,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAC5B,KAAK,CAAC,EACF,6BAA6B,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAC5C,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAC3B,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC;IA2B1B,KAAK,CACH,GAAG,EAAE,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,EAClC,IAAI,CAAC,EAAE;QAAC,SAAS,EAAE,OAAO,CAAA;KAAC,GAAG,SAAS,GACtC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC;IAc1B,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC;IAkB7C,OAAO,CAAC,SAAS,SAAS,MAAM,OAAO,CAAC,SAAS,CAAC,EAChD,KAAK,EAAE,SAAS,EAChB,SAAS,EAAE,KAAK,GAAG,MAAM,GACxB,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC;IAW1B,SAAS,CAAC,YAAY,IAAI,GAAG;IAuB7B,QAAQ,CAAC,WAAW,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjD,QAAQ,CAAC,OAAO,IAAI;QAClB,OAAO,EAAE,MAAM,IAAI,CAAC;KACrB;CACF;AAED,qBAAa,SAAS,CACpB,OAAO,SAAS,WAAW,EAC3B,OAAO,SAAS,SAAS,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAC1D,SAAQ,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;;gBAKrC,QAAQ,EAAE,aAAa,EACvB,MAAM,EAAE,OAAO,EACf,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,EACrB,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS;IAO7B,IAAI,MAAM,WAET;IAED,IAAI,QAAQ,IAAI,OAAO,CAAC,UAAU,CAAC,CAElC;IAED,SAAS,CAAC,SAAS,CAAC,OAAO,SAAS,WAAW,EAAE,OAAO,SAAS,SAAS,EACxE,MAAM,EAAE,OAAO,EACf,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,GAAG,SAAS,GACzB,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC;IAI1B,WAAW,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAiBxC,OAAO,IAAI;QACT,OAAO,EAAE,MAAM,IAAI,CAAC;KACrB;CAOF"}

package/out/zql/src/zql/query/query.d.ts

@@ -0,0 +1,130 @@
+import type { Row } from '../ivm/data.js';
+import type { SchemaValue } from '../ivm/schema.js';
+import type { Source } from '../ivm/source.js';
+import type { PullSchemaForRelationship, TableSchema } from './schema.js';
+import type { TypedView } from './typed-view.js';
+/**
+ * The type that can be passed into `select()`. A selector
+ * references a field on an row.
+ */
+export type Selector<E extends TableSchema> = keyof E['columns'];
+export type Context = {
+    getSource: (name: string) => Source;
+    createStorage: () => Storage;
+};
+export type Smash<T extends QueryType> = T['singular'] extends true ? SmashOne<T> : Array<SmashOne<T>>;
+type SmashOne<T extends QueryType> = T['row'] & {
+    [K in keyof T['related']]: T['related'][K] extends QueryType ? Smash<T['related'][K]> : never;
+};
+/**
+ * Given a schema value, return the TypeScript type.
+ *
+ * This allows us to create the correct return type for a
+ * query that has a selection.
+ */
+type SchemaValueToTSType<T extends SchemaValue> = (T extends {
+    type: 'string';
+} ? string : T extends {
+    type: 'number';
+} ? number : T extends {
+    type: 'boolean';
+} ? boolean : T extends {
+    type: 'null';
+} ? null : never) | (T extends {
+    optional: true;
+} ? undefined : never);
+export type GetFieldTypeNoNullOrUndefined<TSchema extends TableSchema, TColumn extends keyof TSchema['columns'], TOperator extends Operator> = TOperator extends 'IN' | 'NOT IN' ? Exclude<SchemaValueToTSType<TSchema['columns'][TColumn]>, null | undefined>[] : Exclude<SchemaValueToTSType<TSchema['columns'][TColumn]>, null | undefined>;
+export type SchemaToRow<T extends TableSchema> = {
+    [K in keyof T['columns']]: SchemaValueToTSType<T['columns'][K]>;
+};
+export type QueryReturnType<T extends Query<TableSchema>> = T extends Query<TableSchema, infer TReturn> ? Smash<TReturn> : never;
+export type QueryRowType<T extends Query<any, any>> = QueryReturnType<T>[number];
+/**
+ * A query can have:
+ * 1. Selections and
+ * 2. Subqueries
+ *
+ * The composition of these two yields the return type
+ * of the query.
+ *
+ * This takes a return type of a query (TReturn), a schema type (TSchema),
+ * and a list of selections (TSelections) made against that row,
+ * returning a new return type with the selections added.
+ *
+ * `.select('foo')` would add `foo` to `TReturn`.
+ */
+export type AddSelections<TSchema extends TableSchema, TSelections extends Selector<TSchema>[], TReturn extends QueryType> = {
+    row: {
+        [K in TSelections[number]]: SchemaValueToTSType<TSchema['columns'][K]>;
+    };
+    related: TReturn['related'];
+    singular: TReturn['singular'];
+};
+export type AddSubselect<TSubquery extends Query<TableSchema>, TReturn extends QueryType, TAs extends string> = {
+    row: TReturn['row'];
+    related: {
+        [K in TAs]: InferSubreturn<TSubquery>;
+    } & TReturn['related'];
+    singular: TReturn['singular'];
+};
+export type MakeSingular<TReturn extends QueryType> = {
+    row: TReturn['row'];
+    related: TReturn['related'];
+    singular: true;
+};
+type InferSubreturn<TSubquery> = TSubquery extends Query<TableSchema, infer TSubreturn> ? TSubreturn : EmptyQueryResultRow;
+/**
+ * Encodes the internal "type" of the query. This is different than the schema,
+ * and different than the result type. The schema is the input type from the
+ * database of the table the query started from.
+ *
+ * The result type is the output type of the query after the 'row' and 'related'
+ * fields have been smashed down.
+ */
+export type QueryType = {
+    row: Row;
+    related: Record<string, QueryType>;
+    singular: boolean;
+};
+type EmptyQueryResultRow = {
+    row: {};
+    related: {};
+};
+export type Operator = '=' | '!=' | '<' | '<=' | '>' | '>=' | 'IN' | 'NOT IN' | 'LIKE' | 'ILIKE';
+export type DefaultQueryResultRow<TSchema extends TableSchema> = {
+    row: {
+        [K in keyof TSchema['columns']]: SchemaValueToTSType<TSchema['columns'][K]>;
+    };
+    related: {};
+    singular: false;
+};
+/** Expands/simplifies */
+type Expand<T> = T extends infer O ? {
+    [K in keyof O]: O[K];
+} : never;
+export type Parameter<T, TField extends keyof T, _TReturn = T[TField]> = {
+    type: 'static';
+    anchor: 'authData' | 'preMutationRow';
+    field: TField;
+};
+export interface Query<TSchema extends TableSchema, TReturn extends QueryType = DefaultQueryResultRow<TSchema>> {
+    select<TFields extends Selector<TSchema>[]>(...columnName: Expand<TFields>): Query<TSchema, AddSelections<TSchema, TFields, TReturn>>;
+    related<TRelationship extends keyof TSchema['relationships']>(relationship: TRelationship): Query<TSchema, AddSubselect<Query<PullSchemaForRelationship<TSchema, TRelationship>, DefaultQueryResultRow<PullSchemaForRelationship<TSchema, TRelationship>>>, TReturn, TRelationship & string>>;
+    related<TRelationship extends keyof TSchema['relationships'], TSub extends Query<any, any>>(relationship: TRelationship, cb: (query: Query<PullSchemaForRelationship<TSchema, TRelationship>, DefaultQueryResultRow<PullSchemaForRelationship<TSchema, TRelationship>>>) => TSub): Query<TSchema, AddSubselect<TSub, TReturn, TRelationship & string>>;
+    where<TSelector extends Selector<TSchema>, TOperator extends Operator>(field: TSelector, op: TOperator, value: GetFieldTypeNoNullOrUndefined<TSchema, TSelector, TOperator>): Query<TSchema, TReturn>;
+    where<TSelector extends Selector<TSchema>>(field: TSelector, value: GetFieldTypeNoNullOrUndefined<TSchema, TSelector, '='>): Query<TSchema, TReturn>;
+    where<TSelector extends Selector<TSchema>, TOperator extends Operator, TParamAnchor, TParamField extends keyof TParamAnchor, TParamTypeBound extends GetFieldTypeNoNullOrUndefined<TSchema, TSelector, TOperator>>(field: TSelector, op: TOperator, value: Parameter<TParamAnchor, TParamField, TParamTypeBound>): Query<TSchema, TReturn>;
+    where<TSelector extends Selector<TSchema>, TParamAnchor, TParamField extends keyof TParamAnchor, TParamTypeBound extends GetFieldTypeNoNullOrUndefined<TSchema, TSelector, '='>>(field: TSelector, value: Parameter<TParamAnchor, TParamField, TParamTypeBound>): Query<TSchema, TReturn>;
+    start(row: Partial<SchemaToRow<TSchema>>, opts?: {
+        inclusive: boolean;
+    } | undefined): Query<TSchema, TReturn>;
+    limit(limit: number): Query<TSchema, TReturn>;
+    orderBy<TSelector extends Selector<TSchema>>(field: TSelector, direction: 'asc' | 'desc'): Query<TSchema, TReturn>;
+    one(): Query<TSchema, MakeSingular<TReturn>>;
+    materialize(): TypedView<Smash<TReturn>>;
+    preload(): {
+        cleanup: () => void;
+    };
+}
+export {};
+//# sourceMappingURL=query.d.ts.map