@quereus/quereus 3.3.0 → 4.0.0

package/dist/src/planner/rules/cache/rule-materialized-view-rewrite.js

@@ -0,0 +1,616 @@
+/**
+ * Rule: Materialized-view query rewrite (read side)
+ *
+ * The read-side dual of the covering-structure enforcement path. Recognizes that
+ * an *arbitrary* scan-projection-filter query — one that never names a
+ * materialized view — is **answered from** a covering MV, and rewrites it to scan
+ * the MV's backing table with a residual projection / filter instead of
+ * recomputing the body against the base tables.
+ *
+ *     create materialized view recent as
+ *       select id, customer_id, amt from sales where amt > 0;
+ *
+ *     -- never names `recent`, but the optimizer answers from it:
+ *     select customer_id, amt from sales where amt > 0 and customer_id = 7;
+ *     --   → scan recent, residual filter (customer_id = 7), residual project
+ *
+ * **Placement.** Logical→logical, in the Structural `rewrite` pass, at a priority
+ * *below* `grow-retrieve` / `predicate-pushdown` so the fragment is still the
+ * pristine `Project(Filter?(Retrieve(TableReference)))` when the matcher reads its
+ * WHERE off the live plan (see `query-rewrite-matcher.ts` § pristine-fragment
+ * requirement). The substituted maintained-table `TableReference` then flows
+ * through the normal Physical-pass access-path selection — so `query_plan()`
+ * shows an ordinary scan of the MV's own table for free.
+ *
+ * **`sideEffectMode: 'safe'`.** The matcher admits only a read-only
+ * `Project(Filter?(scan(TableReference)))` fragment (recognized conjunctive
+ * predicates, no subqueries), so the dropped base-scan subtree is provably pure.
+ * The replacement re-emits the fragment's identical output attribute ids, so the
+ * parent splice that references them stays valid — mirroring the
+ * attribute-id-preservation discipline of `rule-join-elimination`.
+ *
+ * Soundness lives in the matcher; this rule only adds the cost gate and the node
+ * construction. The cost gate is a pure optimization decision — declining it (or
+ * the matcher returning NotMatch) leaves the correct recompute-over-base plan.
+ */
+import { createLogger } from '../../../common/logger.js';
+import { ProjectNode } from '../../nodes/project-node.js';
+import { FilterNode } from '../../nodes/filter.js';
+import { RetrieveNode } from '../../nodes/retrieve-node.js';
+import { AggregateNode } from '../../nodes/aggregate-node.js';
+import { AggregateFunctionCallNode } from '../../nodes/aggregate-function.js';
+import { ScalarFunctionCallNode } from '../../nodes/function.js';
+import { TableReferenceNode, ColumnReferenceNode } from '../../nodes/reference.js';
+import { BinaryOpNode, LiteralNode } from '../../nodes/scalar.js';
+import { requireVtabModule } from '../../../schema/table.js';
+import { isAggregateFunctionSchema, isScalarFunctionSchema } from '../../../schema/function.js';
+import { FunctionFlags } from '../../../common/constants.js';
+import { seqScanCost, filterCost, projectCost, aggregateCost, hashJoinCost } from '../../cost/index.js';
+import { analyzeQueryFragment, matchFragmentToMv, analyzeAggregateFragment, matchAggregateFragmentToMv, analyzeJoinQueryFragment, matchJoinFragmentToMv, } from '../../analysis/query-rewrite-matcher.js';
+const log = createLogger('optimizer:rule:materialized-view-rewrite');
+/** Canonical rule id. The aggregate arm registers under a distinct id
+ *  (`materialized-view-rewrite-aggregate`) but honors this switch so a single
+ *  `disabledRules` entry (or the existing equivalence-harness controls) turns off
+ *  both arms at once. See `optimizer.ts` § registerRulesToPasses. */
+const RULE_ID = 'materialized-view-rewrite';
+/** Nominal cardinality when stats report nothing (memory tables expose no row
+ *  count to the StatsProvider). Matches NaiveStatsProvider's default. */
+const DEFAULT_ROWS = 1000;
+/** Row-reduction discount applied to a backing scan whose MV carries a WHERE when
+ *  stats don't reflect the materialized subset. Matches FilterNode's own default. */
+const MV_WHERE_SELECTIVITY = 0.5;
+export function ruleMaterializedViewRewrite(node, context) {
+    // Honor the canonical disable switch for BOTH arms. The aggregate arm is a
+    // second registration under a distinct id (the pass dedups rules by id within a
+    // pass and only id-checks the registration that fired), so this catches the
+    // aggregate arm whenever the canonical `materialized-view-rewrite` id is disabled.
+    if (context.tuning.disabledRules?.has(RULE_ID))
+        return null;
+    const sm = context.db.schemaManager;
+    // Never rewrite while planning an MV's own body to (re)compute or maintain its
+    // backing — that would read the snapshot being populated. See SchemaManager
+    // § mvRewriteSuppressed.
+    if (sm.isMaterializedViewRewriteSuppressed())
+        return null;
+    const mvs = sm.getAllMaintainedTables();
+    if (mvs.length === 0)
+        return null;
+    // Mirror the create-time determinism gate: consult the function registry's
+    // DETERMINISTIC flag (a registered MV is already deterministic, so this is
+    // defense in depth). Unknown functions are treated as deterministic, matching
+    // `validateCheckConstraintDeterminism`.
+    const isDeterministic = (name, argc) => {
+        const fn = sm.findFunction(name, argc) ?? sm.findFunction(name, -1);
+        return fn ? (fn.flags & FunctionFlags.DETERMINISTIC) !== 0 : true;
+    };
+    if (node instanceof ProjectNode) {
+        // Single-source projection/filter first; fall back to the join arm when the
+        // fragment's source descends through a binary join instead of a bare scan.
+        return rewriteProjectionFilter(node, context, mvs, isDeterministic)
+            ?? rewriteJoinFragment(node, context, mvs, isDeterministic);
+    }
+    if (node instanceof AggregateNode)
+        return rewriteAggregate(node, context, mvs, isDeterministic);
+    return null;
+}
+/** The projection-filter arm (the foundation): rewrite `Project(Filter?(scan))`. */
+function rewriteProjectionFilter(node, context, mvs, isDeterministic) {
+    const sm = context.db.schemaManager;
+    const frag = analyzeQueryFragment(node);
+    if (!frag.ok)
+        return null;
+    const shape = frag.shape;
+    const baseQualified = `${shape.baseTable.schemaName}.${shape.baseTable.name}`.toLowerCase();
+    // Enumerate candidate MVs single-sourced over this base table, then match.
+    // The maintained table IS its own backing in the unified model.
+    const matches = [];
+    for (const mv of mvs) {
+        if (mv.derivation.sourceTables.length !== 1 || mv.derivation.sourceTables[0] !== baseQualified)
+            continue;
+        const backing = sm.getTable(mv.schemaName, mv.name);
+        const res = matchFragmentToMv(shape, mv, backing, isDeterministic);
+        if (res.match)
+            matches.push(res.match);
+    }
+    if (matches.length === 0)
+        return null;
+    // Cost gate: keep only strictly-cheaper matches; cheapest wins, stable name
+    // tiebreak so plans are deterministic when several MVs match.
+    const baseRows = estRows(context.stats.tableRows(shape.baseTable));
+    const baseCost = recomputeCost(baseRows, shape.conjuncts.length > 0, shape.outputs.length);
+    let best;
+    for (const m of matches) {
+        const mvHasWhere = m.mv.derivation.selectAst.type === 'select' && m.mv.derivation.selectAst.where !== undefined;
+        const backingRows = backingCardinality(context.stats.tableRows(m.backing), baseRows, mvHasWhere);
+        const cost = scanCost(backingRows, m.residualConjuncts.length > 0, m.outputColumnMap.length);
+        if (cost >= baseCost)
+            continue; // not strictly cheaper → decline this match
+        if (!best
+            || cost < best.cost
+            || (cost === best.cost && m.mv.name.toLowerCase() < best.match.mv.name.toLowerCase())) {
+            best = { match: m, cost };
+        }
+    }
+    if (!best)
+        return null;
+    const replacement = buildReplacement(node, best.match, context);
+    if (replacement) {
+        log('Rewrote scan-project-filter over %s to backing %s', baseQualified, best.match.backing.name);
+    }
+    return replacement;
+}
+/**
+ * The aggregate arm: rewrite a logical `Aggregate(Filter?(scan))` answered from a
+ * grouped MV — exact-key direct scan or superset-key rollup re-aggregation. See
+ * `query-rewrite-matcher.ts` § aggregate-rollup arm.
+ */
+function rewriteAggregate(node, context, mvs, isDeterministic) {
+    const sm = context.db.schemaManager;
+    const frag = analyzeAggregateFragment(node);
+    if (!frag.ok)
+        return null;
+    const shape = frag.shape;
+    const baseQualified = `${shape.baseTable.schemaName}.${shape.baseTable.name}`.toLowerCase();
+    const matches = [];
+    for (const mv of mvs) {
+        if (mv.derivation.sourceTables.length !== 1 || mv.derivation.sourceTables[0] !== baseQualified)
+            continue;
+        const backing = sm.getTable(mv.schemaName, mv.name);
+        const res = matchAggregateFragmentToMv(shape, mv, backing, isDeterministic);
+        if (res.match)
+            matches.push(res.match);
+    }
+    if (matches.length === 0)
+        return null;
+    // Cost gate. Recompute-over-base is a base scan + pre-aggregation filter + the
+    // aggregation itself; the MV path skips the base scan (exact-key also skips the
+    // aggregation). `mvGroups ≪ baseRows` for a grouped MV, so the MV path usually
+    // wins — but the comparison stays honest on a tiny base.
+    const baseRows = estRows(context.stats.tableRows(shape.baseTable));
+    const queryGroups = estimateGroups(baseRows, shape.groupBaseCols.length);
+    const baseCost = recomputeAggCost(baseRows, shape.conjuncts.length > 0, queryGroups);
+    let best;
+    for (const m of matches) {
+        const rollup = m.rollup;
+        const mvGroups = aggregateBackingCardinality(context.stats.tableRows(m.backing), baseRows, mvGroupKeyCount(m));
+        const cost = rollup.exact
+            ? exactAggCost(mvGroups, m.residualConjuncts.length > 0, m.outputColumnMap.length)
+            : rollupAggCost(mvGroups, m.residualConjuncts.length > 0, queryGroups, rollup.groupKeyBackingCols.length + rollup.aggregates.length);
+        if (cost >= baseCost)
+            continue; // not strictly cheaper → decline this match
+        if (!best
+            || cost < best.cost
+            || (cost === best.cost && m.mv.name.toLowerCase() < best.match.mv.name.toLowerCase())) {
+            best = { match: m, cost };
+        }
+    }
+    if (!best)
+        return null;
+    const replacement = best.match.rollup.exact
+        ? buildReplacement(node, best.match, context) // exact-key: scan + residual filter + project
+        : buildRollupReplacement(node, best.match, context); // rollup: re-aggregate the backing
+    if (replacement) {
+        const kind = best.match.rollup.exact ? 'exact-key' : 'rollup';
+        log('Rewrote %s aggregate over %s to backing %s', kind, baseQualified, best.match.backing.name);
+    }
+    return replacement;
+}
+/**
+ * The join-subsumption arm: rewrite a `Project(Filter?(Join(T, P)))` query answered
+ * from a 1:1 row-preserving inner/cross-join MV — scan the MV's backing table
+ * (which materializes the join) with a residual filter / project, eliminating the
+ * join at read time. See `query-rewrite-matcher.ts` § join-subsumption arm.
+ */
+function rewriteJoinFragment(node, context, mvs, isDeterministic) {
+    const sm = context.db.schemaManager;
+    const frag = analyzeJoinQueryFragment(node);
+    if (!frag.ok)
+        return null;
+    const shape = frag.shape;
+    const qualA = qualifiedName(shape.tableRefs[0].tableSchema);
+    const qualB = qualifiedName(shape.tableRefs[1].tableSchema);
+    // Enumerate candidate MVs whose two source tables are exactly this join's tables.
+    const matches = [];
+    for (const mv of mvs) {
+        if (mv.derivation.sourceTables.length !== 2)
+            continue;
+        const sources = new Set(mv.derivation.sourceTables);
+        if (!sources.has(qualA) || !sources.has(qualB))
+            continue;
+        const backing = sm.getTable(mv.schemaName, mv.name);
+        const mvBodyRoot = plannedMvBodyRoot(context.db, mv) ?? undefined;
+        const res = matchJoinFragmentToMv(shape, mv, mvBodyRoot, backing, isDeterministic);
+        if (res.match)
+            matches.push(res.match);
+    }
+    if (matches.length === 0)
+        return null;
+    // Cost gate: the recompute side now pays both base scans + the join, so the
+    // backing scan wins decisively. Same cheapest-wins + stable-name tiebreak.
+    let best;
+    for (const m of matches) {
+        const info = m.joinInfo;
+        const tRows = estRows(context.stats.tableRows(info.drivingTable));
+        const pRows = estRows(context.stats.tableRows(info.lookupTable));
+        const backingRows = backingCardinality(context.stats.tableRows(m.backing), tRows, false);
+        const baseCost = recomputeJoinCost(tRows, pRows, shape.conjuncts.length > 0, m.outputColumnMap.length);
+        const cost = scanCost(backingRows, m.residualConjuncts.length > 0, m.outputColumnMap.length);
+        if (cost >= baseCost)
+            continue; // not strictly cheaper → decline this match
+        if (!best
+            || cost < best.cost
+            || (cost === best.cost && m.mv.name.toLowerCase() < best.match.mv.name.toLowerCase())) {
+            best = { match: m, cost };
+        }
+    }
+    if (!best)
+        return null;
+    const replacement = buildReplacement(node, best.match, context);
+    if (replacement) {
+        log('Rewrote 1:1-join %s ⋈ %s to backing %s', qualA, qualB, best.match.backing.name);
+    }
+    return replacement;
+}
+/**
+ * The MV body's optimized relational root, cached per MV schema object. Only the
+ * (rarely-fired) join arm needs it, and the structural 1:1 proof it feeds
+ * (`proveOneToOneJoin`) is stats-independent, so a cached plan stays valid across
+ * rule fires. Planned with the read-side rewrite suppressed (so the body is not
+ * re-pointed at any backing) — the nested optimize then bails on the suppression
+ * flag, avoiding recursion.
+ *
+ * Staleness: a **stale** MV (some source changed) drops its cache entry and returns
+ * `null`, so it is never a candidate while stale (matching the matcher's stale gate).
+ *
+ * Freshness validation: the stale flag alone is *not* sufficient to invalidate the
+ * cache. A `refresh` clears `stale` (rebuilding the backing) without firing this
+ * rule, so a root cached while the MV was fresh — then invalidated by a source
+ * `alter` and re-materialized by `refresh` *without* an intervening stale-window
+ * query to drop it — would otherwise be served against the rebuilt backing,
+ * mis-mapping a `select *` join body's columns (the body's column set shifts but the
+ * cached root's positions don't). A source `alter` swaps the `TableSchema` object
+ * (new identity), so {@link cachedBodyRootIsCurrent} re-derives whenever any base
+ * table the cached root reads is no longer the schema manager's current object.
+ * Only a successfully planned root is cached; a body that fails to plan is
+ * re-attempted each fire.
+ */
+const MV_BODY_ROOT_CACHE = new WeakMap();
+function plannedMvBodyRoot(db, mv) {
+    // Keyed on the derivation object — stable across catalog swaps of the owning
+    // table (tag updates spread a fresh TableSchema but share the derivation).
+    const d = mv.derivation;
+    if (d.stale === true) {
+        MV_BODY_ROOT_CACHE.delete(d);
+        return null;
+    }
+    const cached = MV_BODY_ROOT_CACHE.get(d);
+    if (cached !== undefined && cachedBodyRootIsCurrent(cached, db))
+        return cached;
+    let root = null;
+    try {
+        root = db.schemaManager.withSuppressedMaterializedViewRewrite(() => {
+            const plan = db.getPlan(d.selectAst);
+            return plan.getRelations()[0] ?? null;
+        });
+    }
+    catch {
+        root = null; // a body that no longer plans is simply not a candidate
+    }
+    if (root !== null)
+        MV_BODY_ROOT_CACHE.set(d, root);
+    else
+        MV_BODY_ROOT_CACHE.delete(d);
+    return root;
+}
+/** True iff every base table the cached body `root` reads is still the schema
+ *  manager's current `TableSchema` object. A source `alter` replaces the object
+ *  (new identity), so an identity mismatch means the root was planned against a
+ *  superseded source schema and must be re-derived (see the cache doc). */
+function cachedBodyRootIsCurrent(root, db) {
+    const sm = db.schemaManager;
+    for (const ref of collectBodyTableRefs(root)) {
+        if (sm.getTable(ref.tableSchema.schemaName, ref.tableSchema.name) !== ref.tableSchema)
+            return false;
+    }
+    return true;
+}
+/** Every `TableReferenceNode` in `node`'s subtree (depth-first). */
+function collectBodyTableRefs(node, out = []) {
+    if (node instanceof TableReferenceNode) {
+        out.push(node);
+        return out;
+    }
+    for (const rel of node.getRelations())
+        collectBodyTableRefs(rel, out);
+    return out;
+}
+/** `schema.table` lowercased — the qualified key matching an MV's `sourceTables`. */
+function qualifiedName(table) {
+    return `${table.schemaName}.${table.name}`.toLowerCase();
+}
+/** Cost of recomputing the fragment against the base table. */
+function recomputeCost(rows, hasFilter, outCount) {
+    return seqScanCost(rows) + (hasFilter ? filterCost(rows) : 0) + projectCost(rows, outCount);
+}
+/**
+ * Cost of recomputing a 1:1-join fragment against the base tables: both base scans
+ * plus the join (whose 1:1 output is one row per driving row) plus the residual
+ * filter / project. Uses `hashJoinCost` (the cheaper physical equi-join) so the cost
+ * gate stays conservative — it only rewrites when strictly cheaper than this floor.
+ */
+function recomputeJoinCost(tRows, pRows, hasFilter, outCount) {
+    const joinOut = tRows; // 1:1 join → one output row per driving row
+    const join = hashJoinCost(Math.min(tRows, pRows), Math.max(tRows, pRows));
+    return seqScanCost(tRows) + seqScanCost(pRows) + join
+        + (hasFilter ? filterCost(joinOut) : 0) + projectCost(joinOut, outCount);
+}
+/** Cost of answering from the MV backing scan + residual. */
+function scanCost(rows, hasResidual, outCount) {
+    return seqScanCost(rows) + (hasResidual ? filterCost(rows) : 0) + projectCost(rows, outCount);
+}
+function estRows(rows) {
+    return rows === undefined || rows <= 0 ? DEFAULT_ROWS : rows;
+}
+/**
+ * Effective backing cardinality. Prefer a real backing stat when it reflects the
+ * materialized subset (strictly fewer rows than the base); otherwise, when the MV
+ * carries a WHERE, model the pre-filter as a selectivity discount so the
+ * row-reduction win is captured even when stats are absent (memory tables).
+ */
+function backingCardinality(backingStat, baseRows, mvHasWhere) {
+    if (backingStat !== undefined && backingStat > 0 && backingStat < baseRows)
+        return backingStat;
+    return mvHasWhere ? Math.max(1, Math.round(baseRows * MV_WHERE_SELECTIVITY)) : baseRows;
+}
+/* ── Aggregate-arm cost surface ──────────────────────────────────────────── */
+/** Estimated distinct groups produced by a GROUP BY over `groupByCount` bare
+ *  columns of a `baseRows`-row relation. Mirrors `basic-estimates.ts`'s grouping
+ *  factor; a global scalar (`groupByCount === 0`) collapses to one group. */
+function estimateGroups(baseRows, groupByCount) {
+    if (groupByCount === 0)
+        return 1;
+    const factor = Math.min(0.8, Math.max(0.1, groupByCount * 0.2));
+    return Math.max(1, Math.round(baseRows * factor));
+}
+/** Number of GROUP BY columns in a matched MV's body (≥1 for a grouped MV). */
+function mvGroupKeyCount(match) {
+    const sel = match.mv.derivation.selectAst;
+    return sel.type === 'select' && sel.groupBy ? sel.groupBy.length : 1;
+}
+/**
+ * Effective backing cardinality (MV groups) for an aggregate MV. Prefer a real
+ * backing stat when it is strictly fewer rows than the base; otherwise model the
+ * grouping reduction with the same factor as {@link estimateGroups} so the win is
+ * visible even when stats are absent (memory tables).
+ */
+function aggregateBackingCardinality(backingStat, baseRows, mvGroupByCount) {
+    if (backingStat !== undefined && backingStat > 0 && backingStat < baseRows)
+        return backingStat;
+    return estimateGroups(baseRows, mvGroupByCount);
+}
+/** Cost of recomputing an aggregate fragment against the base table. */
+function recomputeAggCost(baseRows, hasFilter, queryGroups) {
+    return seqScanCost(baseRows) + (hasFilter ? filterCost(baseRows) : 0) + aggregateCost(baseRows, queryGroups);
+}
+/** Cost of an exact-key answer: a backing scan + residual + project (no re-aggregation). */
+function exactAggCost(mvGroups, hasResidual, outCount) {
+    return seqScanCost(mvGroups) + (hasResidual ? filterCost(mvGroups) : 0) + projectCost(mvGroups, outCount);
+}
+/** Cost of a rollup answer: a backing scan + residual + re-aggregation + project. */
+function rollupAggCost(mvGroups, hasResidual, queryGroups, outCount) {
+    return seqScanCost(mvGroups) + (hasResidual ? filterCost(mvGroups) : 0)
+        + aggregateCost(mvGroups, queryGroups) + projectCost(queryGroups, outCount);
+}
+/**
+ * Build the replacement subtree: a backing-table scan, the residual `Filter`
+ * (kept fragment conjuncts re-bound onto the backing columns), and a `Project`
+ * that re-emits the fragment's identical output attribute ids from the backing
+ * columns. Returns null if any residual conjunct cannot be re-bound (defensive —
+ * the matcher already proved every residual column is a backing column).
+ *
+ * Shared by the projection-filter arm (fragment root = `Project`) and the
+ * aggregate **exact-key** arm (fragment root = `Aggregate`): both answer from a
+ * direct backing scan whose every output column is a passthrough — `outputColumnMap`
+ * and `residualConjuncts` fully describe the rewrite, so the same builder serves
+ * both. `fragmentRoot` only supplies its `scope` and output attributes.
+ */
+function buildReplacement(fragmentRoot, match, context) {
+    const scope = fragmentRoot.scope;
+    const built = buildBackingSource(scope, match, context);
+    if (!built)
+        return null;
+    const { source, backingAttrs } = built;
+    // Residual project: re-emit the fragment's output attributes from the backing
+    // columns, preserving the fragment's attribute ids (the parent splice needs them).
+    const fragAttrs = fragmentRoot.getAttributes();
+    const projections = match.outputColumnMap.map((entry, i) => {
+        const colRef = colRefOnto(scope, backingAttrs[entry.backingCol], entry.backingCol);
+        return { node: colRef, alias: fragAttrs[i].name, attributeId: fragAttrs[i].id };
+    });
+    return new ProjectNode(scope, source, projections, undefined, fragAttrs, false);
+}
+/**
+ * The backing-table scan (`Retrieve(TableReference)`) plus the optional residual
+ * `Filter` (kept fragment conjuncts re-bound onto the backing columns). Shared by
+ * `buildReplacement` and `buildRollupReplacement`. Returns null if a residual
+ * conjunct cannot be re-bound (defensive — the matcher proved every residual column
+ * is a backing column).
+ */
+function buildBackingSource(scope, match, context) {
+    const backing = match.backing;
+    const backingRef = new TableReferenceNode(scope, backing, requireVtabModule(backing), backing.vtabAuxData, undefined, false, context.db.schemaManager);
+    const backingAttrs = backingRef.getAttributes();
+    let source = new RetrieveNode(scope, backingRef, backingRef);
+    if (match.residualConjuncts.length > 0) {
+        const remapped = [];
+        for (const conjunct of match.residualConjuncts) {
+            const r = remapToBacking(conjunct, match, backingAttrs, scope);
+            if (!r)
+                return null;
+            remapped.push(r);
+        }
+        source = new FilterNode(scope, source, andAll(remapped, scope));
+    }
+    return { source, backingAttrs };
+}
+/** A `ColumnReferenceNode` onto output column `col` of some relation (carrying its
+ *  attribute id, type, and name) — used for both backing-scan and re-aggregate columns. */
+function colRefOnto(scope, attr, col) {
+    return new ColumnReferenceNode(scope, { type: 'column', name: attr.name }, attr.type, attr.id, col);
+}
+/**
+ * Re-bind a residual conjunct's column references onto the backing scan: every
+ * `ColumnReferenceNode` is replaced with a reference to the backing column that
+ * holds it. The single-source arms key on the column's base-table index
+ * (`backingColOfBaseCol`); the join arm keys on the column's stable source
+ * attribute id (`backingColOfSourceAttrId`), since a base column index is ambiguous
+ * across a join. Other scalar nodes are rebuilt structurally. Returns undefined when
+ * a column is not a backing column (the matcher prevents this; the guard is defensive).
+ */
+function remapToBacking(node, match, backingAttrs, scope) {
+    if (node instanceof ColumnReferenceNode) {
+        const backingCol = match.backingColOfSourceAttrId
+            ? match.backingColOfSourceAttrId.get(node.attributeId)
+            : match.backingColOfBaseCol.get(node.columnIndex);
+        if (backingCol === undefined)
+            return undefined;
+        const bAttr = backingAttrs[backingCol];
+        return new ColumnReferenceNode(scope, node.expression, bAttr.type, bAttr.id, backingCol);
+    }
+    const children = node.getChildren();
+    if (children.length === 0)
+        return node;
+    const newChildren = [];
+    for (const child of children) {
+        const r = remapToBacking(child, match, backingAttrs, scope);
+        if (!r)
+            return undefined;
+        newChildren.push(r);
+    }
+    return node.withChildren(newChildren);
+}
+/** AND-fold a non-empty list of predicate conjuncts into one scalar predicate. */
+function andAll(nodes, scope) {
+    let acc = nodes[0];
+    for (let i = 1; i < nodes.length; i++) {
+        const ast = {
+            type: 'binary',
+            operator: 'AND',
+            left: exprOf(acc),
+            right: exprOf(nodes[i]),
+        };
+        acc = new BinaryOpNode(scope, ast, acc, nodes[i]);
+    }
+    return acc;
+}
+/** The originating AST of a scalar node, or a literal-true placeholder. */
+function exprOf(node) {
+    const expr = node.expression;
+    return expr ?? { type: 'literal', value: 1n };
+}
+/* ── Rollup replacement (superset-key re-aggregation) ────────────────────── */
+/**
+ * Build the rollup replacement: a backing scan → optional residual `Filter` on the
+ * group-key columns → a **new** logical `Aggregate` that re-aggregates the stored
+ * partials down to the query's coarser key → a `Project` that recombines the
+ * partials into the fragment's output columns, preserving the fragment aggregate's
+ * output attribute ids. The new logical `Aggregate` flows through the impl pass's
+ * normal Stream/Hash selection. Returns null if a recombine function fails to
+ * resolve (defensive — the builtins always resolve).
+ */
+function buildRollupReplacement(aggNode, match, context) {
+    const scope = aggNode.scope;
+    const sm = context.db.schemaManager;
+    const rollup = match.rollup;
+    const built = buildBackingSource(scope, match, context);
+    if (!built)
+        return null;
+    const { source, backingAttrs } = built;
+    // Re-aggregate GROUP BY: a ColumnReference onto each backing group-key column.
+    const groupBy = rollup.groupKeyBackingCols.map(bc => colRefOnto(scope, backingAttrs[bc], bc));
+    // Flattened primitive recombine aggregates; `primIdx[ri]` holds the indices (into
+    // this list) recipe `ri` consumes (avg consumes two `sum`s, others one).
+    const primitives = [];
+    const primIdx = [];
+    for (const recipe of rollup.aggregates) {
+        const idxs = [];
+        for (const prim of primitiveAggsFor(recipe)) {
+            const agg = buildReaggAggregate(scope, sm, prim.fn, backingAttrs[prim.backingCol], prim.backingCol);
+            if (!agg)
+                return null;
+            idxs.push(primitives.length);
+            primitives.push(agg);
+        }
+        primIdx.push(idxs);
+    }
+    const reagg = new AggregateNode(scope, source, groupBy, primitives);
+    const reaggAttrs = reagg.getAttributes();
+    const groupCount = groupBy.length;
+    // Project: group-key passthroughs, then the per-recipe recombine output,
+    // preserving the fragment aggregate's output attribute ids (parent splice needs them).
+    const projections = [];
+    rollup.groupOutAttrs.forEach((outAttr, i) => {
+        projections.push({ node: colRefOnto(scope, reaggAttrs[i], i), alias: outAttr.name, attributeId: outAttr.id });
+    });
+    for (let ri = 0; ri < rollup.aggregates.length; ri++) {
+        const recipe = rollup.aggregates[ri];
+        const primRefs = primIdx[ri].map(k => colRefOnto(scope, reaggAttrs[groupCount + k], groupCount + k));
+        const node = buildRecipeOutput(scope, sm, recipe, primRefs);
+        if (!node)
+            return null;
+        projections.push({ node, alias: recipe.outAttr.name, attributeId: recipe.outAttr.id });
+    }
+    const fragAttrs = aggNode.getAttributes();
+    return new ProjectNode(scope, reagg, projections, undefined, fragAttrs, false);
+}
+/** The primitive re-aggregations a recipe consumes: `count` recombines via `sum`;
+ *  `avg` via two `sum`s (over the stored sum and count); the rest are 1:1. */
+function primitiveAggsFor(recipe) {
+    switch (recipe.kind) {
+        case 'sum': return [{ fn: 'sum', backingCol: recipe.backingCols[0] }];
+        case 'min': return [{ fn: 'min', backingCol: recipe.backingCols[0] }];
+        case 'max': return [{ fn: 'max', backingCol: recipe.backingCols[0] }];
+        case 'count': return [{ fn: 'sum', backingCol: recipe.backingCols[0] }];
+        case 'avg': return [{ fn: 'sum', backingCol: recipe.backingCols[0] }, { fn: 'sum', backingCol: recipe.backingCols[1] }];
+        default: {
+            const _exhaustive = recipe.kind;
+            void _exhaustive;
+            return [];
+        }
+    }
+}
+/** Build a re-aggregation `fn(backingCol)` (a non-distinct `sum`/`min`/`max`). */
+function buildReaggAggregate(scope, sm, fn, backingAttr, backingCol) {
+    const schema = sm.findFunction(fn, 1);
+    if (!schema || !isAggregateFunctionSchema(schema))
+        return undefined;
+    const colRef = colRefOnto(scope, backingAttr, backingCol);
+    const fnExpr = { type: 'function', name: fn, args: [colRef.expression], distinct: false };
+    const inferred = schema.inferReturnType ? schema.inferReturnType([backingAttr.type.logicalType]) : schema.returnType;
+    const node = new AggregateFunctionCallNode(scope, fnExpr, fn, schema, [colRef], false, undefined, undefined, inferred);
+    return { expression: node, alias: `${fn}(${backingAttr.name})` };
+}
+/**
+ * Recombine a recipe's re-aggregated primitive(s) into the fragment's output scalar:
+ *  - `sum`/`min`/`max` — passthrough of the single primitive.
+ *  - `count` — `coalesce(sum, 0)`: the re-aggregated `sum` is NULL only over zero
+ *    backing rows (the empty global group), where `count` must be 0, not NULL.
+ *  - `avg` — `sum / count` (Quereus `/` is real division; NULL/0 over zero rows ⇒ NULL).
+ */
+function buildRecipeOutput(scope, sm, recipe, primRefs) {
+    if (recipe.kind === 'avg') {
+        const ast = { type: 'binary', operator: '/', left: primRefs[0].expression, right: primRefs[1].expression };
+        return new BinaryOpNode(scope, ast, primRefs[0], primRefs[1]);
+    }
+    if (recipe.kind === 'count') {
+        const schema = sm.findFunction('coalesce', 2) ?? sm.findFunction('coalesce', -1);
+        if (!schema || !isScalarFunctionSchema(schema))
+            return undefined;
+        const zero = new LiteralNode(scope, { type: 'literal', value: 0 });
+        const ast = { type: 'function', name: 'coalesce', args: [primRefs[0].expression, zero.expression] };
+        return new ScalarFunctionCallNode(scope, ast, schema, [primRefs[0], zero]);
+    }
+    // sum / min / max — passthrough of the single re-aggregated partial.
+    return primRefs[0];
+}
+//# sourceMappingURL=rule-materialized-view-rewrite.js.map

