@omgbase/oqx 0.14.0 → 0.14.1

package/dist/optimize/analysis.d.ts

@@ -0,0 +1,45 @@
+import type { Expr, OpNode, Where } from "../ast.js";
+import type { RuleContext } from "./ir.js";
+/** Does `e`, evaluated in a scope at depth `at` (root = 0), read any scope whose
+ * depth lies in `[1, upTo]`? Reads of the root (named roots, depth 0) and of
+ * scopes deeper than `upTo` (the fragment's own rows) do not count. */
+export declare function exprReadsScopeIn(e: Expr, at: number, upTo: number): boolean;
+export declare function whereReadsScopeIn(w: Where, at: number, upTo: number): boolean;
+/** A directive evaluated in a scope at depth `at`: its receiver is read there;
+ * its rows are scopes at `at + 1`. */
+export declare function opReadsScopeIn(op: OpNode, at: number, upTo: number): boolean;
+/** Does `e` read the scope it is evaluated in (a bare identifier anywhere)? */
+export declare function exprReadsCurrentScope(e: Expr): boolean;
+/** Can evaluating `e` raise? Calls can (unknown function/method, regex errors,
+ * a context's own failures); a binding at or past the run's count does; nothing
+ * else in a scalar expression can (§23). */
+export declare function exprRaiseFree(e: Expr, ctx: RuleContext): boolean;
+/** Can evaluating `w` raise, or bind a lift? A where tree is raise-free when
+ * its scalars are and its directives are raise-free (`opRaiseFree`). */
+export declare function whereRaiseFree(w: Where, ctx: RuleContext): boolean;
+/** A where-position directive that can neither raise nor bind: `exists`,
+ * `none` or `count` (never `single`, which raises on several rows; `collect`
+ * binds lifts; `first`/`single` project), without `follow` (raises in where
+ * position), without a bound (an invalid value raises), without `distinct`
+ * (dedup projects, and a projected range raises), whose receiver, `from`,
+ * `where` and `order by` (evaluated by `count`) are raise-free and which lifts
+ * nothing anywhere. */
+export declare function opRaiseFree(op: OpNode, ctx: RuleContext): boolean;
+/** Does any `^name:` item occur anywhere inside the directive (its own select,
+ * or any nested block's)? */
+export declare function opHasLifts(op: OpNode): boolean;
+/** Does any `^name:` item occur inside a directive of this where tree? */
+export declare function whereHasLifts(w: Where): boolean;
+/** The scope-metadata intrinsics: `$key` (an entry's key) and the `follow`
+ * occurrence fields. In a block's row scope these read scope metadata when it is
+ * present and fall through to the context otherwise; every other `$`-name
+ * (`$id`, `$path`, a context's own intrinsics) is always a plain `get` on the
+ * row. */
+export declare const SCOPE_INTRINSICS: ReadonlySet<string>;
+/** The property path a bare identifier or member chain reads off the current
+ * row — `customer_id` → `["customer_id"]`, `meta.id` → `["meta", "id"]`,
+ * `$value` → `[]`, `$value.x` → `["x"]`, `$path` → `["$path"]` — or `null` when
+ * `e` is not such a chain or starts from a scope intrinsic (`$key`, `$depth`,
+ * …, whose value is scope metadata rather than a row property). */
+export declare function localPath(e: Expr): readonly string[] | null;
+//# sourceMappingURL=analysis.d.ts.map

package/dist/optimize/analysis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.d.ts","sourceRoot":"","sources":["../../src/optimize/analysis.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,IAAI,EAAU,MAAM,EAAwB,KAAK,EAAE,MAAM,WAAW,CAAC;AACnF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAI3C;;uEAEuE;AACvE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAY3E;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAO7E;AAED;sCACsC;AACtC,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAE5E;AA6BD,+EAA+E;AAC/E,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAEtD;AAID;;4CAE4C;AAC5C,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,WAAW,GAAG,OAAO,CAWhE;AAED;wEACwE;AACxE,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,GAAG,OAAO,CAOlE;AAED;;;;;;uBAMuB;AACvB,wBAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,GAAG,OAAO,CASjE;AAID;6BAC6B;AAC7B,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAE9C;AASD,0EAA0E;AAC1E,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO,CAO/C;AAID;;;;UAIU;AACV,eAAO,MAAM,gBAAgB,EAAE,WAAW,CAAC,MAAM,CAA0E,CAAC;AAE5H;;;;mEAImE;AACnE,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,MAAM,EAAE,GAAG,IAAI,CAU3D"}

package/dist/optimize/analysis.js

