flowquery 1.0.69 → 1.0.71

package/dist/parsing/operations/merge.d.ts

@@ -0,0 +1,158 @@
+import ASTNode from "../ast_node";
+import Expression from "../expressions/expression";
+import Operation from "./operation";
+/**
+ * One item in the `WHEN MATCHED THEN UPDATE SET` list.
+ *
+ * `field` is the name of the field on the matched target row to
+ * overwrite; `expression` is the value to assign.  When `expression`
+ * is `null`, the default is `source.<field>` — i.e. the value of the
+ * same-named field on the current incoming row.  This makes the
+ * partial-merge case (`SET .name, .email`) ergonomic without having to
+ * write `SET .name = source.name, .email = source.email`.
+ */
+export interface MergeSetItem {
+    field: string;
+    expression: Expression | null;
+}
+/**
+ * The action taken when an incoming source row matches an existing
+ * target row.  Either rewrite specific fields (`update`) or remove
+ * the matched target row (`delete`).
+ */
+export type MergeMatchedAction = {
+    type: "update";
+    setItems: MergeSetItem[];
+} | {
+    type: "delete";
+};
+/**
+ * The action taken when an incoming source row matches no existing
+ * target row.  Inserts the row produced by `expression`, or the bare
+ * source row if `expression` is `null` (the implicit-insert default).
+ */
+export interface MergeNotMatchedAction {
+    type: "insert";
+    expression: Expression | null;
+}
+/**
+ * The `ON` clause: either a short-form list of key fields (matched
+ * positionally against the source row by name) or an arbitrary
+ * predicate evaluated per (target, source) pair.
+ */
+export type MergeOnClause = {
+    type: "keys";
+    keys: string[];
+} | {
+    type: "predicate";
+    predicate: Expression;
+};
+/**
+ * `MERGE INTO <name> [AS <target>] USING <source-rhs> [AS <source>]
+ *      ON ( <key> | (<k1>, <k2>, …) | <predicate> )
+ *      [ WHEN MATCHED THEN UPDATE SET <set-list> ]
+ *      [ WHEN MATCHED THEN DELETE ]
+ *      [ WHEN NOT MATCHED THEN INSERT [<expr>] ]`
+ *
+ * SQL-MERGE-style upsert into an existing list-binding.  The source
+ * may be any expression, sub-query, or bare binding name; both the
+ * `target` and `source` aliases are in scope inside the `ON`
+ * predicate and any `SET .field = <expr>` / `INSERT <expr>`
+ * expressions, allowing per-pair computation across both sides.
+ *
+ * Execution semantics:
+ *
+ * - The source RHS is evaluated once to produce a list of rows.
+ * - For each source row, the target list is scanned for a matching
+ *   row using the `ON` clause.
+ * - If a match is found and a `WHEN MATCHED` branch is present, that
+ *   branch is applied (rewriting the matched target row in place, or
+ *   removing it).  Without a `WHEN MATCHED` branch, the source row is
+ *   silently ignored.
+ * - If no match is found and a `WHEN NOT MATCHED THEN INSERT` branch
+ *   is present, the row is appended to the target list.  Without the
+ *   branch, the source row is silently ignored.
+ *
+ * The target binding must already exist (use `LET` to create it).
+ */
+/**
+ * Proxy AST node used by the parser to register the `target` /
+ * `source` alias in the variable scope while parsing the ON
+ * predicate and SET / INSERT expressions.  Resolves to the row
+ * currently exposed by the owning Merge instance.
+ */
+export declare class MergeTargetAlias extends ASTNode {
+    private _merge;
+    constructor(merge: Merge);
+    value(): any;
+}
+export declare class MergeSourceAlias extends ASTNode {
+    private _merge;
+    constructor(merge: Merge);
+    value(): any;
+}
+declare class Merge extends Operation {
+    private _name;
+    private _targetAlias;
+    private _sourceAlias;
+    private _onClause;
+    private _matched;
+    private _notMatched;
+    private _sourceExpression;
+    private _sourceSubQuery;
+    /**
+     * The target row currently in scope (during ON / SET / INSERT
+     * evaluation).  `undefined` for `WHEN NOT MATCHED` rows.
+     */
+    private _currentTarget;
+    /**
+     * The source row currently in scope (during ON / SET / INSERT
+     * evaluation).
+     */
+    private _currentSource;
+    /** The last value written back to the binding (for `results`). */
+    private _value;
+    constructor(name: string, targetAlias: string | null, sourceAlias: string | null, sourceExpression: Expression | null, sourceSubQuery: ASTNode | null, onClause: MergeOnClause, matched: MergeMatchedAction | null, notMatched: MergeNotMatchedAction | null);
+    /**
+     * Replaces the placeholder ON clause and matched / not-matched
+     * actions with their parsed counterparts (used by the parser,
+     * which must register the operation in its variable scope before
+     * parsing those expressions so that the target / source aliases
+     * resolve to this node).
+     */
+    setClauses(onClause: MergeOnClause, matched: MergeMatchedAction | null, notMatched: MergeNotMatchedAction | null): void;
+    get name(): string;
+    get targetAlias(): string | null;
+    get sourceAlias(): string | null;
+    get sourceExpression(): Expression | null;
+    get sourceSubQuery(): ASTNode | null;
+    get onClause(): MergeOnClause;
+    get matched(): MergeMatchedAction | null;
+    get notMatched(): MergeNotMatchedAction | null;
+    /**
+     * Returns the row currently in scope for the given alias.  This is
+     * what {@link Reference}.value() resolves to when the target /
+     * source alias is referenced inside the ON predicate or in a
+     * SET / INSERT expression.  The parser stamps an aliasContext on
+     * the proxy AST nodes it registers in the variable scope so we
+     * can disambiguate without name comparison.
+     */
+    targetValue(): any;
+    sourceValue(): any;
+    run(): Promise<void>;
+    /**
+     * Finds the first index in `target` (skipping tombstones) for
+     * which the ON clause holds against the current source row.  The
+     * source row is already exposed via {@link sourceValue}.
+     */
+    private findMatch;
+    /**
+     * Builds the next value for a matched target row by applying the
+     * `SET <set-list>` items.  Items without an explicit expression
+     * default to `source.<field>`.
+     */
+    private applySet;
+    get results(): Record<string, any>[];
+}
+export default Merge;
+//# sourceMappingURL=merge.d.ts.map