package/dist/src/planner/rules/cache/rule-materialized-view-rewrite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-materialized-view-rewrite.js","sourceRoot":"","sources":["../../../../../src/planner/rules/cache/rule-materialized-view-rewrite.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAIzD,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AAC9D,OAAO,EAAE,yBAAyB,EAAE,MAAM,mCAAmC,CAAC;AAC9E,OAAO,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AACjE,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AACnF,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAClE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AAChG,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAC7D,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACxG,OAAO,EACN,oBAAoB,EACpB,iBAAiB,EACjB,wBAAwB,EACxB,0BAA0B,EAC1B,wBAAwB,EACxB,qBAAqB,GAIrB,MAAM,yCAAyC,CAAC;AAIjD,MAAM,GAAG,GAAG,YAAY,CAAC,0CAA0C,CAAC,CAAC;AAErE;;;qEAGqE;AACrE,MAAM,OAAO,GAAG,2BAA2B,CAAC;AAE5C;yEACyE;AACzE,MAAM,YAAY,GAAG,IAAI,CAAC;AAC1B;qFACqF;AACrF,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAEjC,MAAM,UAAU,2BAA2B,CAAC,IAAc,EAAE,OAAmB;IAC9E,2EAA2E;IAC3E,gFAAgF;IAChF,4EAA4E;IAC5E,mFAAmF;IACnF,IAAI,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5D,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,aAAa,CAAC;IACpC,+EAA+E;IAC/E,4EAA4E;IAC5E,yBAAyB;IACzB,IAAI,EAAE,CAAC,mCAAmC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1D,MAAM,GAAG,GAAG,EAAE,CAAC,sBAAsB,EAAE,CAAC;IACxC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAElC,2EAA2E;IAC3E,2EAA2E;IAC3E,8EAA8E;IAC9E,wCAAwC;IACxC,MAAM,eAAe,GAAqB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE;QACxD,MAAM,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACnE,CAAC,CAAC;IAEF,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;QACjC,4EAA4E;QAC5E,2EAA2E;QAC3E,OAAO,uBAAuB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC;eAC/D,mBAAmB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,IAAI,YAAY,aAAa;QAAE,OAAO,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;IAChG,OAAO,IAAI,CAAC;AACb,CAAC;AAMD,oFAAoF;AACpF,SAAS,uBAAuB,CAC/B,IAAiB,EACjB,OAAmB,EACnB,GAAW,EACX,eAAiC;IAEjC,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,aAAa,CAAC;IACpC,MAAM,IAAI,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,UAAU,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE5F,2EAA2E;IAC3E,gEAAgE;IAChE,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,aAAa;YAAE,SAAS;QACzG,MAAM,OAAO,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,iBAAiB,CAAC,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;QACnE,IAAI,GAAG,CAAC,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,4EAA4E;IAC5E,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;IACnE,MAAM,QAAQ,GAAG,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAE3F,IAAI,IAAuD,CAAC;IAC5D,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,KAAK,SAAS,CAAC;QAChH,MAAM,WAAW,GAAG,kBAAkB,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QACjG,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC7F,IAAI,IAAI,IAAI,QAAQ;YAAE,SAAS,CAAC,4CAA4C;QAC5E,IAAI,CAAC,IAAI;eACL,IAAI,GAAG,IAAI,CAAC,IAAI;eAChB,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YACxF,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;QAC3B,CAAC;IACF,CAAC;IACD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChE,IAAI,WAAW,EAAE,CAAC;QACjB,GAAG,CAAC,mDAAmD,EAAE,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAClG,CAAC;IACD,OAAO,WAAW,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CACxB,IAAmB,EACnB,OAAmB,EACnB,GAAW,EACX,eAAiC;IAEjC,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,aAAa,CAAC;IACpC,MAAM,IAAI,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,UAAU,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE5F,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,aAAa;YAAE,SAAS;QACzG,MAAM,OAAO,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,0BAA0B,CAAC,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;QAC5E,IAAI,GAAG,CAAC,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,+EAA+E;IAC/E,gFAAgF;IAChF,+EAA+E;IAC/E,yDAAyD;IACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;IACnE,MAAM,WAAW,GAAG,cAAc,CAAC,QAAQ,EAAE,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;IACzE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;IAErF,IAAI,IAAuD,CAAC;IAC5D,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAO,CAAC;QACzB,MAAM,QAAQ,GAAG,2BAA2B,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/G,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK;YACxB,CAAC,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;YAClF,CAAC,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,mBAAmB,CAAC,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACtI,IAAI,IAAI,IAAI,QAAQ;YAAE,SAAS,CAAC,4CAA4C;QAC5E,IAAI,CAAC,IAAI;eACL,IAAI,GAAG,IAAI,CAAC,IAAI;eAChB,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YACxF,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;QAC3B,CAAC;IACF,CAAC;IACD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAO,CAAC,KAAK;QAC3C,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAQ,8CAA8C;QACnG,CAAC,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,mCAAmC;IACzF,IAAI,WAAW,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAO,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC/D,GAAG,CAAC,4CAA4C,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,WAAW,CAAC;AACpB,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAC3B,IAAiB,EACjB,OAAmB,EACnB,GAAW,EACX,eAAiC;IAEjC,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,aAAa,CAAC;IACpC,MAAM,IAAI,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IAE5D,kFAAkF;IAClF,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACtD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACzD,MAAM,OAAO,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,UAAU,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC;QAClE,MAAM,GAAG,GAAG,qBAAqB,CAAC,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;QACnF,IAAI,GAAG,CAAC,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,4EAA4E;IAC5E,2EAA2E;IAC3E,IAAI,IAAuD,CAAC;IAC5D,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAS,CAAC;QACzB,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,kBAAkB,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACzF,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACvG,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC7F,IAAI,IAAI,IAAI,QAAQ;YAAE,SAAS,CAAC,4CAA4C;QAC5E,IAAI,CAAC,IAAI;eACL,IAAI,GAAG,IAAI,CAAC,IAAI;eAChB,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YACxF,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;QAC3B,CAAC;IACF,CAAC;IACD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChE,IAAI,WAAW,EAAE,CAAC;QACjB,GAAG,CAAC,wCAAwC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACtF,CAAC;IACD,OAAO,WAAW,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,kBAAkB,GAAG,IAAI,OAAO,EAAuC,CAAC;AAE9E,SAAS,iBAAiB,CAAC,EAAoB,EAAE,EAAyB;IACzE,6EAA6E;IAC7E,2EAA2E;IAC3E,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC;IACxB,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QACtB,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACb,CAAC;IACD,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzC,IAAI,MAAM,KAAK,SAAS,IAAI,uBAAuB,CAAC,MAAM,EAAE,EAAE,CAAC;QAAE,OAAO,MAAM,CAAC;IAC/E,IAAI,IAAI,GAA8B,IAAI,CAAC;IAC3C,IAAI,CAAC;QACJ,IAAI,GAAG,EAAE,CAAC,aAAa,CAAC,qCAAqC,CAAC,GAAG,EAAE;YAClE,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,SAAwB,CAAC,CAAC;YACpD,OAAQ,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAoC,IAAI,IAAI,CAAC;QAC3E,CAAC,CAAC,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACR,IAAI,GAAG,IAAI,CAAC,CAAC,wDAAwD;IACtE,CAAC;IACD,IAAI,IAAI,KAAK,IAAI;QAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;;QAAM,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtF,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;2EAG2E;AAC3E,SAAS,uBAAuB,CAAC,IAAwB,EAAE,EAAoB;IAC9E,MAAM,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,UAAU,EAAE,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,WAAW;YAAE,OAAO,KAAK,CAAC;IACrG,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,oEAAoE;AACpE,SAAS,oBAAoB,CAAC,IAAwB,EAAE,MAA4B,EAAE;IACrF,IAAI,IAAI,YAAY,kBAAkB,EAAE,CAAC;QAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAAC,OAAO,GAAG,CAAC;IAAC,CAAC;IACvE,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE;QAAE,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACtE,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,qFAAqF;AACrF,SAAS,aAAa,CAAC,KAA2C;IACjE,OAAO,GAAG,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AAC1D,CAAC;AAED,+DAA+D;AAC/D,SAAS,aAAa,CAAC,IAAY,EAAE,SAAkB,EAAE,QAAgB;IACxE,OAAO,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC7F,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,KAAa,EAAE,KAAa,EAAE,SAAkB,EAAE,QAAgB;IAC5F,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,4CAA4C;IACnE,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1E,OAAO,WAAW,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,IAAI;UAClD,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AAC3E,CAAC;AAED,6DAA6D;AAC7D,SAAS,QAAQ,CAAC,IAAY,EAAE,WAAoB,EAAE,QAAgB;IACrE,OAAO,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC/F,CAAC;AAED,SAAS,OAAO,CAAC,IAAwB;IACxC,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,WAA+B,EAAE,QAAgB,EAAE,UAAmB;IACjG,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,GAAG,QAAQ;QAAE,OAAO,WAAW,CAAC;IAC/F,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AACzF,CAAC;AAED,gFAAgF;AAEhF;;6EAE6E;AAC7E,SAAS,cAAc,CAAC,QAAgB,EAAE,YAAoB;IAC7D,IAAI,YAAY,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG,CAAC,CAAC,CAAC;IAChE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,+EAA+E;AAC/E,SAAS,eAAe,CAAC,KAAmB;IAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC;IAC1C,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACtE,CAAC;AAED;;;;;GAKG;AACH,SAAS,2BAA2B,CAAC,WAA+B,EAAE,QAAgB,EAAE,cAAsB;IAC7G,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,GAAG,QAAQ;QAAE,OAAO,WAAW,CAAC;IAC/F,OAAO,cAAc,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;AACjD,CAAC;AAED,wEAAwE;AACxE,SAAS,gBAAgB,CAAC,QAAgB,EAAE,SAAkB,EAAE,WAAmB;IAClF,OAAO,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAC9G,CAAC;AAED,4FAA4F;AAC5F,SAAS,YAAY,CAAC,QAAgB,EAAE,WAAoB,EAAE,QAAgB;IAC7E,OAAO,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AAC3G,CAAC;AAED,qFAAqF;AACrF,SAAS,aAAa,CAAC,QAAgB,EAAE,WAAoB,EAAE,WAAmB,EAAE,QAAgB;IACnG,OAAO,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;UACpE,aAAa,CAAC,QAAQ,EAAE,WAAW,CAAC,GAAG,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;AAC9E,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,gBAAgB,CAAC,YAAgC,EAAE,KAAmB,EAAE,OAAmB;IACnG,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC;IACjC,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;IAEvC,8EAA8E;IAC9E,mFAAmF;IACnF,MAAM,SAAS,GAAG,YAAY,CAAC,aAAa,EAAE,CAAC;IAC/C,MAAM,WAAW,GAAG,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;QAC1D,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;QACnF,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IACjF,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,SAAwB,EAAE,KAAK,CAAC,CAAC;AAChG,CAAC;AAED;;;;;;GAMG;AACH,SAAS,kBAAkB,CAC1B,KAAY,EACZ,KAAmB,EACnB,OAAmB;IAEnB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;IAC9B,MAAM,UAAU,GAAG,IAAI,kBAAkB,CACxC,KAAK,EACL,OAAO,EACP,iBAAiB,CAAC,OAAO,CAAC,EAC1B,OAAO,CAAC,WAAW,EACnB,SAAS,EACT,KAAK,EACL,OAAO,CAAC,EAAE,CAAC,aAAa,CACxB,CAAC;IACF,MAAM,YAAY,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;IAChD,IAAI,MAAM,GAAuB,IAAI,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;IAEjF,IAAI,KAAK,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAqB,EAAE,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAChD,MAAM,CAAC,GAAG,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAC/D,IAAI,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;AACjC,CAAC;AAED;2FAC2F;AAC3F,SAAS,UAAU,CAAC,KAAY,EAAE,IAAe,EAAE,GAAW;IAC7D,OAAO,IAAI,mBAAmB,CAC7B,KAAK,EACL,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAoB,EACrD,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,EAAE,EACP,GAAG,CACH,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,cAAc,CACtB,IAAoB,EACpB,KAAmB,EACnB,YAAkC,EAClC,KAA2B;IAE3B,IAAI,IAAI,YAAY,mBAAmB,EAAE,CAAC;QACzC,MAAM,UAAU,GAAG,KAAK,CAAC,wBAAwB;YAChD,CAAC,CAAC,KAAK,CAAC,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC;YACtD,CAAC,CAAC,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC/C,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;QACvC,OAAO,IAAI,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAC1F,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACpC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,MAAM,WAAW,GAAe,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,cAAc,CAAC,KAAuB,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;QAC9E,IAAI,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACzB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,CAAmB,CAAC;AACzD,CAAC;AAED,kFAAkF;AAClF,SAAS,MAAM,CAAC,KAAgC,EAAE,KAA2B;IAC5E,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,GAAG,GAAmB;YAC3B,IAAI,EAAE,QAAQ;YACd,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC;YACjB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACvB,CAAC;QACF,GAAG,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,2EAA2E;AAC3E,SAAS,MAAM,CAAC,IAAoB;IACnC,MAAM,IAAI,GAAI,IAAwC,CAAC,UAAU,CAAC;IAClE,OAAO,IAAI,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAqB,CAAC;AAClE,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;GAQG;AACH,SAAS,sBAAsB,CAAC,OAAsB,EAAE,KAAmB,EAAE,OAAmB;IAC/F,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,aAAa,CAAC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAO,CAAC;IAE7B,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;IAEvC,+EAA+E;IAC/E,MAAM,OAAO,GAAG,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE9F,kFAAkF;IAClF,yEAAyE;IACzE,MAAM,UAAU,GAAoD,EAAE,CAAC;IACvE,MAAM,OAAO,GAAe,EAAE,CAAC;IAC/B,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACxC,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,MAAM,GAAG,GAAG,mBAAmB,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACpG,IAAI,CAAC,GAAG;gBAAE,OAAO,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC7B,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IACpE,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;IACzC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC;IAElC,yEAAyE;IACzE,uFAAuF;IACvF,MAAM,WAAW,GAAmE,EAAE,CAAC;IACvF,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE;QAC3C,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;IAC/G,CAAC,CAAC,CAAC;IACH,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QACtD,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,UAAU,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;QACrG,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;IACxF,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAC1C,OAAO,IAAI,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,SAAwB,EAAE,KAAK,CAAC,CAAC;AAC/F,CAAC;AAED;8EAC8E;AAC9E,SAAS,gBAAgB,CAAC,MAAuB;IAChD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtE,KAAK,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtE,KAAK,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtE,KAAK,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxE,KAAK,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxH,OAAO,CAAC,CAAC,CAAC;YAAC,MAAM,WAAW,GAAU,MAAM,CAAC,IAAI,CAAC;YAAC,KAAK,WAAW,CAAC;YAAC,OAAO,EAAE,CAAC;QAAC,CAAC;IAClF,CAAC;AACF,CAAC;AAED,kFAAkF;AAClF,SAAS,mBAAmB,CAC3B,KAAY,EACZ,EAAqC,EACrC,EAAU,EACV,WAAsB,EACtB,UAAkB;IAElB,MAAM,MAAM,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACtC,IAAI,CAAC,MAAM,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC;QAAE,OAAO,SAAS,CAAC;IACpE,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAqB,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC5G,MAAM,QAAQ,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC;IACrH,MAAM,IAAI,GAAG,IAAI,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACvH,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,WAAW,CAAC,IAAI,GAAG,EAAE,CAAC;AAClE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CACzB,KAAY,EACZ,EAAqC,EACrC,MAAuB,EACvB,QAAwC;IAExC,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAmB,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;QAC3H,OAAO,IAAI,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,EAAE,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;QACjF,IAAI,CAAC,MAAM,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC;YAAE,OAAO,SAAS,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAqB,CAAC,CAAC;QACtF,MAAM,GAAG,GAAqB,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QACtH,OAAO,IAAI,sBAAsB,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAC5E,CAAC;IACD,qEAAqE;IACrE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC"}