@@ -0,0 +1,194 @@
+// Static (syntactic) analyses the rules rest on. Each answers one question
+// about an AST fragment without evaluating anything:
+//
+//   • which scopes does it READ (`readsScopeIn`) — by depth, since a bare name
+//     reads the current scope and `^name` reads exactly `levels` scopes out
+//     (SEMANTICS §2), so an expression evaluated at a known depth reads a
+//     known set of depths;
+//   • can evaluating it RAISE (`raiseFree`) — the eval errors SEMANTICS §23
+//     enumerates: a call (unknown name, bad regex, wrong receiver), `single`
+//     over several rows, an invalid `limit`/`offset`, `follow` in a where op, a
+//     range in a result, a binding out of range. Property reads are total
+//     (navigating from absent is absent); a `DataContext.get` that throws is
+//     outside this model and is caught at the points the engine relies on it
+//     (index construction, probe-value evaluation), where it degrades to a scan;
+//   • does it have SIDE EFFECTS on scopes (`hasLifts`) — a `^name:` item binds a
+//     value into an enclosing scope (§19), observable by later conjuncts.
+// ---- scope reads --------------------------------------------------------------
+/** Does `e`, evaluated in a scope at depth `at` (root = 0), read any scope whose
+ * depth lies in `[1, upTo]`? Reads of the root (named roots, depth 0) and of
+ * scopes deeper than `upTo` (the fragment's own rows) do not count. */
+export function exprReadsScopeIn(e, at, upTo) {
+    switch (e.kind) {
+        case "lit":
+        case "binding": return false;
+        case "ident": return at >= 1 && at <= upTo;
+        case "outer": {
+            const d = at - e.levels;
+            return d >= 1 && d <= upTo;
+        }
+        case "member": return exprReadsScopeIn(e.recv, at, upTo);
+        case "index": return exprReadsScopeIn(e.recv, at, upTo) || exprReadsScopeIn(e.index, at, upTo);
+        case "call": return (e.recv !== null && exprReadsScopeIn(e.recv, at, upTo)) || e.args.some((a) => exprReadsScopeIn(a, at, upTo));
+        case "unary": return exprReadsScopeIn(e.expr, at, upTo);
+        case "binary":
+        case "logical":
+        case "in": return exprReadsScopeIn(e.left, at, upTo) || exprReadsScopeIn(e.right, at, upTo);
+        case "range": return (e.lo !== null && exprReadsScopeIn(e.lo, at, upTo)) || (e.hi !== null && exprReadsScopeIn(e.hi, at, upTo));
+    }
+}
+export function whereReadsScopeIn(w, at, upTo) {
+    switch (w.kind) {
+        case "and":
+        case "or": return w.parts.some((p) => whereReadsScopeIn(p, at, upTo));
+        case "not": return whereReadsScopeIn(w.expr, at, upTo);
+        case "scalar": return exprReadsScopeIn(w.expr, at, upTo);
+        case "op": return opReadsScopeIn(w, at, upTo);
+    }
+}
+/** A directive evaluated in a scope at depth `at`: its receiver is read there;
+ * its rows are scopes at `at + 1`. */
+export function opReadsScopeIn(op, at, upTo) {
+    return exprReadsScopeIn(op.receiver, at, upTo) || subReadsScopeIn(op.sub, at + 1, upTo);
+}
+/** A block body whose rows are scopes at depth `at`. `from` re-projections,
+ * `where`, `select`, `order by` and the bound are read in the row scope (the
+ * bound in a row-less scope at the same depth); `follow` walks occurrences at
+ * `at`, with its successor `where` one deeper (§20). */
+function subReadsScopeIn(sub, at, upTo) {
+    if (sub.from.some((e) => exprReadsScopeIn(e, at, upTo)))
+        return true;
+    if (sub.where && whereReadsScopeIn(sub.where, at, upTo))
+        return true;
+    if (sub.select.some((item) => itemReadsScopeIn(item, at, upTo)))
+        return true;
+    if (sub.orderBy?.some((o) => exprReadsScopeIn(o.expr, at, upTo)))
+        return true;
+    if (sub.limit && exprReadsScopeIn(sub.limit, at, upTo))
+        return true;
+    if (sub.offset && exprReadsScopeIn(sub.offset, at, upTo))
+        return true;
+    return sub.follow !== null && followReadsScopeIn(sub.follow, at, upTo);
+}
+function itemReadsScopeIn(item, at, upTo) {
+    return item.kind === "field" ? exprReadsScopeIn(item.expr, at, upTo) : opReadsScopeIn(item.op, at, upTo);
+}
+function followReadsScopeIn(f, at, upTo) {
+    for (const d of f.destinations) {
+        if (d.kind === "op" ? opReadsScopeIn(d, at, upTo) : exprReadsScopeIn(d, at, upTo))
+            return true;
+    }
+    if (f.where && exprReadsScopeIn(f.where, at + 1, upTo))
+        return true;
+    if (f.frontier && exprReadsScopeIn(f.frontier, at, upTo))
+        return true;
+    return f.by !== null && exprReadsScopeIn(f.by, at, upTo);
+}
+/** Does `e` read the scope it is evaluated in (a bare identifier anywhere)? */
+export function exprReadsCurrentScope(e) {
+    return exprReadsScopeIn(e, 1, 1);
+}
+// ---- raise freedom ------------------------------------------------------------
+/** Can evaluating `e` raise? Calls can (unknown function/method, regex errors,
+ * a context's own failures); a binding at or past the run's count does; nothing
+ * else in a scalar expression can (§23). */
+export function exprRaiseFree(e, ctx) {
+    switch (e.kind) {
+        case "lit":
+        case "ident":
+        case "outer": return true;
+        case "binding": return e.index < ctx.bindingCount;
+        case "call": return false;
+        case "member": return exprRaiseFree(e.recv, ctx);
+        case "index": return exprRaiseFree(e.recv, ctx) && exprRaiseFree(e.index, ctx);
+        case "unary": return exprRaiseFree(e.expr, ctx);
+        case "binary":
+        case "logical":
+        case "in": return exprRaiseFree(e.left, ctx) && exprRaiseFree(e.right, ctx);
+        case "range": return (e.lo === null || exprRaiseFree(e.lo, ctx)) && (e.hi === null || exprRaiseFree(e.hi, ctx));
+    }
+}
+/** Can evaluating `w` raise, or bind a lift? A where tree is raise-free when
+ * its scalars are and its directives are raise-free (`opRaiseFree`). */
+export function whereRaiseFree(w, ctx) {
+    switch (w.kind) {
+        case "and":
+        case "or": return w.parts.every((p) => whereRaiseFree(p, ctx));
+        case "not": return whereRaiseFree(w.expr, ctx);
+        case "scalar": return exprRaiseFree(w.expr, ctx);
+        case "op": return opRaiseFree(w, ctx);
+    }
+}
+/** A where-position directive that can neither raise nor bind: `exists`,
+ * `none` or `count` (never `single`, which raises on several rows; `collect`
+ * binds lifts; `first`/`single` project), without `follow` (raises in where
+ * position), without a bound (an invalid value raises), without `distinct`
+ * (dedup projects, and a projected range raises), whose receiver, `from`,
+ * `where` and `order by` (evaluated by `count`) are raise-free and which lifts
+ * nothing anywhere. */
+export function opRaiseFree(op, ctx) {
+    if (op.op !== "exists" && op.op !== "none" && op.op !== "count")
+        return false;
+    const sub = op.sub;
+    if (sub.follow || sub.limit || sub.offset || op.distinct)
+        return false;
+    if (!exprRaiseFree(op.receiver, ctx))
+        return false;
+    if (!sub.from.every((e) => exprRaiseFree(e, ctx)))
+        return false;
+    if (sub.where && !whereRaiseFree(sub.where, ctx))
+        return false;
+    if (sub.orderBy && !sub.orderBy.every((o) => exprRaiseFree(o.expr, ctx)))
+        return false;
+    return !opHasLifts(op);
+}
+// ---- lifts --------------------------------------------------------------------
+/** Does any `^name:` item occur anywhere inside the directive (its own select,
+ * or any nested block's)? */
+export function opHasLifts(op) {
+    return subHasLifts(op.sub);
+}
+function subHasLifts(sub) {
+    if (sub.select.some((item) => (item.kind === "field" ? item.lift > 0 : opHasLifts(item.op))))
+        return true;
+    if (sub.where && whereHasLifts(sub.where))
+        return true;
+    if (sub.follow?.destinations.some((d) => d.kind === "op" && opHasLifts(d)))
+        return true;
+    return false;
+}
+/** Does any `^name:` item occur inside a directive of this where tree? */
+export function whereHasLifts(w) {
+    switch (w.kind) {
+        case "and":
+        case "or": return w.parts.some(whereHasLifts);
+        case "not": return whereHasLifts(w.expr);
+        case "scalar": return false;
+        case "op": return opHasLifts(w);
+    }
+}
+// ---- local paths --------------------------------------------------------------
+/** The scope-metadata intrinsics: `$key` (an entry's key) and the `follow`
+ * occurrence fields. In a block's row scope these read scope metadata when it is
+ * present and fall through to the context otherwise; every other `$`-name
+ * (`$id`, `$path`, a context's own intrinsics) is always a plain `get` on the
+ * row. */
+export const SCOPE_INTRINSICS = new Set(["$key", "$depth", "$stop", "$leaf", "$frontier", "$ordinal"]);
+/** The property path a bare identifier or member chain reads off the current
+ * row — `customer_id` → `["customer_id"]`, `meta.id` → `["meta", "id"]`,
+ * `$value` → `[]`, `$value.x` → `["x"]`, `$path` → `["$path"]` — or `null` when
+ * `e` is not such a chain or starts from a scope intrinsic (`$key`, `$depth`,
+ * …, whose value is scope metadata rather than a row property). */
+export function localPath(e) {
+    if (e.kind === "ident") {
+        if (e.name === "$value")
+            return [];
+        return SCOPE_INTRINSICS.has(e.name) ? null : [e.name];
+    }
+    if (e.kind === "member") {
+        const head = localPath(e.recv);
+        return head === null ? null : [...head, e.name];
+    }
+    return null;
+}
+//# sourceMappingURL=analysis.js.map