package/dist/parsing/operations/merge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.d.ts","sourceRoot":"","sources":["../../../src/parsing/operations/merge.ts"],"names":[],"mappings":"AACA,OAAO,OAAO,MAAM,aAAa,CAAC;AAClC,OAAO,UAAU,MAAM,2BAA2B,CAAC;AACnD,OAAO,SAAS,MAAM,aAAa,CAAC;AAEpC;;;;;;;;;GASG;AACH,MAAM,WAAW,YAAY;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC;CACjC;AAED;;;;GAIG;AACH,MAAM,MAAM,kBAAkB,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC;AAEnG;;;;GAIG;AACH,MAAM,WAAW,qBAAqB;IAClC,IAAI,EAAE,QAAQ,CAAC;IACf,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC;CACjC;AAED;;;;GAIG;AACH,MAAM,MAAM,aAAa,GACnB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,SAAS,EAAE,UAAU,CAAA;CAAE,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH;;;;;GAKG;AACH,qBAAa,gBAAiB,SAAQ,OAAO;IACzC,OAAO,CAAC,MAAM,CAAQ;gBACV,KAAK,EAAE,KAAK;IAIjB,KAAK,IAAI,GAAG;CAGtB;AAED,qBAAa,gBAAiB,SAAQ,OAAO;IACzC,OAAO,CAAC,MAAM,CAAQ;gBACV,KAAK,EAAE,KAAK;IAIjB,KAAK,IAAI,GAAG;CAGtB;AAED,cAAM,KAAM,SAAQ,SAAS;IACzB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,YAAY,CAAgB;IACpC,OAAO,CAAC,YAAY,CAAgB;IACpC,OAAO,CAAC,SAAS,CAAgB;IACjC,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,CAAC,WAAW,CAA+B;IAClD,OAAO,CAAC,iBAAiB,CAAoB;IAC7C,OAAO,CAAC,eAAe,CAAiB;IAExC;;;OAGG;IACH,OAAO,CAAC,cAAc,CAAkB;IACxC;;;OAGG;IACH,OAAO,CAAC,cAAc,CAAkB;IAExC,kEAAkE;IAClE,OAAO,CAAC,MAAM,CAAa;gBAGvB,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,MAAM,GAAG,IAAI,EAC1B,WAAW,EAAE,MAAM,GAAG,IAAI,EAC1B,gBAAgB,EAAE,UAAU,GAAG,IAAI,EACnC,cAAc,EAAE,OAAO,GAAG,IAAI,EAC9B,QAAQ,EAAE,aAAa,EACvB,OAAO,EAAE,kBAAkB,GAAG,IAAI,EAClC,UAAU,EAAE,qBAAqB,GAAG,IAAI;IAgC5C;;;;;;OAMG;IACI,UAAU,CACb,QAAQ,EAAE,aAAa,EACvB,OAAO,EAAE,kBAAkB,GAAG,IAAI,EAClC,UAAU,EAAE,qBAAqB,GAAG,IAAI,GACzC,IAAI;IAmBP,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,WAAW,IAAI,MAAM,GAAG,IAAI,CAEtC;IAED,IAAW,WAAW,IAAI,MAAM,GAAG,IAAI,CAEtC;IAED,IAAW,gBAAgB,IAAI,UAAU,GAAG,IAAI,CAE/C;IAED,IAAW,cAAc,IAAI,OAAO,GAAG,IAAI,CAE1C;IAED,IAAW,QAAQ,IAAI,aAAa,CAEnC;IAED,IAAW,OAAO,IAAI,kBAAkB,GAAG,IAAI,CAE9C;IAED,IAAW,UAAU,IAAI,qBAAqB,GAAG,IAAI,CAEpD;IAED;;;;;;;OAOG;IACI,WAAW,IAAI,GAAG;IAIlB,WAAW,IAAI,GAAG;IAIZ,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;IAgFjC;;;;OAIG;IACH,OAAO,CAAC,SAAS;IAkDjB;;;;OAIG;IACH,OAAO,CAAC,QAAQ;IAoBhB,IAAW,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAE1C;CACJ;AAED,eAAe,KAAK,CAAC"}

package/dist/parsing/operations/merge.js

@@ -0,0 +1,338 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MergeSourceAlias = exports.MergeTargetAlias = void 0;
+const bindings_1 = __importDefault(require("../../graph/bindings"));
+const ast_node_1 = __importDefault(require("../ast_node"));
+const operation_1 = __importDefault(require("./operation"));
+/**
+ * `MERGE INTO <name> [AS <target>] USING <source-rhs> [AS <source>]
+ *      ON ( <key> | (<k1>, <k2>, …) | <predicate> )
+ *      [ WHEN MATCHED THEN UPDATE SET <set-list> ]
+ *      [ WHEN MATCHED THEN DELETE ]
+ *      [ WHEN NOT MATCHED THEN INSERT [<expr>] ]`
+ *
+ * SQL-MERGE-style upsert into an existing list-binding.  The source
+ * may be any expression, sub-query, or bare binding name; both the
+ * `target` and `source` aliases are in scope inside the `ON`
+ * predicate and any `SET .field = <expr>` / `INSERT <expr>`
+ * expressions, allowing per-pair computation across both sides.
+ *
+ * Execution semantics:
+ *
+ * - The source RHS is evaluated once to produce a list of rows.
+ * - For each source row, the target list is scanned for a matching
+ *   row using the `ON` clause.
+ * - If a match is found and a `WHEN MATCHED` branch is present, that
+ *   branch is applied (rewriting the matched target row in place, or
+ *   removing it).  Without a `WHEN MATCHED` branch, the source row is
+ *   silently ignored.
+ * - If no match is found and a `WHEN NOT MATCHED THEN INSERT` branch
+ *   is present, the row is appended to the target list.  Without the
+ *   branch, the source row is silently ignored.
+ *
+ * The target binding must already exist (use `LET` to create it).
+ */
+/**
+ * Proxy AST node used by the parser to register the `target` /
+ * `source` alias in the variable scope while parsing the ON
+ * predicate and SET / INSERT expressions.  Resolves to the row
+ * currently exposed by the owning Merge instance.
+ */
+class MergeTargetAlias extends ast_node_1.default {
+    constructor(merge) {
+        super();
+        this._merge = merge;
+    }
+    value() {
+        return this._merge.targetValue();
+    }
+}
+exports.MergeTargetAlias = MergeTargetAlias;
+class MergeSourceAlias extends ast_node_1.default {
+    constructor(merge) {
+        super();
+        this._merge = merge;
+    }
+    value() {
+        return this._merge.sourceValue();
+    }
+}
+exports.MergeSourceAlias = MergeSourceAlias;
+class Merge extends operation_1.default {
+    constructor(name, targetAlias, sourceAlias, sourceExpression, sourceSubQuery, onClause, matched, notMatched) {
+        super();
+        /**
+         * The target row currently in scope (during ON / SET / INSERT
+         * evaluation).  `undefined` for `WHEN NOT MATCHED` rows.
+         */
+        this._currentTarget = undefined;
+        /**
+         * The source row currently in scope (during ON / SET / INSERT
+         * evaluation).
+         */
+        this._currentSource = undefined;
+        /** The last value written back to the binding (for `results`). */
+        this._value = [];
+        this._name = name;
+        this._targetAlias = targetAlias;
+        this._sourceAlias = sourceAlias;
+        this._sourceExpression = sourceExpression;
+        this._sourceSubQuery = sourceSubQuery;
+        this._onClause = onClause;
+        this._matched = matched;
+        this._notMatched = notMatched;
+        if (sourceExpression !== null) {
+            this.addChild(sourceExpression);
+        }
+        if (sourceSubQuery !== null) {
+            this.addChild(sourceSubQuery);
+        }
+        if (onClause.type === "predicate") {
+            this.addChild(onClause.predicate);
+        }
+        if (matched !== null && matched.type === "update") {
+            for (const item of matched.setItems) {
+                if (item.expression !== null) {
+                    this.addChild(item.expression);
+                }
+            }
+        }
+        if (notMatched !== null && notMatched.expression !== null) {
+            this.addChild(notMatched.expression);
+        }
+    }
+    /**
+     * Replaces the placeholder ON clause and matched / not-matched
+     * actions with their parsed counterparts (used by the parser,
+     * which must register the operation in its variable scope before
+     * parsing those expressions so that the target / source aliases
+     * resolve to this node).
+     */
+    setClauses(onClause, matched, notMatched) {
+        this._onClause = onClause;
+        this._matched = matched;
+        this._notMatched = notMatched;
+        if (onClause.type === "predicate") {
+            this.addChild(onClause.predicate);
+        }
+        if (matched !== null && matched.type === "update") {
+            for (const item of matched.setItems) {
+                if (item.expression !== null) {
+                    this.addChild(item.expression);
+                }
+            }
+        }
+        if (notMatched !== null && notMatched.expression !== null) {
+            this.addChild(notMatched.expression);
+        }
+    }
+    get name() {
+        return this._name;
+    }
+    get targetAlias() {
+        return this._targetAlias;
+    }
+    get sourceAlias() {
+        return this._sourceAlias;
+    }
+    get sourceExpression() {
+        return this._sourceExpression;
+    }
+    get sourceSubQuery() {
+        return this._sourceSubQuery;
+    }
+    get onClause() {
+        return this._onClause;
+    }
+    get matched() {
+        return this._matched;
+    }
+    get notMatched() {
+        return this._notMatched;
+    }
+    /**
+     * Returns the row currently in scope for the given alias.  This is
+     * what {@link Reference}.value() resolves to when the target /
+     * source alias is referenced inside the ON predicate or in a
+     * SET / INSERT expression.  The parser stamps an aliasContext on
+     * the proxy AST nodes it registers in the variable scope so we
+     * can disambiguate without name comparison.
+     */
+    targetValue() {
+        return this._currentTarget;
+    }
+    sourceValue() {
+        return this._currentSource;
+    }
+    run() {
+        return __awaiter(this, void 0, void 0, function* () {
+            var _a;
+            const bindings = bindings_1.default.getInstance();
+            if (!bindings.has(this._name)) {
+                throw new Error(`Binding '${this._name}' is not defined; use LET to create it`);
+            }
+            if (bindings.isRefreshable(this._name)) {
+                throw new Error(`Binding '${this._name}' is refreshable; use REFRESH BINDING ${this._name} to re-evaluate or DROP BINDING ${this._name} first`);
+            }
+            const existing = bindings.get(this._name);
+            if (!Array.isArray(existing)) {
+                throw new Error(`MERGE INTO ${this._name} requires '${this._name}' to be a list`);
+            }
+            // Evaluate source once.
+            let source;
+            if (this._sourceSubQuery !== null) {
+                const first = this._sourceSubQuery.firstChild();
+                const last = this._sourceSubQuery.lastChild();
+                yield first.initialize();
+                yield first.run();
+                yield first.finish();
+                source = last.results;
+            }
+            else if (this._sourceExpression !== null) {
+                source = this._sourceExpression.value();
+            }
+            else {
+                source = null;
+            }
+            if (!Array.isArray(source)) {
+                throw new Error(`MERGE INTO ${this._name} USING … requires the source to evaluate to a list of rows`);
+            }
+            // Working copy of the target list; mutations are applied in
+            // place and a final assignment writes it back to the binding.
+            const result = existing.slice();
+            // Tombstone marker for delete actions; we sweep at the end so
+            // that intra-merge index lookups remain stable.
+            const tombstones = new Set();
+            for (const sourceRow of source) {
+                this._currentSource = sourceRow;
+                const matchedIndex = this.findMatch(result, tombstones, sourceRow);
+                if (matchedIndex !== -1) {
+                    this._currentTarget = result[matchedIndex];
+                    if (this._matched !== null) {
+                        if (this._matched.type === "delete") {
+                            tombstones.add(matchedIndex);
+                        }
+                        else {
+                            result[matchedIndex] = this.applySet(result[matchedIndex], this._matched.setItems);
+                        }
+                    }
+                    this._currentTarget = undefined;
+                }
+                else {
+                    if (this._notMatched !== null) {
+                        const inserted = this._notMatched.expression !== null
+                            ? this._notMatched.expression.value()
+                            : sourceRow;
+                        result.push(inserted);
+                    }
+                }
+            }
+            this._currentSource = undefined;
+            const swept = [];
+            for (let i = 0; i < result.length; i++) {
+                if (!tombstones.has(i)) {
+                    swept.push(result[i]);
+                }
+            }
+            bindings.set(this._name, swept);
+            this._value = swept;
+            yield ((_a = this.next) === null || _a === void 0 ? void 0 : _a.run());
+        });
+    }
+    /**
+     * Finds the first index in `target` (skipping tombstones) for
+     * which the ON clause holds against the current source row.  The
+     * source row is already exposed via {@link sourceValue}.
+     */
+    findMatch(target, tombstones, sourceRow) {
+        if (this._onClause.type === "keys") {
+            const keys = this._onClause.keys;
+            // Source row must be an object with all keys defined; if not,
+            // it cannot match anything and falls through to NOT MATCHED.
+            if (sourceRow === null || typeof sourceRow !== "object") {
+                return -1;
+            }
+            for (const k of keys) {
+                if (!(k in sourceRow)) {
+                    return -1;
+                }
+            }
+            for (let i = 0; i < target.length; i++) {
+                if (tombstones.has(i)) {
+                    continue;
+                }
+                const t = target[i];
+                if (t === null || typeof t !== "object") {
+                    continue;
+                }
+                let matches = true;
+                for (const k of keys) {
+                    if (!(k in t) || t[k] !== sourceRow[k]) {
+                        matches = false;
+                        break;
+                    }
+                }
+                if (matches) {
+                    return i;
+                }
+            }
+            return -1;
+        }
+        // Predicate ON — evaluate per (target, source) pair.
+        for (let i = 0; i < target.length; i++) {
+            if (tombstones.has(i)) {
+                continue;
+            }
+            this._currentTarget = target[i];
+            const ok = this._onClause.predicate.value();
+            if (ok) {
+                this._currentTarget = undefined;
+                return i;
+            }
+        }
+        this._currentTarget = undefined;
+        return -1;
+    }
+    /**
+     * Builds the next value for a matched target row by applying the
+     * `SET <set-list>` items.  Items without an explicit expression
+     * default to `source.<field>`.
+     */
+    applySet(targetRow, setItems) {
+        const base = targetRow !== null && typeof targetRow === "object" ? Object.assign({}, targetRow) : {};
+        for (const item of setItems) {
+            if (item.expression !== null) {
+                base[item.field] = item.expression.value();
+            }
+            else {
+                // Default: copy source.<field> if present, otherwise
+                // leave the existing field untouched.  This makes
+                // `SET .name, .email` behave like the old partial-merge
+                // form (only listed fields overwrite; missing ones
+                // preserve the target's value).
+                const src = this._currentSource;
+                if (src !== null && typeof src === "object" && item.field in src) {
+                    base[item.field] = src[item.field];
+                }
+            }
+        }
+        return base;
+    }
+    get results() {
+        return this._value;
+    }
+}
+exports.default = Merge;
+//# sourceMappingURL=merge.js.map