package/dist/optimize/analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.js","sourceRoot":"","sources":["../../src/optimize/analysis.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,qDAAqD;AACrD,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,0EAA0E;AAC1E,2BAA2B;AAC3B,4EAA4E;AAC5E,6EAA6E;AAC7E,gFAAgF;AAChF,0EAA0E;AAC1E,6EAA6E;AAC7E,6EAA6E;AAC7E,iFAAiF;AACjF,iFAAiF;AACjF,0EAA0E;AAK1E,kFAAkF;AAElF;;uEAEuE;AACvE,MAAM,UAAU,gBAAgB,CAAC,CAAO,EAAE,EAAU,EAAE,IAAY;IAChE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QAAC,KAAK,SAAS,CAAC,CAAC,OAAO,KAAK,CAAC;QACzC,KAAK,OAAO,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC;QAC3C,KAAK,OAAO,CAAC,CAAC,CAAC;YAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;YAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAAC,CAAC;QACtE,KAAK,QAAQ,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACzD,KAAK,OAAO,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/F,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QACjI,KAAK,OAAO,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACxD,KAAK,QAAQ,CAAC;QAAC,KAAK,SAAS,CAAC;QAAC,KAAK,IAAI,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3H,KAAK,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;IAClI,CAAC;AACH,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,CAAQ,EAAE,EAAU,EAAE,IAAY;IAClE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QAAC,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QAClF,KAAK,KAAK,CAAC,CAAC,OAAO,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACvD,KAAK,QAAQ,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACzD,KAAK,IAAI,CAAC,CAAC,OAAO,cAAc,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;AACH,CAAC;AAED;sCACsC;AACtC,MAAM,UAAU,cAAc,CAAC,EAAU,EAAE,EAAU,EAAE,IAAY;IACjE,OAAO,gBAAgB,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,eAAe,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;AAC1F,CAAC;AAED;;;wDAGwD;AACxD,SAAS,eAAe,CAAC,GAAa,EAAE,EAAU,EAAE,IAAY;IAC9D,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACrE,IAAI,GAAG,CAAC,KAAK,IAAI,iBAAiB,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACrE,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7E,IAAI,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9E,IAAI,GAAG,CAAC,KAAK,IAAI,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACpE,IAAI,GAAG,CAAC,MAAM,IAAI,gBAAgB,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACtE,OAAO,GAAG,CAAC,MAAM,KAAK,IAAI,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;AACzE,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAgB,EAAE,EAAU,EAAE,IAAY;IAClE,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;AAC3G,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAS,EAAE,EAAU,EAAE,IAAY;IAC7D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IACjG,CAAC;IACD,IAAI,CAAC,CAAC,KAAK,IAAI,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACpE,IAAI,CAAC,CAAC,QAAQ,IAAI,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACtE,OAAO,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;AAC3D,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,qBAAqB,CAAC,CAAO;IAC3C,OAAO,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,kFAAkF;AAElF;;4CAE4C;AAC5C,MAAM,UAAU,aAAa,CAAC,CAAO,EAAE,GAAgB;IACrD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QAAC,KAAK,OAAO,CAAC;QAAC,KAAK,OAAO,CAAC,CAAC,OAAO,IAAI,CAAC;QACpD,KAAK,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,YAAY,CAAC;QAClD,KAAK,MAAM,CAAC,CAAC,OAAO,KAAK,CAAC;QAC1B,KAAK,QAAQ,CAAC,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,KAAK,OAAO,CAAC,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC/E,KAAK,OAAO,CAAC,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAChD,KAAK,QAAQ,CAAC;QAAC,KAAK,SAAS,CAAC;QAAC,KAAK,IAAI,CAAC,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3G,KAAK,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAClH,CAAC;AACH,CAAC;AAED;wEACwE;AACxE,MAAM,UAAU,cAAc,CAAC,CAAQ,EAAE,GAAgB;IACvD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QAAC,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3E,KAAK,KAAK,CAAC,CAAC,OAAO,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC/C,KAAK,QAAQ,CAAC,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,CAAC,OAAO,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED;;;;;;uBAMuB;AACvB,MAAM,UAAU,WAAW,CAAC,EAAU,EAAE,GAAgB;IACtD,IAAI,EAAE,CAAC,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,EAAE,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IAC9E,MAAM,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC;IACnB,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IACvE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACnD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAChE,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/D,IAAI,GAAG,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACvF,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;AACzB,CAAC;AAED,kFAAkF;AAElF;6BAC6B;AAC7B,MAAM,UAAU,UAAU,CAAC,EAAU;IACnC,OAAO,WAAW,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,WAAW,CAAC,GAAa;IAChC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1G,IAAI,GAAG,CAAC,KAAK,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvD,IAAI,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACxF,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,aAAa,CAAC,CAAQ;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QAAC,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC1D,KAAK,KAAK,CAAC,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzC,KAAK,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC;QAC5B,KAAK,IAAI,CAAC,CAAC,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED,kFAAkF;AAElF;;;;UAIU;AACV,MAAM,CAAC,MAAM,gBAAgB,GAAwB,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC;AAE5H;;;;mEAImE;AACnE,MAAM,UAAU,SAAS,CAAC,CAAO;IAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;QACnC,OAAO,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/optimize/driver.d.ts