package/dist/parsing/operations/merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.js","sourceRoot":"","sources":["../../../src/parsing/operations/merge.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;AAAA,oEAA4C;AAC5C,2DAAkC;AAElC,4DAAoC;AA2CpC;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH;;;;;GAKG;AACH,MAAa,gBAAiB,SAAQ,kBAAO;IAEzC,YAAY,KAAY;QACpB,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACxB,CAAC;IACM,KAAK;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;IACrC,CAAC;CACJ;AATD,4CASC;AAED,MAAa,gBAAiB,SAAQ,kBAAO;IAEzC,YAAY,KAAY;QACpB,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACxB,CAAC;IACM,KAAK;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;IACrC,CAAC;CACJ;AATD,4CASC;AAED,MAAM,KAAM,SAAQ,mBAAS;IAwBzB,YACI,IAAY,EACZ,WAA0B,EAC1B,WAA0B,EAC1B,gBAAmC,EACnC,cAA8B,EAC9B,QAAuB,EACvB,OAAkC,EAClC,UAAwC;QAExC,KAAK,EAAE,CAAC;QAxBZ;;;WAGG;QACK,mBAAc,GAAQ,SAAS,CAAC;QACxC;;;WAGG;QACK,mBAAc,GAAQ,SAAS,CAAC;QAExC,kEAAkE;QAC1D,WAAM,GAAU,EAAE,CAAC;QAavB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;QAC1C,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;QACtC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,QAAQ,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;oBAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACnC,CAAC;YACL,CAAC;QACL,CAAC;QACD,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YACxD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACI,UAAU,CACb,QAAuB,EACvB,OAAkC,EAClC,UAAwC;QAExC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,QAAQ,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;oBAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACnC,CAAC;YACL,CAAC;QACL,CAAC;QACD,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YACxD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IAED,IAAW,IAAI;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED,IAAW,WAAW;QAClB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC7B,CAAC;IAED,IAAW,WAAW;QAClB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC7B,CAAC;IAED,IAAW,gBAAgB;QACvB,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAClC,CAAC;IAED,IAAW,cAAc;QACrB,OAAO,IAAI,CAAC,eAAe,CAAC;IAChC,CAAC;IAED,IAAW,QAAQ;QACf,OAAO,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED,IAAW,OAAO;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAED,IAAW,UAAU;QACjB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC5B,CAAC;IAED;;;;;;;OAOG;IACI,WAAW;QACd,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IAEM,WAAW;QACd,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IAEY,GAAG;;;YACZ,MAAM,QAAQ,GAAG,kBAAQ,CAAC,WAAW,EAAE,CAAC;YACxC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC,KAAK,wCAAwC,CAAC,CAAC;YACpF,CAAC;YACD,IAAI,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrC,MAAM,IAAI,KAAK,CACX,YAAY,IAAI,CAAC,KAAK,yCAAyC,IAAI,CAAC,KAAK,mCAAmC,IAAI,CAAC,KAAK,QAAQ,CACjI,CAAC;YACN,CAAC;YACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CAAC,cAAc,IAAI,CAAC,KAAK,cAAc,IAAI,CAAC,KAAK,gBAAgB,CAAC,CAAC;YACtF,CAAC;YACD,wBAAwB;YACxB,IAAI,MAAW,CAAC;YAChB,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAe,CAAC;gBAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAe,CAAC;gBAC3D,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC;gBACzB,MAAM,KAAK,CAAC,GAAG,EAAE,CAAC;gBAClB,MAAM,KAAK,CAAC,MAAM,EAAE,CAAC;gBACrB,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAC1B,CAAC;iBAAM,IAAI,IAAI,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;gBACzC,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACJ,MAAM,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CACX,cAAc,IAAI,CAAC,KAAK,4DAA4D,CACvF,CAAC;YACN,CAAC;YAED,4DAA4D;YAC5D,8DAA8D;YAC9D,MAAM,MAAM,GAAU,QAAQ,CAAC,KAAK,EAAE,CAAC;YACvC,8DAA8D;YAC9D,gDAAgD;YAChD,MAAM,UAAU,GAAgB,IAAI,GAAG,EAAE,CAAC;YAE1C,KAAK,MAAM,SAAS,IAAI,MAAM,EAAE,CAAC;gBAC7B,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;gBAChC,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;gBACnE,IAAI,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;oBACtB,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;oBAC3C,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;wBACzB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;4BAClC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;wBACjC,CAAC;6BAAM,CAAC;4BACJ,MAAM,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,QAAQ,CAChC,MAAM,CAAC,YAAY,CAAC,EACpB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CACzB,CAAC;wBACN,CAAC;oBACL,CAAC;oBACD,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACJ,IAAI,IAAI,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;wBAC5B,MAAM,QAAQ,GACV,IAAI,CAAC,WAAW,CAAC,UAAU,KAAK,IAAI;4BAChC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,EAAE;4BACrC,CAAC,CAAC,SAAS,CAAC;wBACpB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC1B,CAAC;gBACL,CAAC;YACL,CAAC;YACD,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;YAEhC,MAAM,KAAK,GAAU,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,CAAC;YACL,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,MAAM,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,GAAG,EAAE,CAAA,CAAC;QAC3B,CAAC;KAAA;IAED;;;;OAIG;IACK,SAAS,CAAC,MAAa,EAAE,UAAuB,EAAE,SAAc;QACpE,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACjC,8DAA8D;YAC9D,6DAA6D;YAC7D,IAAI,SAAS,KAAK,IAAI,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;gBACtD,OAAO,CAAC,CAAC,CAAC;YACd,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACnB,IAAI,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,EAAE,CAAC;oBACpB,OAAO,CAAC,CAAC,CAAC;gBACd,CAAC;YACL,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,SAAS;gBACb,CAAC;gBACD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;oBACtC,SAAS;gBACb,CAAC;gBACD,IAAI,OAAO,GAAG,IAAI,CAAC;gBACnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;oBACnB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;wBACrC,OAAO,GAAG,KAAK,CAAC;wBAChB,MAAM;oBACV,CAAC;gBACL,CAAC;gBACD,IAAI,OAAO,EAAE,CAAC;oBACV,OAAO,CAAC,CAAC;gBACb,CAAC;YACL,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;QACd,CAAC;QACD,qDAAqD;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,SAAS;YACb,CAAC;YACD,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;YAC5C,IAAI,EAAE,EAAE,CAAC;gBACL,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;gBAChC,OAAO,CAAC,CAAC;YACb,CAAC;QACL,CAAC;QACD,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,OAAO,CAAC,CAAC,CAAC;IACd,CAAC;IAED;;;;OAIG;IACK,QAAQ,CAAC,SAAc,EAAE,QAAwB;QACrD,MAAM,IAAI,GAAG,SAAS,KAAK,IAAI,IAAI,OAAO,SAAS,KAAK,QAAQ,CAAC,CAAC,mBAAM,SAAS,EAAG,CAAC,CAAC,EAAE,CAAC;QACzF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACJ,qDAAqD;gBACrD,kDAAkD;gBAClD,wDAAwD;gBACxD,mDAAmD;gBACnD,gCAAgC;gBAChC,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC;gBAChC,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,IAAI,CAAC,KAAK,IAAI,GAAG,EAAE,CAAC;oBAC/D,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvC,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAW,OAAO;QACd,OAAO,IAAI,CAAC,MAA+B,CAAC;IAChD,CAAC;CACJ;AAED,kBAAe,KAAK,CAAC"}

package/dist/parsing/operations/order_by.d.ts

@@ -43,6 +43,12 @@ declare class OrderBy extends Operation {
      * identifiers in each record.
      */
     sort(records: Record<string, any>[]): Record<string, any>[];
+    /**
+     * Returns the permutation that {@link sort} applies, without
+     * materialising the sorted records.  Used by callers that need to
+     * permute a parallel array (e.g. row-level provenance) in lockstep.
+     */
+    sortIndices(records: Record<string, any>[]): number[];
     /**
      * When used as a standalone operation (after non-aggregate WITH),
      * accumulates records to sort later.

package/dist/parsing/operations/order_by.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"order_by.d.ts","sourceRoot":"","sources":["../../../src/parsing/operations/order_by.ts"],"names":[],"mappings":"AAAA,OAAO,UAAU,MAAM,2BAA2B,CAAC;AAEnD,OAAO,SAAS,MAAM,aAAa,CAAC;AAEpC,MAAM,WAAW,SAAS;IACtB,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;IAC1B,6DAA6D;IAC7D,UAAU,EAAE,UAAU,CAAC;CAC1B;AAED;;;;;;;;;;;;;GAaG;AACH,cAAM,OAAQ,SAAQ,SAAS;IAC3B,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,QAAQ,CAA6B;IAC7C;;;;OAIG;IACH,OAAO,CAAC,SAAS,CAAe;gBAEpB,MAAM,EAAE,SAAS,EAAE;IAK/B,IAAW,MAAM,IAAI,SAAS,EAAE,CAE/B;IAED;;;;OAIG;IACI,eAAe,IAAI,IAAI;IAI9B;;;;;OAKG;IACI,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;IA6ClE;;;OAGG;IACU,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;IAOpB,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAMxC,IAAW,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAE1C;CACJ;AAED,eAAe,OAAO,CAAC"}
+{"version":3,"file":"order_by.d.ts","sourceRoot":"","sources":["../../../src/parsing/operations/order_by.ts"],"names":[],"mappings":"AAAA,OAAO,UAAU,MAAM,2BAA2B,CAAC;AAEnD,OAAO,SAAS,MAAM,aAAa,CAAC;AAEpC,MAAM,WAAW,SAAS;IACtB,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;IAC1B,6DAA6D;IAC7D,UAAU,EAAE,UAAU,CAAC;CAC1B;AAED;;;;;;;;;;;;;GAaG;AACH,cAAM,OAAQ,SAAQ,SAAS;IAC3B,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,QAAQ,CAA6B;IAC7C;;;;OAIG;IACH,OAAO,CAAC,SAAS,CAAe;gBAEpB,MAAM,EAAE,SAAS,EAAE;IAK/B,IAAW,MAAM,IAAI,SAAS,EAAE,CAE/B;IAED;;;;OAIG;IACI,eAAe,IAAI,IAAI;IAI9B;;;;;OAKG;IACI,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;IAKlE;;;;OAIG;IACI,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,MAAM,EAAE;IA6C5D;;;OAGG;IACU,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;IAOpB,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAMxC,IAAW,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAE1C;CACJ;AAED,eAAe,OAAO,CAAC"}

package/dist/parsing/operations/order_by.js

@@ -58,6 +58,15 @@ class OrderBy extends operation_1.default {
      * identifiers in each record.
      */
     sort(records) {
+        const indices = this.sortIndices(records);
+        return indices.map((i) => records[i]);
+    }
+    /**
+     * Returns the permutation that {@link sort} applies, without
+     * materialising the sorted records.  Used by callers that need to
+     * permute a parallel array (e.g. row-level provenance) in lockstep.
+     */
+    sortIndices(records) {
         const useKeys = this._sortKeys.length === records.length;
         // Build an index array so we can sort records and keys together.
         const indices = records.map((_, i) => i);
@@ -104,7 +113,7 @@ class OrderBy extends operation_1.default {
             }
             return 0;
         });