@@ -0,0 +1,8 @@
+import type { OpNode } from "../ast.js";
+import type { BlockPlan, Rule, RuleContext } from "./ir.js";
+/** Rewrite `logicalBlock(node, depth)` to a fixpoint of `rules`. */
+export declare function optimizeBlock(node: OpNode, depth: number, ctx: RuleContext, rules: readonly Rule[]): BlockPlan;
+/** `optimizeBlock`, memoized on the node (re-planned when depth, binding count
+ * or rule set differ from the cached entry). */
+export declare function planFor(node: OpNode, depth: number, ctx: RuleContext, rules: readonly Rule[]): BlockPlan;
+//# sourceMappingURL=driver.d.ts.map

package/dist/optimize/driver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"driver.d.ts","sourceRoot":"","sources":["../../src/optimize/driver.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACxC,OAAO,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAK5D,oEAAoE;AACpE,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,IAAI,EAAE,GAAG,SAAS,CAW9G;AAKD;gDACgD;AAChD,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,IAAI,EAAE,GAAG,SAAS,CAMxG"}

package/dist/optimize/driver.js

@@ -0,0 +1,35 @@
+// The optimizer driver: applies a rule set to a block's logical plan until no
+// rule changes it (a fixpoint, bounded), and caches the result per AST node —
+// the analysis is syntactic, so a plan depends only on the node, its static
+// depth, the run's binding count and the rule set.
+import { logicalBlock } from "./ir.js";
+const MAX_PASSES = 8;
+/** Rewrite `logicalBlock(node, depth)` to a fixpoint of `rules`. */
+export function optimizeBlock(node, depth, ctx, rules) {
+    let plan = logicalBlock(node, depth);
+    for (let pass = 0; pass < MAX_PASSES; pass++) {
+        let changed = false;
+        for (const rule of rules) {
+            const next = rule(plan, ctx);
+            if (next !== null && next !== plan) {
+                plan = next;
+                changed = true;
+            }
+        }
+        if (!changed)
+            break;
+    }
+    return plan;
+}
+const cache = new WeakMap();
+/** `optimizeBlock`, memoized on the node (re-planned when depth, binding count
+ * or rule set differ from the cached entry). */
+export function planFor(node, depth, ctx, rules) {
+    const hit = cache.get(node);
+    if (hit && hit.depth === depth && hit.bindingCount === ctx.bindingCount && hit.rules === rules)
+        return hit.plan;
+    const plan = optimizeBlock(node, depth, ctx, rules);
+    cache.set(node, { depth, bindingCount: ctx.bindingCount, rules, plan });
+    return plan;
+}
+//# sourceMappingURL=driver.js.map