-        return indices.map((i) => records[i]);
+        return indices;
     }
     /**
      * When used as a standalone operation (after non-aggregate WITH),

package/dist/parsing/operations/order_by.js.map

@@ -1 +1 @@
-{"version":3,"file":"order_by.js","sourceRoot":"","sources":["../../../src/parsing/operations/order_by.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AACA,yEAAiD;AACjD,4DAAoC;AAQpC;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAQ,SAAQ,mBAAS;IAU3B,YAAY,MAAmB;QAC3B,KAAK,EAAE,CAAC;QATJ,aAAQ,GAA0B,EAAE,CAAC;QAC7C;;;;WAIG;QACK,cAAS,GAAY,EAAE,CAAC;QAI5B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IAC1B,CAAC;IAED,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACI,eAAe;QAClB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACvE,CAAC;IAED;;;;;OAKG;IACI,IAAI,CAAC,OAA8B;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC;QACzD,iEAAiE;QACjE,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAE5B,6DAA6D;QAC7D,8DAA8D;QAC9D,gEAAgE;QAChE,MAAM,cAAc,GAAsB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC7D,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;YACvC,IAAI,IAAI,YAAY,mBAAS,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC/D,OAAQ,IAAkB,CAAC,UAAU,CAAC;YAC1C,CAAC;YACD,OAAO,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,IAAS,CAAC;gBACd,IAAI,IAAS,CAAC;gBACd,IAAI,OAAO,EAAE,CAAC;oBACV,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;qBAAM,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBACpC,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC,CAAC;oBACvC,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC3C,CAAC;qBAAM,CAAC;oBACJ,SAAS;gBACb,CAAC;gBACD,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC;qBACrC,IAAI,IAAI,IAAI,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC,CAAC;qBAC3B,IAAI,IAAI,IAAI,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC;qBAC1B,IAAI,IAAI,GAAG,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC,CAAC;qBAC1B,IAAI,IAAI,GAAG,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC;gBAC9B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;oBACZ,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7D,CAAC;YACL,CAAC;YACD,OAAO,CAAC,CAAC;QACb,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACU,GAAG;;;YACZ,MAAM,MAAM,GAAwB,EAAE,CAAC;YACvC,mDAAmD;YACnD,8DAA8D;YAC9D,MAAM,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,GAAG,EAAE,CAAA,CAAC;QAC3B,CAAC;KAAA;IAEY,UAAU;;;YACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;YACpB,MAAM,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,UAAU,EAAE,CAAA,CAAC;QAClC,CAAC;KAAA;IAED,IAAW,OAAO;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;CACJ;AAED,kBAAe,OAAO,CAAC"}
+{"version":3,"file":"order_by.js","sourceRoot":"","sources":["../../../src/parsing/operations/order_by.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AACA,yEAAiD;AACjD,4DAAoC;AAQpC;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAQ,SAAQ,mBAAS;IAU3B,YAAY,MAAmB;QAC3B,KAAK,EAAE,CAAC;QATJ,aAAQ,GAA0B,EAAE,CAAC;QAC7C;;;;WAIG;QACK,cAAS,GAAY,EAAE,CAAC;QAI5B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IAC1B,CAAC;IAED,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACI,eAAe;QAClB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACvE,CAAC;IAED;;;;;OAKG;IACI,IAAI,CAAC,OAA8B;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,OAA8B;QAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC;QACzD,iEAAiE;QACjE,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAE5B,6DAA6D;QAC7D,8DAA8D;QAC9D,gEAAgE;QAChE,MAAM,cAAc,GAAsB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC7D,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;YACvC,IAAI,IAAI,YAAY,mBAAS,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC/D,OAAQ,IAAkB,CAAC,UAAU,CAAC;YAC1C,CAAC;YACD,OAAO,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,IAAS,CAAC;gBACd,IAAI,IAAS,CAAC;gBACd,IAAI,OAAO,EAAE,CAAC;oBACV,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;qBAAM,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBACpC,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC,CAAC;oBACvC,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC3C,CAAC;qBAAM,CAAC;oBACJ,SAAS;gBACb,CAAC;gBACD,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC;qBACrC,IAAI,IAAI,IAAI,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC,CAAC;qBAC3B,IAAI,IAAI,IAAI,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC;qBAC1B,IAAI,IAAI,GAAG,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC,CAAC;qBAC1B,IAAI,IAAI,GAAG,IAAI;oBAAE,GAAG,GAAG,CAAC,CAAC;gBAC9B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;oBACZ,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7D,CAAC;YACL,CAAC;YACD,OAAO,CAAC,CAAC;QACb,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;OAGG;IACU,GAAG;;;YACZ,MAAM,MAAM,GAAwB,EAAE,CAAC;YACvC,mDAAmD;YACnD,8DAA8D;YAC9D,MAAM,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,GAAG,EAAE,CAAA,CAAC;QAC3B,CAAC;KAAA;IAEY,UAAU;;;YACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;YACpB,MAAM,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,UAAU,EAAE,CAAA,CAAC;QAClC,CAAC;KAAA;IAED,IAAW,OAAO;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;CACJ;AAED,kBAAe,OAAO,CAAC"}

package/dist/parsing/operations/refresh_binding.d.ts

@@ -0,0 +1,15 @@
+import Operation from "./operation";
+/**
+ * `REFRESH BINDING name`: clear the cached value of a refreshable
+ * binding so the next read re-executes the backing sub-query.  No-op
+ * for plain bindings.
+ */
+declare class RefreshBinding extends Operation {
+    private _name;
+    constructor(name: string);
+    get name(): string;
+    run(): Promise<void>;
+    get results(): Record<string, any>[];
+}
+export default RefreshBinding;
+//# sourceMappingURL=refresh_binding.d.ts.map