package/dist/optimize/driver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"driver.js","sourceRoot":"","sources":["../../src/optimize/driver.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,8EAA8E;AAC9E,4EAA4E;AAC5E,mDAAmD;AAInD,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAEvC,MAAM,UAAU,GAAG,CAAC,CAAC;AAErB,oEAAoE;AACpE,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,KAAa,EAAE,GAAgB,EAAE,KAAsB;IACjG,IAAI,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACrC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAAC,IAAI,GAAG,IAAI,CAAC;gBAAC,OAAO,GAAG,IAAI,CAAC;YAAC,CAAC;QACtE,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,MAAM;IACtB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAGD,MAAM,KAAK,GAAG,IAAI,OAAO,EAAkB,CAAC;AAE5C;gDACgD;AAChD,MAAM,UAAU,OAAO,CAAC,IAAY,EAAE,KAAa,EAAE,GAAgB,EAAE,KAAsB;IAC3F,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC5B,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,IAAI,GAAG,CAAC,YAAY,KAAK,GAAG,CAAC,YAAY,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC;IAChH,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACpD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,CAAC,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACxE,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/optimize/hash-index.d.ts

@@ -0,0 +1,34 @@
+/** A pre-built equality index a `DataContext` may expose for a collection
+ * (see `DataContext.indexFor`): `lookup(value)` returns the ascending positions
+ * (into `toRows(collection)`) of the rows whose key equals `value` under §5.
+ *
+ * `lookupRows`, when present, answers the same probe with the ROWS themselves —
+ * exactly the rows `lookup(value)` would select, in receiver order — without
+ * the engine ever materializing `toRows(collection)`. A store-backed context
+ * implements it over its own indexes (one indexed statement per probe); the
+ * engine prefers it for a statically stable receiver, so the collection is
+ * never read whole. A throw is the query's error (as a `get` that throws is). */
+export interface RowIndex {
+    lookup(value: unknown): readonly number[];
+    lookupRows?(value: unknown): Iterable<unknown>;
+}
+/** The engine's own `RowIndex`: `add` every row's key in row order, then probe. */
+export declare class HashIndex implements RowIndex {
+    private prim;
+    private refs;
+    private count;
+    /** Record that the row at `position` has key `value`. Positions must be
+     * added in ascending order (row order). A `NaN` key is not indexed. */
+    add(value: unknown, position: number): void;
+    lookup(value: unknown): readonly number[];
+    /** How many rows were indexed (rows with a `NaN` key are not). */
+    get size(): number;
+}
+/** The tagged bucket key of a primitive, `null` for `NaN` (no key: it equals
+ * nothing), `undefined` for a reference-keyed value (object, array, function,
+ * symbol — compared by identity). Mirrors `semantics.equals`: `===` after
+ * normalizing `undefined` to `null`. */
+export declare function primitiveKey(v: unknown): string | null | undefined;
+/** Intersect two ascending position lists, ascending. */
+export declare function intersectPositions(a: readonly number[], b: readonly number[]): readonly number[];
+//# sourceMappingURL=hash-index.d.ts.map

package/dist/optimize/hash-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-index.d.ts","sourceRoot":"","sources":["../../src/optimize/hash-index.ts"],"names":[],"mappings":"AAeA;;;;;;;;;iFASiF;AACjF,MAAM,WAAW,QAAQ;IACvB,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,MAAM,EAAE,CAAC;IAC1C,UAAU,CAAC,CAAC,KAAK,EAAE,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;CAChD;AAID,mFAAmF;AACnF,qBAAa,SAAU,YAAW,QAAQ;IACxC,OAAO,CAAC,IAAI,CAA+B;IAC3C,OAAO,CAAC,IAAI,CAAgC;IAC5C,OAAO,CAAC,KAAK,CAAK;IAElB;2EACuE;IACvE,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAW3C,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,MAAM,EAAE;IAMzC,kEAAkE;IAClE,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF;AAED;;;wCAGwC;AACxC,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,GAAG,SAAS,CAUlE;AAED,yDAAyD;AACzD,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,EAAE,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,MAAM,EAAE,CAUhG"}

package/dist/optimize/hash-index.js

@@ -0,0 +1,79 @@
+// A hash index over the rows of one collection, keyed under OQX equality
+// (SEMANTICS §5) — the only key discipline that makes an index probe return
+// exactly the rows a `local == value` scan would keep:
+//
+//   • absent is one value: `undefined` and `null` share a bucket;
+//   • numbers are doubles: `-0` meets `0`; `NaN` equals nothing, so a row whose
+//     key is `NaN` is never indexed and a probe for `NaN` finds nothing;
+//   • strings, booleans and bigints key by value with a type tag, so `"5"`,
+//     `5` and `true` stay apart;
+//   • objects, arrays, functions and symbols key by REFERENCE — the reference
+//     engine's `===` — never structurally.
+//
+// Buckets hold row POSITIONS in ascending order, so a probe yields rows in the
+// receiver's order (§3 and §13 — a block's rows are the receiver's, in order).
+const NONE = Object.freeze([]);
+/** The engine's own `RowIndex`: `add` every row's key in row order, then probe. */
+export class HashIndex {
+    prim = new Map();
+    refs = new Map();
+    count = 0;
+    /** Record that the row at `position` has key `value`. Positions must be
+     * added in ascending order (row order). A `NaN` key is not indexed. */
+    add(value, position) {
+        const k = primitiveKey(value);
+        if (k === null)
+            return; // NaN: equals nothing
+        const map = k === undefined ? this.refs : this.prim;
+        const key = k === undefined ? value : k;
+        let bucket = map.get(key);
+        if (!bucket)
+            map.set(key, (bucket = []));
+        bucket.push(position);
+        this.count++;
+    }
+    lookup(value) {
+        const k = primitiveKey(value);
+        if (k === null)
+            return NONE;
+        return (k === undefined ? this.refs.get(value) : this.prim.get(k)) ?? NONE;
+    }
+    /** How many rows were indexed (rows with a `NaN` key are not). */
+    get size() {
+        return this.count;
+    }
+}
+/** The tagged bucket key of a primitive, `null` for `NaN` (no key: it equals
+ * nothing), `undefined` for a reference-keyed value (object, array, function,
+ * symbol — compared by identity). Mirrors `semantics.equals`: `===` after
+ * normalizing `undefined` to `null`. */
+export function primitiveKey(v) {
+    switch (typeof v) {
+        case "undefined": return "∅"; // absent ≡ absent
+        case "object": return v === null ? "∅" : undefined;
+        case "number": return Number.isNaN(v) ? null : `n${v}`; // `${-0}` is "0": -0 meets 0
+        case "string": return `s${v}`;
+        case "boolean": return v ? "t" : "f";
+        case "bigint": return `i${v}`;
+        default: return undefined; // function, symbol: reference identity
+    }
+}
+/** Intersect two ascending position lists, ascending. */
+export function intersectPositions(a, b) {
+    const out = [];
+    let i = 0, j = 0;
+    while (i < a.length && j < b.length) {
+        const x = a[i], y = b[j];
+        if (x === y) {
+            out.push(x);
+            i++;
+            j++;
+        }
+        else if (x < y)
+            i++;
+        else
+            j++;
+    }
+    return out;
+}
+//# sourceMappingURL=hash-index.js.map

package/dist/optimize/hash-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-index.js","sourceRoot":"","sources":["../../src/optimize/hash-index.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,4EAA4E;AAC5E,uDAAuD;AACvD,EAAE;AACF,kEAAkE;AAClE,gFAAgF;AAChF,yEAAyE;AACzE,4EAA4E;AAC5E,iCAAiC;AACjC,8EAA8E;AAC9E,2CAA2C;AAC3C,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAiB/E,MAAM,IAAI,GAAsB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAElD,mFAAmF;AACnF,MAAM,OAAO,SAAS;IACZ,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACnC,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IACpC,KAAK,GAAG,CAAC,CAAC;IAElB;2EACuE;IACvE,GAAG,CAAC,KAAc,EAAE,QAAgB;QAClC,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,CAAC,sBAAsB;QAC9C,MAAM,GAAG,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACpD,MAAM,GAAG,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,MAAM,CAAC,KAAc;QACnB,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC5B,OAAO,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IAC7E,CAAC;IAED,kEAAkE;IAClE,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF;AAED;;;wCAGwC;AACxC,MAAM,UAAU,YAAY,CAAC,CAAU;IACrC,QAAQ,OAAO,CAAC,EAAE,CAAC;QACjB,KAAK,WAAW,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,kBAAkB;QAChD,KAAK,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;QACnD,KAAK,QAAQ,CAAC,CAAC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,6BAA6B;QACrF,KAAK,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;QAC9B,KAAK,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACrC,KAAK,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;QAC9B,OAAO,CAAC,CAAC,OAAO,SAAS,CAAC,CAAC,uCAAuC;IACpE,CAAC;AACH,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,kBAAkB,CAAC,CAAoB,EAAE,CAAoB;IAC3E,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjB,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC,EAAE,CAAC;YAAC,CAAC,EAAE,CAAC;QAAC,CAAC;aAClC,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,EAAE,CAAC;;YACf,CAAC,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/optimize/index.d.ts

@@ -0,0 +1,8 @@
+export type { BlockPlan, Correlation, Rule, RuleContext } from "./ir.js";
+export { logicalBlock, conjunction, conjuncts, residualWithout, lookupOrder } from "./ir.js";
+export { optimizeBlock, planFor } from "./driver.js";
+export { correlatedEqualityProbe, stableReceiver, invariantBlock, cardinalityOnly, DEFAULT_RULES } from "./rules.js";
+export type { RowIndex } from "./hash-index.js";
+export { HashIndex, primitiveKey, intersectPositions } from "./hash-index.js";
+export { exprReadsScopeIn, whereReadsScopeIn, opReadsScopeIn, exprReadsCurrentScope, exprRaiseFree, whereRaiseFree, opRaiseFree, opHasLifts, whereHasLifts, localPath, SCOPE_INTRINSICS, } from "./analysis.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/optimize/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/optimize/index.ts"],"names":[],"mappings":"AAMA,YAAY,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAC7F,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,cAAc,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACrH,YAAY,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EACL,gBAAgB,EAAE,iBAAiB,EAAE,cAAc,EAAE,qBAAqB,EAC1E,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,gBAAgB,GACnG,MAAM,eAAe,CAAC"}

package/dist/optimize/index.js

@@ -0,0 +1,11 @@
+// The optimizer: a logical plan per nested block, rules that rewrite it, a
+// driver that applies them to a fixpoint, and the equality-faithful hash index
+// the hash-probe rule executes with. See `rules.ts` for the catalog and each
+// rule's semantics argument; README "Performance: relational patterns" for the
+// user-facing summary.
+export { logicalBlock, conjunction, conjuncts, residualWithout, lookupOrder } from "./ir.js";
+export { optimizeBlock, planFor } from "./driver.js";
+export { correlatedEqualityProbe, stableReceiver, invariantBlock, cardinalityOnly, DEFAULT_RULES } from "./rules.js";
+export { HashIndex, primitiveKey, intersectPositions } from "./hash-index.js";
+export { exprReadsScopeIn, whereReadsScopeIn, opReadsScopeIn, exprReadsCurrentScope, exprRaiseFree, whereRaiseFree, opRaiseFree, opHasLifts, whereHasLifts, localPath, SCOPE_INTRINSICS, } from "./analysis.js";
+//# sourceMappingURL=index.js.map

package/dist/optimize/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/optimize/index.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,+EAA+E;AAC/E,6EAA6E;AAC7E,+EAA+E;AAC/E,uBAAuB;AAGvB,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAC7F,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,cAAc,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAErH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EACL,gBAAgB,EAAE,iBAAiB,EAAE,cAAc,EAAE,qBAAqB,EAC1E,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,gBAAgB,GACnG,MAAM,eAAe,CAAC"}