package/dist/parsing/operations/refresh_binding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refresh_binding.d.ts","sourceRoot":"","sources":["../../../src/parsing/operations/refresh_binding.ts"],"names":[],"mappings":"AACA,OAAO,SAAS,MAAM,aAAa,CAAC;AAEpC;;;;GAIG;AACH,cAAM,cAAe,SAAQ,SAAS;IAClC,OAAO,CAAC,KAAK,CAAS;gBAEV,IAAI,EAAE,MAAM;IAKxB,IAAW,IAAI,IAAI,MAAM,CAExB;IAEY,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;IAKjC,IAAW,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAE1C;CACJ;AAED,eAAe,cAAc,CAAC"}

package/dist/parsing/operations/refresh_binding.js

@@ -0,0 +1,42 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const bindings_1 = __importDefault(require("../../graph/bindings"));
+const operation_1 = __importDefault(require("./operation"));
+/**
+ * `REFRESH BINDING name`: clear the cached value of a refreshable
+ * binding so the next read re-executes the backing sub-query.  No-op
+ * for plain bindings.
+ */
+class RefreshBinding extends operation_1.default {
+    constructor(name) {
+        super();
+        this._name = name;
+    }
+    get name() {
+        return this._name;
+    }
+    run() {
+        return __awaiter(this, void 0, void 0, function* () {
+            var _a;
+            bindings_1.default.getInstance().invalidate(this._name);
+            yield ((_a = this.next) === null || _a === void 0 ? void 0 : _a.run());
+        });
+    }
+    get results() {
+        return [];
+    }
+}
+exports.default = RefreshBinding;
+//# sourceMappingURL=refresh_binding.js.map