package/dist/optimize/ir.d.ts

@@ -0,0 +1,84 @@
+import type { Consumer, Expr, Follow, OpNode, OrderSpec, SelectItem, Where } from "../ast.js";
+/** One hoisted equality `local == outer` from the block's top-level `&&`
+ * conjunction: `local` reads only the block's row (an identifier or member
+ * chain; `path` is its property path, `[]` for `$value`), `outer` reads nothing
+ * from the block's row (outer references, bindings, literals, arithmetic over
+ * them) and cannot raise. */
+export interface Correlation {
+    readonly local: Expr;
+    readonly outer: Expr;
+    readonly path: readonly string[];
+    /** Position of the equality among `conjuncts(where)`, so a probe that
+     * answers ONE correlation (a store-backed `lookupRows`) can put the others
+     * back in their place as residual conjuncts. */
+    readonly index: number;
+}
+/** The plan for one block. `receiver`/`from`/`projection`/`orderBy`/`bound`/
+ * `consumer`/`follow`/`distinct` transcribe the AST; `correlated`/`residual`
+ * split its `where`; `receiverStable`, `invariant` and `fromCardinality` are the
+ * annotations rules add. */
+export interface BlockPlan {
+    readonly node: OpNode;
+    /** Scope depth of the ENCLOSING scope (root = 0): the receiver is read there;
+     * the block's rows are scopes at `depth + 1`. */
+    readonly depth: number;
+    readonly consumer: Consumer;
+    readonly receiver: Expr;
+    readonly from: readonly Expr[];
+    readonly where: Where | null;
+    readonly projection: {
+        readonly select: readonly SelectItem[];
+        readonly values: boolean;
+    };
+    readonly orderBy: readonly OrderSpec[] | null;
+    readonly distinct: boolean;
+    readonly bound: {
+        readonly limit: Expr | undefined;
+        readonly offset: Expr | undefined;
+    };
+    readonly follow: Follow | null;
+    /** Equalities answered by an index probe on the receiver (in conjunct order). */
+    readonly correlated: readonly Correlation[];
+    /** The conjuncts still evaluated per row once the probe has selected its
+     * bucket; equals `where` when nothing is correlated. */
+    readonly residual: Where | null;
+    /** The receiver reads nothing from any enclosing row (only the root scope
+     * and bindings), so its rows are the same for every enclosing row and can be
+     * materialized and indexed once per run. */
+    readonly receiverStable: boolean;
+    /** The whole block reads nothing from any enclosing row and has no side
+     * effects on one (no lifts): its value is the same for every enclosing row
+     * and is computed once per run. */
+    readonly invariant: boolean;
+    /** `exists`/`none`/`count` may be answered from the cardinality of the
+     * accessed rows when no residual predicate remains (nothing per row to
+     * evaluate, order, dedup or project). */
+    readonly fromCardinality: boolean;
+}
+/** What a rule may consult besides the plan. */
+export interface RuleContext {
+    /** How many positional bindings this run has (a `${i}` with `i` at or past
+     * it raises when evaluated, so it is not raise-free). */
+    readonly bindingCount: number;
+}
+/** A rewrite: return an improved plan, or `null` when the rule does not apply
+ * (or has already been applied). Rules must be idempotent on their own output. */
+export type Rule = (plan: BlockPlan, ctx: RuleContext) => BlockPlan | null;
+/** The faithful transcription of a block: a scan with every predicate residual. */
+export declare function logicalBlock(node: OpNode, depth: number): BlockPlan;
+/** Rebuild a conjunction from its remaining parts. */
+export declare function conjunction(parts: readonly Where[]): Where | null;
+/** The top-level `&&` conjuncts of a where tree (a non-`and` tree is one). */
+export declare function conjuncts(where: Where): readonly Where[];
+/** The residual when exactly ONE correlation is answered by a probe (a context
+ * index's `lookupRows`): every other conjunct, the remaining equalities
+ * included, stays in its original place. A kept equality is true by
+ * construction for the rows the probe selects and, being two reads, can neither
+ * raise nor bind, so the scan's strict left-to-right order and outcome hold. */
+export declare function residualWithout(plan: BlockPlan, answered: Correlation): Where | null;
+/** The order in which a single-correlation probe tries the plan's correlations:
+ * those whose outer side varies with the enclosing row first (a literal selects
+ * the same rows for every enclosing row and narrows nothing), each group in
+ * conjunct order. */
+export declare function lookupOrder(plan: BlockPlan): readonly Correlation[];
+//# sourceMappingURL=ir.d.ts.map

package/dist/optimize/ir.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ir.d.ts","sourceRoot":"","sources":["../../src/optimize/ir.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAE9F;;;;6BAI6B;AAC7B,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC;IACrB,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC;;oDAEgD;IAChD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;4BAG4B;AAC5B,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;qDACiD;IACjD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,CAAC;IAC/B,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;KAAE,CAAC;IAC1F,QAAQ,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG,IAAI,CAAC;IAC9C,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,KAAK,EAAE,IAAI,GAAG,SAAS,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,GAAG,SAAS,CAAA;KAAE,CAAC;IACxF,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,iFAAiF;IACjF,QAAQ,CAAC,UAAU,EAAE,SAAS,WAAW,EAAE,CAAC;IAC5C;4DACwD;IACxD,QAAQ,CAAC,QAAQ,EAAE,KAAK,GAAG,IAAI,CAAC;IAChC;;gDAE4C;IAC5C,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC;;uCAEmC;IACnC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;6CAEyC;IACzC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC;CACnC;AAED,gDAAgD;AAChD,MAAM,WAAW,WAAW;IAC1B;6DACyD;IACzD,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED;kFACkF;AAClF,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,WAAW,KAAK,SAAS,GAAG,IAAI,CAAC;AAE3E,mFAAmF;AACnF,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,CAoBnE;AAED,sDAAsD;AACtD,wBAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,GAAG,KAAK,GAAG,IAAI,CAEjE;AAED,8EAA8E;AAC9E,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,KAAK,EAAE,CAExD;AAED;;;;gFAIgF;AAChF,wBAAgB,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,GAAG,KAAK,GAAG,IAAI,CAEpF;AAED;;;qBAGqB;AACrB,wBAAgB,WAAW,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,WAAW,EAAE,CAInE"}

package/dist/optimize/ir.js

@@ -0,0 +1,60 @@
+// The optimizer's logical representation of one nested block (an `OpNode`):
+// where its rows come from, which predicates correlate them with the enclosing
+// rows, what remains to be checked per row, how they are shaped, and how the
+// consumer reduces them. Rules rewrite a `BlockPlan`; the engine executes it.
+//
+// A plan starts as a faithful transcription of the AST (`logicalBlock`): every
+// predicate residual, nothing correlated, nothing memoized. Rules move work
+// from the per-row path into the per-run or per-probe path only when the
+// semantics argument in `rules.ts` holds; the engine's fallbacks (an index that
+// cannot be built, a receiver that is not stable) always degrade to the plain
+// scan the plan started from.
+/** The faithful transcription of a block: a scan with every predicate residual. */
+export function logicalBlock(node, depth) {
+    const sub = node.sub;
+    return {
+        node,
+        depth,
+        consumer: node.op,
+        receiver: node.receiver,
+        from: sub.from,
+        where: sub.where,
+        projection: { select: sub.select, values: sub.values ?? false },
+        orderBy: sub.orderBy,
+        distinct: node.distinct ?? false,
+        bound: { limit: sub.limit, offset: sub.offset },
+        follow: sub.follow,
+        correlated: [],
+        residual: sub.where,
+        receiverStable: false,
+        invariant: false,
+        fromCardinality: false,
+    };
+}
+/** Rebuild a conjunction from its remaining parts. */
+export function conjunction(parts) {
+    return parts.length === 0 ? null : parts.length === 1 ? parts[0] : { kind: "and", parts: [...parts] };
+}
+/** The top-level `&&` conjuncts of a where tree (a non-`and` tree is one). */
+export function conjuncts(where) {
+    return where.kind === "and" ? where.parts : [where];
+}
+/** The residual when exactly ONE correlation is answered by a probe (a context
+ * index's `lookupRows`): every other conjunct, the remaining equalities
+ * included, stays in its original place. A kept equality is true by
+ * construction for the rows the probe selects and, being two reads, can neither
+ * raise nor bind, so the scan's strict left-to-right order and outcome hold. */
+export function residualWithout(plan, answered) {
+    return plan.where ? conjunction(conjuncts(plan.where).filter((_, i) => i !== answered.index)) : null;
+}
+/** The order in which a single-correlation probe tries the plan's correlations:
+ * those whose outer side varies with the enclosing row first (a literal selects
+ * the same rows for every enclosing row and narrows nothing), each group in
+ * conjunct order. */
+export function lookupOrder(plan) {
+    const all = plan.correlated;
+    if (all.length < 2)
+        return all;
+    return [...all.filter((c) => c.outer.kind !== "lit"), ...all.filter((c) => c.outer.kind === "lit")];
+}
+//# sourceMappingURL=ir.js.map

package/dist/optimize/ir.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ir.js","sourceRoot":"","sources":["../../src/optimize/ir.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,+EAA+E;AAC/E,6EAA6E;AAC7E,8EAA8E;AAC9E,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,yEAAyE;AACzE,gFAAgF;AAChF,8EAA8E;AAC9E,8BAA8B;AAmE9B,mFAAmF;AACnF,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,KAAa;IACtD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;IACrB,OAAO;QACL,IAAI;QACJ,KAAK;QACL,QAAQ,EAAE,IAAI,CAAC,EAAE;QACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,UAAU,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,KAAK,EAAE;QAC/D,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK;QAChC,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE;QAC/C,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,UAAU,EAAE,EAAE;QACd,QAAQ,EAAE,GAAG,CAAC,KAAK;QACnB,cAAc,EAAE,KAAK;QACrB,SAAS,EAAE,KAAK;QAChB,eAAe,EAAE,KAAK;KACvB,CAAC;AACJ,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,WAAW,CAAC,KAAuB;IACjD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;AACzG,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,SAAS,CAAC,KAAY;IACpC,OAAO,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC;AAED;;;;gFAIgF;AAChF,MAAM,UAAU,eAAe,CAAC,IAAe,EAAE,QAAqB;IACpE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACvG,CAAC;AAED;;;qBAGqB;AACrB,MAAM,UAAU,WAAW,CAAC,IAAe;IACzC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;IAC5B,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/B,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC;AACtG,CAAC"}