package/dist/parsing/operations/refresh_binding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refresh_binding.js","sourceRoot":"","sources":["../../../src/parsing/operations/refresh_binding.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA,oEAA4C;AAC5C,4DAAoC;AAEpC;;;;GAIG;AACH,MAAM,cAAe,SAAQ,mBAAS;IAGlC,YAAY,IAAY;QACpB,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,IAAW,IAAI;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAEY,GAAG;;;YACZ,kBAAQ,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9C,MAAM,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,GAAG,EAAE,CAAA,CAAC;QAC3B,CAAC;KAAA;IAED,IAAW,OAAO;QACd,OAAO,EAAE,CAAC;IACd,CAAC;CACJ;AAED,kBAAe,cAAc,CAAC"}

package/dist/parsing/operations/refresh_node.d.ts

@@ -0,0 +1,11 @@
+import Node from "../../graph/node";
+import Operation from "./operation";
+declare class RefreshNode extends Operation {
+    private _node;
+    constructor(node: Node);
+    get node(): Node | null;
+    run(): Promise<void>;
+    get results(): Record<string, any>[];
+}
+export default RefreshNode;
+//# sourceMappingURL=refresh_node.d.ts.map

package/dist/parsing/operations/refresh_node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refresh_node.d.ts","sourceRoot":"","sources":["../../../src/parsing/operations/refresh_node.ts"],"names":[],"mappings":"AACA,OAAO,IAAI,MAAM,kBAAkB,CAAC;AACpC,OAAO,SAAS,MAAM,aAAa,CAAC;AAEpC,cAAM,WAAY,SAAQ,SAAS;IAC/B,OAAO,CAAC,KAAK,CAAqB;gBACtB,IAAI,EAAE,IAAI;IAItB,IAAW,IAAI,IAAI,IAAI,GAAG,IAAI,CAE7B;IACM,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;IAc3B,IAAW,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAE1C;CACJ;AAED,eAAe,WAAW,CAAC"}