mindoodb 0.0.63 → 0.0.64

package/dist/core/query/executeQueryInclude.js

@@ -0,0 +1,447 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.extractJoinKey = extractJoinKey;
+exports.validateQueryIncludes = validateQueryIncludes;
+exports.hydrateQueryIncludes = hydrateQueryIncludes;
+const expressions_1 = require("../expressions");
+const extractSummaryFields_1 = require("../indexing/summary/extractSummaryFields");
+const types_1 = require("./types");
+const queryInternals_1 = require("./queryInternals");
+/** Splits nested `and` nodes into a flat list of conjuncts. */
+function flattenConjuncts(expression) {
+    if (expression.kind === "operation" && expression.op === "and") {
+        return expression.args.flatMap((arg) => flattenConjuncts(arg));
+    }
+    return [expression];
+}
+function combineConjuncts(conjuncts) {
+    if (conjuncts.length === 0) {
+        return null;
+    }
+    if (conjuncts.length === 1) {
+        return conjuncts[0];
+    }
+    return { kind: "operation", op: "and", args: conjuncts };
+}
+function referencesParent(expression) {
+    return (0, expressions_1.analyzeExpressionRequirements)(expression).needsParentContext;
+}
+/**
+ * Reduces an include filter to the one join equality the planner can
+ * execute, plus the parent-free rest.
+ *
+ * Accepted: exactly one equality between a child term (`field(X)` or
+ * `docId()`) and a parent term (`parent(Y)` or `parentDocId()`), in
+ * either operand order, optionally ANDed with conditions that do not
+ * mention the parent.
+ * Rejected: everything else that references the parent — a range
+ * comparison against a parent value, an `or` spanning parent terms, a
+ * second parent equality. Those would each require evaluating the filter
+ * once per (parent, child) pair, which turns a linear scan into a nested
+ * loop; a slot over 200 paged parents and 10k children would be ~2M
+ * evaluations. Rejecting them keeps the cost model of `query()` intact
+ * and the failure obvious instead of silently slow.
+ */
+function extractJoinKey(filter) {
+    const conjuncts = flattenConjuncts(filter);
+    const parentConjuncts = conjuncts.filter((conjunct) => referencesParent(conjunct));
+    const parentFree = conjuncts.filter((conjunct) => !referencesParent(conjunct));
+    if (parentConjuncts.length === 0) {
+        return {
+            ok: false,
+            reason: "it does not reference the parent document. Add the join condition " +
+                'v.eq(v.field("<child field>"), v.parentDocId()) (or use localKey)',
+        };
+    }
+    if (parentConjuncts.length > 1) {
+        return {
+            ok: false,
+            reason: `it references the parent document in ${parentConjuncts.length} separate conditions. ` +
+                "Exactly one parent equality can be used as the join key",
+        };
+    }
+    const join = parentConjuncts[0];
+    if (join.kind !== "operation" || join.op !== "eq" || join.args.length !== 2) {
+        return {
+            ok: false,
+            reason: `the condition referencing the parent is not an equality: ${(0, expressions_1.formatMindooDBFormulaExpression)(join)}. ` +
+                'Only v.eq(v.field("<child field>"), v.parentDocId()) and friends can be used as the join key',
+        };
+    }
+    const [left, right] = join.args;
+    const plan = joinSides(left, right) ??
+        joinSides(right, left) ??
+        null;
+    if (!plan) {
+        return {
+            ok: false,
+            reason: `the join equality compares ${(0, expressions_1.formatMindooDBFormulaExpression)(join)}. ` +
+                "One side must read the related document (v.field(...) or v.docId()), " +
+                "the other the parent (v.parent(...) or v.parentDocId())",
+        };
+    }
+    return {
+        ok: true,
+        plan: { ...plan, residualFilter: combineConjuncts(parentFree) },
+    };
+}
+/** Reads an expression as the child side of a join equality. */
+function childJoinSide(expression) {
+    if (expression.kind === "field") {
+        return { kind: "field", path: expression.path };
+    }
+    if (expression.kind === "operation" && expression.op === "docId") {
+        return { kind: "docId" };
+    }
+    return null;
+}
+/** Reads an expression as the parent side of a join equality. */
+function parentJoinSide(expression) {
+    if (expression.kind === "parent") {
+        return { kind: "field", path: expression.path };
+    }
+    if (expression.kind === "operation" && expression.op === "parentDocId") {
+        return { kind: "docId" };
+    }
+    return null;
+}
+/** Pairs the two operands of an equality in the given order, if they fit. */
+function joinSides(childCandidate, parentCandidate) {
+    const child = childJoinSide(childCandidate);
+    const parent = parentJoinSide(parentCandidate);
+    return child && parent ? { child, parent } : null;
+}
+/** Builds the join plan of a slot from `localKey` and/or `filter`. */
+function planInclude(slot, include) {
+    if (include.localKey !== undefined) {
+        // `localKey` already IS the join key, so an additional filter must not
+        // introduce a second one — it can only narrow the children further.
+        if (include.filter && referencesParent(include.filter)) {
+            throw new types_1.MindooQueryError(`Include "${slot}" combines localKey with a filter that also references the parent document. ` +
+                "Use either localKey or a parent join condition, not both.");
+        }
+        return {
+            child: { kind: "docId" },
+            parent: { kind: "field", path: include.localKey },
+            residualFilter: include.filter ?? null,
+        };
+    }
+    const extraction = extractJoinKey(include.filter);
+    if (!extraction.ok) {
+        throw new types_1.MindooQueryError(`Include "${slot}" cannot be joined because ${extraction.reason}.`);
+    }
+    return extraction.plan;
+}
+/**
+ * Structural validation of the include tree, run before any scanning so a
+ * malformed query fails immediately rather than after the root scan.
+ */
+function validateQueryIncludes(includes, depth = 1, slotPath = "") {
+    for (const [slot, include] of Object.entries(includes)) {
+        const label = slotPath ? `${slotPath}.${slot}` : slot;
+        if (slot.trim() === "") {
+            throw new types_1.MindooQueryError("Include slot names must not be empty.");
+        }
+        if (depth > types_1.MAX_INCLUDE_DEPTH) {
+            throw new types_1.MindooQueryError(`Include "${label}" nests ${depth} levels deep, more than the maximum of ${types_1.MAX_INCLUDE_DEPTH}.`);
+        }
+        if (include.cardinality !== "one" && include.cardinality !== "many") {
+            throw new types_1.MindooQueryError(`Include "${label}" needs an explicit cardinality of "one" or "many" ` +
+                `(got ${JSON.stringify(include.cardinality)}).`);
+        }
+        if (include.localKey === undefined && include.filter === undefined) {
+            throw new types_1.MindooQueryError(`Include "${label}" needs a localKey or a filter to relate documents to the parent row.`);
+        }
+        if (include.localKey !== undefined && include.localKey.trim() === "") {
+            throw new types_1.MindooQueryError(`Include "${label}" has an empty localKey.`);
+        }
+        if (include.cardinality === "one") {
+            if (include.sortBy !== undefined) {
+                throw new types_1.MindooQueryError(`Include "${label}" has cardinality "one", which resolves to a single row — sortBy is meaningless there.`);
+            }
+            if (include.limit !== undefined) {
+                throw new types_1.MindooQueryError(`Include "${label}" has cardinality "one", which resolves to a single row — limit is meaningless there.`);
+            }
+        }
+        if (include.limit !== undefined && (!Number.isFinite(include.limit) || include.limit < 0)) {
+            throw new types_1.MindooQueryError(`Include "${label}" has an invalid limit (${include.limit}).`);
+        }
+        if (include.db && !include.db.getSummaryStore) {
+            throw new types_1.MindooQueryError(`Include "${label}" points at a MindooDB instance without a summary buffer, which cannot answer queries.`);
+        }
+        for (const sortKey of include.sortBy ?? []) {
+            if (sortKey.special === "textScore") {
+                throw new types_1.MindooQueryError(`Include "${label}" sorts by textScore, but includes have no text clause to score against.`);
+            }
+            if (sortKey.expression && referencesParent(sortKey.expression)) {
+                throw new types_1.MindooQueryError(`Include "${label}" sorts by an expression referencing the parent document. ` +
+                    "Sorting applies to the related documents only.");
+            }
+        }
+        if (include.filter) {
+            validateIncludeFilter(label, include.filter);
+        }
+        if (include.include) {
+            validateQueryIncludes(include.include, depth + 1, label);
+        }
+    }
+}
+function validateIncludeFilter(label, filter) {
+    const unknown = (0, expressions_1.findUnknownExpressionNode)(filter);
+    if (unknown !== null) {
+        throw new types_1.MindooQueryError(`Include "${label}" has a filter containing ${unknown}, which the expression language does not define. ` +
+            "Build expressions with createViewLanguage() (or pass the filter as formula source text).");
+    }
+    const requirements = (0, expressions_1.analyzeExpressionRequirements)(filter);
+    if (requirements.needsViewContext) {
+        throw new types_1.MindooQueryError(`Include "${label}" has a filter using view-tree operations ` +
+            `(${requirements.viewContextOperations.join(", ")}); these only evaluate inside a materialized view.`);
+    }
+    if (requirements.needsDecryption) {
+        throw new types_1.MindooQueryError(`Include "${label}" has a filter referencing encrypted fields (decrypt), ` +
+            "which the summary buffer does not store.");
+    }
+}
+/** Reads the join value of a parent row for the planned parent side. */
+function readParentJoinValue(parent, side) {
+    return side.kind === "docId" ? parent.docId : (0, extractSummaryFields_1.getSummaryFieldValue)(parent.doc, side.path);
+}
+/** Reads the join value of a candidate child for the planned child side. */
+function readChildJoinValue(docId, evaluationDoc, side) {
+    return side.kind === "docId" ? docId : (0, extractSummaryFields_1.getSummaryFieldValue)(evaluationDoc, side.path);
+}
+/**
+ * A join value may be a list (`memberIds: ["u_1", "u_2"]`), in which case
+ * every element joins independently — that is what makes `localKey` work
+ * for "this document references several others".
+ */
+function joinValuesOf(value) {
+    if (value === undefined || value === null) {
+        return [];
+    }
+    if (Array.isArray(value)) {
+        return value.filter((item) => item !== undefined && item !== null);
+    }
+    return [value];
+}
+function assertNotAborted(options, slot) {
+    if (options?.signal?.aborted) {
+        throw new types_1.MindooQueryError(`Query aborted while resolving include "${slot}".`);
+    }
+}
+function resolveIncludeSummary(db, label) {
+    if (!db.getSummaryStore) {
+        throw new types_1.MindooQueryError(`Include "${label}" points at a MindooDB instance without a summary buffer, which cannot answer queries.`);
+    }
+    return db.getSummaryStore();
+}
+/** Verifies that both sides of the join are answerable from their summaries. */
+function checkIncludeCoverage(label, plan, include, childSummary, parentSummary) {
+    const childPaths = new Set();
+    if (plan.child.kind === "field") {
+        childPaths.add(plan.child.path);
+    }
+    if (plan.residualFilter) {
+        for (const path of (0, expressions_1.getReferencedFields)(plan.residualFilter)) {
+            childPaths.add(path);
+        }
+    }
+    for (const sortKey of include.sortBy ?? []) {
+        if (sortKey.expression) {
+            for (const path of (0, expressions_1.getReferencedFields)(sortKey.expression)) {
+                childPaths.add(path);
+            }
+        }
+        else if (sortKey.field) {
+            childPaths.add(sortKey.field);
+        }
+    }
+    for (const path of childPaths) {
+        if (!childSummary.isFieldCovered(path)) {
+            throw new types_1.MindooQueryError(`Include "${label}" references field "${path}", which is not covered by the summary configuration ` +
+                "of the database it looks up (check include/exclude in SummaryConfig).");
+        }
+    }
+    // Parent-side paths are checked against the PARENT summary: that is the
+    // buffer the join value is actually read from.
+    const parentPaths = new Set();
+    if (plan.parent.kind === "field") {
+        parentPaths.add(plan.parent.path);
+    }
+    if (include.filter) {
+        for (const path of (0, expressions_1.getReferencedParentFields)(include.filter)) {
+            parentPaths.add(path);
+        }
+    }
+    for (const path of parentPaths) {
+        if (!parentSummary.isFieldCovered(path)) {
+            throw new types_1.MindooQueryError(`Include "${label}" reads parent field "${path}", which is not covered by the summary configuration ` +
+                "of the parent database (check include/exclude in SummaryConfig).");
+        }
+    }
+}
+function includeSortKeys(include) {
+    return include.sortBy ?? [];
+}
+/**
+ * Hydrates one level of include slots onto already-paged parent rows.
+ *
+ * Per slot: bring the target summary up to date, scan it once, keep the
+ * children whose join value hits one of the parents' keys, group them,
+ * and attach. Nested slots recurse on the attached rows, which are by
+ * then themselves a set of paged parents.
+ *
+ * @returns the merged coverage of every summary this level touched.
+ */
+async function hydrateQueryIncludes(params) {
+    const { parentDb, parentSummary, includes, parents, depth, options, slotPath = "" } = params;
+    let coverage = "full";
+    for (const [slot, include] of Object.entries(includes)) {
+        const label = slotPath ? `${slotPath}.${slot}` : slot;
+        const plan = planInclude(label, include);
+        const childDb = include.db ?? parentDb;
+        const childSummary = resolveIncludeSummary(childDb, label);
+        checkIncludeCoverage(label, plan, include, childSummary, parentSummary);
+        // Empty parent page: no keys to look up, but the slot must still exist
+        // on every (zero) row — and nested levels have nothing to do either.
+        if (parents.length === 0) {
+            continue;
+        }
+        await childSummary.update(options);
+        assertNotAborted(options, label);
+        coverage = (0, queryInternals_1.mergeCoverage)(coverage, childSummary.getCoverage());
+        // Unique join keys of the current page. A Map keyed by the raw value
+        // matches the strict equality semantics of v.eq (1 and "1" differ).
+        const parentsByKey = new Map();
+        for (const parent of parents) {
+            for (const key of joinValuesOf(readParentJoinValue(parent, plan.parent))) {
+                const bucket = parentsByKey.get(key);
+                if (bucket) {
+                    bucket.push(parent);
+                }
+                else {
+                    parentsByKey.set(key, [parent]);
+                }
+            }
+        }
+        const childrenByKey = new Map();
+        if (parentsByKey.size > 0) {
+            const origin = (0, queryInternals_1.queryOrigin)(childDb);
+            const sortKeys = includeSortKeys(include);
+            for (const entry of childSummary.getAllEntries()) {
+                const evaluationDoc = (0, extractSummaryFields_1.buildSummaryEvaluationDoc)(entry.fields, entry.lastModified);
+                const matchedKeys = joinValuesOf(readChildJoinValue(entry.docId, evaluationDoc, plan.child)).filter((key) => parentsByKey.has(key));
+                if (matchedKeys.length === 0) {
+                    continue;
+                }
+                const context = {
+                    doc: evaluationDoc,
+                    values: {},
+                    origin,
+                    docId: entry.docId,
+                    lastModifiedAt: new Date(entry.lastModified).toISOString(),
+                    decryptionKeyId: entry.decryptionKeyId,
+                    variables: {},
+                };
+                if (plan.residualFilter && !(0, expressions_1.expressionToBoolean)((0, expressions_1.evaluateExpression)(plan.residualFilter, context))) {
+                    continue;
+                }
+                const candidate = {
+                    docId: entry.docId,
+                    fields: (0, queryInternals_1.projectFields)(evaluationDoc, include.fields),
+                    lastModified: entry.lastModified,
+                    sortValues: (0, queryInternals_1.computeSortValues)(sortKeys, context),
+                    evaluationDoc,
+                    keys: matchedKeys,
+                };
+                for (const key of matchedKeys) {
+                    const bucket = childrenByKey.get(key);
+                    if (bucket) {
+                        bucket.push(candidate);
+                    }
+                    else {
+                        childrenByKey.set(key, [candidate]);
+                    }
+                }
+            }
+        }
+        const childParents = attachIncludeSlot(slot, label, include, plan, parents, childrenByKey);
+        if (include.include && childParents.length > 0) {
+            const nestedCoverage = await hydrateQueryIncludes({
+                parentDb: childDb,
+                parentSummary: childSummary,
+                includes: include.include,
+                parents: childParents,
+                depth: depth + 1,
+                options,
+                slotPath: label,
+            });
+            coverage = (0, queryInternals_1.mergeCoverage)(coverage, nestedCoverage);
+        }
+    }
+    return coverage;
+}
+/**
+ * Writes the grouped children into `row.includes[slot]` and returns the
+ * attached rows as parent bindings for the next nesting level.
+ *
+ * Every attachment gets its OWN row object even when two parents matched
+ * the same document: nested hydration writes into these rows, and sharing
+ * one object would make a nested slot of one parent visible on another.
+ */
+function attachIncludeSlot(slot, label, include, plan, parents, childrenByKey) {
+    var _a;
+    const sortKeys = includeSortKeys(include);
+    const limit = include.limit ?? types_1.DEFAULT_INCLUDE_LIMIT;
+    const nextParents = [];
+    for (const parent of parents) {
+        const seen = new Set();
+        const matches = [];
+        for (const key of joinValuesOf(readParentJoinValue(parent, plan.parent))) {
+            for (const candidate of childrenByKey.get(key) ?? []) {
+                // A parent whose join value is an array can reach the same child
+                // through two entries; it is still one related document.
+                if (seen.has(candidate.docId)) {
+                    continue;
+                }
+                seen.add(candidate.docId);
+                matches.push(candidate);
+            }
+        }
+        const slots = ((_a = parent.row).includes ?? (_a.includes = {}));
+        if (include.cardinality === "one") {
+            if (matches.length > 1) {
+                const sample = matches.slice(0, 3).map((match) => match.docId).join(", ");
+                throw new types_1.MindooQueryError(`Include "${label}" has cardinality "one", but document "${parent.docId}" matched ` +
+                    `${matches.length} related documents (${sample}${matches.length > 3 ? ", …" : ""}). ` +
+                    'Use cardinality "many" if several matches are expected.');
+            }
+            if (matches.length === 0) {
+                slots[slot] = null;
+                continue;
+            }
+            const row = toIncludedRow(matches[0]);
+            slots[slot] = row;
+            nextParents.push({ row, docId: matches[0].docId, doc: matches[0].evaluationDoc });
+            continue;
+        }
+        matches.sort((left, right) => (0, queryInternals_1.compareCandidates)(left, right, sortKeys));
+        const rows = [];
+        for (const candidate of matches.slice(0, limit)) {
+            const row = toIncludedRow(candidate);
+            rows.push(row);
+            nextParents.push({ row, docId: candidate.docId, doc: candidate.evaluationDoc });
+        }
+        slots[slot] = rows;
+    }
+    return nextParents;
+}
+/** Strips the scan-internal bookkeeping off a candidate. */
+function toIncludedRow(candidate) {
+    return {
+        docId: candidate.docId,
+        fields: candidate.fields,
+        lastModified: candidate.lastModified,
+    };
+}
+//# sourceMappingURL=executeQueryInclude.js.map

package/dist/core/query/executeQueryInclude.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"executeQueryInclude.js","sourceRoot":"","sources":["../../../src/core/query/executeQueryInclude.ts"],"names":[],"mappings":";;AA0HA,wCAmDC;AA+DD,sDAyEC;AAiJD,oDA2GC;AA/iBD,gDASwB;AAExB,mFAA2G;AAC3G,mCASiB;AACjB,qDAO0B;AAqD1B,+DAA+D;AAC/D,SAAS,gBAAgB,CAAC,UAAiC;IACzD,IAAI,UAAU,CAAC,IAAI,KAAK,WAAW,IAAI,UAAU,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QAC/D,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,CAAC,UAAU,CAAC,CAAC;AACtB,CAAC;AAED,SAAS,gBAAgB,CAAC,SAAkC;IAC1D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,SAAS,CAAC,CAAC,CAAiC,CAAC;IACtD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAkC,CAAC;AAC3F,CAAC;AAED,SAAS,gBAAgB,CAAC,UAAiC;IACzD,OAAO,IAAA,2CAA6B,EAAC,UAAU,CAAC,CAAC,kBAAkB,CAAC;AACtE,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,cAAc,CAAC,MAAoC;IACjE,MAAM,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnF,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE/E,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO;YACL,EAAE,EAAE,KAAK;YACT,MAAM,EACJ,oEAAoE;gBACpE,mEAAmE;SACtE,CAAC;IACJ,CAAC;IACD,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,OAAO;YACL,EAAE,EAAE,KAAK;YACT,MAAM,EACJ,wCAAwC,eAAe,CAAC,MAAM,wBAAwB;gBACtF,yDAAyD;SAC5D,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAE,CAAC;IACjC,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5E,OAAO;YACL,EAAE,EAAE,KAAK;YACT,MAAM,EACJ,4DAA4D,IAAA,6CAA+B,EAAC,IAAI,CAAC,IAAI;gBACrG,8FAA8F;SACjG,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,IAAsD,CAAC;IAClF,MAAM,IAAI,GACR,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC;QACtB,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC;QACtB,IAAI,CAAC;IACP,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO;YACL,EAAE,EAAE,KAAK;YACT,MAAM,EACJ,8BAA8B,IAAA,6CAA+B,EAAC,IAAI,CAAC,IAAI;gBACvE,uEAAuE;gBACvE,yDAAyD;SAC5D,CAAC;IACJ,CAAC;IAED,OAAO;QACL,EAAE,EAAE,IAAI;QACR,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,cAAc,EAAE,gBAAgB,CAAC,UAAU,CAAC,EAAE;KAChE,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAS,aAAa,CAAC,UAAiC;IACtD,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAChC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC;IAClD,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,WAAW,IAAI,UAAU,CAAC,EAAE,KAAK,OAAO,EAAE,CAAC;QACjE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,iEAAiE;AACjE,SAAS,cAAc,CAAC,UAAiC;IACvD,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACjC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC;IAClD,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,WAAW,IAAI,UAAU,CAAC,EAAE,KAAK,aAAa,EAAE,CAAC;QACvE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6EAA6E;AAC7E,SAAS,SAAS,CAChB,cAAqC,EACrC,eAAsC;IAEtC,MAAM,KAAK,GAAG,aAAa,CAAC,cAAc,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,cAAc,CAAC,eAAe,CAAC,CAAC;IAC/C,OAAO,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACpD,CAAC;AAED,sEAAsE;AACtE,SAAS,WAAW,CAAC,IAAY,EAAE,OAAiC;IAClE,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACnC,uEAAuE;QACvE,oEAAoE;QACpE,IAAI,OAAO,CAAC,MAAM,IAAI,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,wBAAgB,CACxB,YAAY,IAAI,8EAA8E;gBAC9F,2DAA2D,CAC5D,CAAC;QACJ,CAAC;QACD,OAAO;YACL,KAAK,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;YACxB,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,QAAQ,EAAE;YACjD,cAAc,EAAE,OAAO,CAAC,MAAM,IAAI,IAAI;SACvC,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,CAAC,MAAO,CAAC,CAAC;IACnD,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,wBAAgB,CAAC,YAAY,IAAI,8BAA8B,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,UAAU,CAAC,IAAI,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,SAAgB,qBAAqB,CACnC,QAAkD,EAClD,KAAK,GAAG,CAAC,EACT,QAAQ,GAAG,EAAE;IAEb,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAEtD,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACvB,MAAM,IAAI,wBAAgB,CAAC,uCAAuC,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,KAAK,GAAG,yBAAiB,EAAE,CAAC;YAC9B,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,WAAW,KAAK,0CAA0C,yBAAiB,GAAG,CAChG,CAAC;QACJ,CAAC;QACD,IAAI,OAAO,CAAC,WAAW,KAAK,KAAK,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM,EAAE,CAAC;YACpE,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,qDAAqD;gBACtE,QAAQ,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAChD,CAAC;QACJ,CAAC;QACD,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACnE,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,uEAAuE,CACzF,CAAC;QACJ,CAAC;QACD,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACrE,MAAM,IAAI,wBAAgB,CAAC,YAAY,KAAK,0BAA0B,CAAC,CAAC;QAC1E,CAAC;QACD,IAAI,OAAO,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBACjC,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,wFAAwF,CAC1G,CAAC;YACJ,CAAC;YACD,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAChC,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,uFAAuF,CACzG,CAAC;YACJ,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;YAC1F,MAAM,IAAI,wBAAgB,CAAC,YAAY,KAAK,2BAA2B,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;QAC5F,CAAC;QACD,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,eAAe,EAAE,CAAC;YAC9C,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,wFAAwF,CAC1G,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,OAAO,CAAC,OAAO,KAAK,WAAW,EAAE,CAAC;gBACpC,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,0EAA0E,CAC5F,CAAC;YACJ,CAAC;YACD,IAAI,OAAO,CAAC,UAAU,IAAI,gBAAgB,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC/D,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,4DAA4D;oBAC7E,gDAAgD,CACjD,CAAC;YACJ,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,qBAAqB,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAa,EAAE,MAAoC;IAChF,MAAM,OAAO,GAAG,IAAA,uCAAyB,EAAC,MAAM,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QACrB,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,6BAA6B,OAAO,mDAAmD;YACxG,0FAA0F,CAC3F,CAAC;IACJ,CAAC;IACD,MAAM,YAAY,GAAG,IAAA,2CAA6B,EAAC,MAAM,CAAC,CAAC;IAC3D,IAAI,YAAY,CAAC,gBAAgB,EAAE,CAAC;QAClC,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,4CAA4C;YAC7D,IAAI,YAAY,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,oDAAoD,CACtG,CAAC;IACJ,CAAC;IACD,IAAI,YAAY,CAAC,eAAe,EAAE,CAAC;QACjC,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,yDAAyD;YAC1E,0CAA0C,CAC3C,CAAC;IACJ,CAAC;AACH,CAAC;AAED,wEAAwE;AACxE,SAAS,mBAAmB,CAAC,MAA4B,EAAE,IAAiB;IAC1E,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAA,2CAAoB,EAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5F,CAAC;AAED,4EAA4E;AAC5E,SAAS,kBAAkB,CACzB,KAAa,EACb,aAAsC,EACtC,IAAiB;IAEjB,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAA,2CAAoB,EAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AACxF,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,KAAc;IAClC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAC1C,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC;AAED,SAAS,gBAAgB,CAAC,OAAuC,EAAE,IAAY;IAC7E,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;QAC7B,MAAM,IAAI,wBAAgB,CAAC,0CAA0C,IAAI,IAAI,CAAC,CAAC;IACjF,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,EAAY,EAAE,KAAa;IACxD,IAAI,CAAC,EAAE,CAAC,eAAe,EAAE,CAAC;QACxB,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,wFAAwF,CAC1G,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,CAAC,eAAe,EAAE,CAAC;AAC9B,CAAC;AAED,gFAAgF;AAChF,SAAS,oBAAoB,CAC3B,KAAa,EACb,IAAiB,EACjB,OAAiC,EACjC,YAAkC,EAClC,aAAmC;IAEnC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAChC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,IAAA,iCAAmB,EAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;YAC5D,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;QAC3C,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB,KAAK,MAAM,IAAI,IAAI,IAAA,iCAAmB,EAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC3D,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACzB,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,uBAAuB,IAAI,uDAAuD;gBACnG,uEAAuE,CACxE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,+CAA+C;IAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACjC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,IAAA,uCAAyB,EAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7D,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,yBAAyB,IAAI,uDAAuD;gBACrG,kEAAkE,CACnE,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAQD,SAAS,eAAe,CAAC,OAAiC;IACxD,OAAO,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;;;GASG;AACI,KAAK,UAAU,oBAAoB,CAAC,MAQ1C;IACC,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,GAAG,EAAE,EAAE,GAAG,MAAM,CAAC;IAC7F,IAAI,QAAQ,GAAwB,MAAM,CAAC;IAE3C,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACtD,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAEzC,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,IAAI,QAAQ,CAAC;QACvC,MAAM,YAAY,GAAG,qBAAqB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC3D,oBAAoB,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;QAExE,uEAAuE;QACvE,qEAAqE;QACrE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,SAAS;QACX,CAAC;QAED,MAAM,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACnC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACjC,QAAQ,GAAG,IAAA,8BAAa,EAAC,QAAQ,EAAE,YAAY,CAAC,WAAW,EAAE,CAAC,CAAC;QAE/D,qEAAqE;QACrE,oEAAoE;QACpE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAmC,CAAC;QAChE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,mBAAmB,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBACzE,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrC,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBACN,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,IAAI,GAAG,EAA6B,CAAC;QAC3D,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,IAAA,4BAAW,EAAC,OAAO,CAAC,CAAC;YACpC,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;YAE1C,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,aAAa,EAAE,EAAE,CAAC;gBACjD,MAAM,aAAa,GAAG,IAAA,gDAAyB,EAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;gBAClF,MAAM,WAAW,GAAG,YAAY,CAC9B,kBAAkB,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,CAC3D,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC7B,SAAS;gBACX,CAAC;gBAED,MAAM,OAAO,GAAgC;oBAC3C,GAAG,EAAE,aAAa;oBAClB,MAAM,EAAE,EAAE;oBACV,MAAM;oBACN,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,cAAc,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,WAAW,EAAE;oBAC1D,eAAe,EAAE,KAAK,CAAC,eAAe;oBACtC,SAAS,EAAE,EAAE;iBACd,CAAC;gBACF,IAAI,IAAI,CAAC,cAAc,IAAI,CAAC,IAAA,iCAAmB,EAAC,IAAA,gCAAkB,EAAC,IAAI,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;oBAClG,SAAS;gBACX,CAAC;gBAED,MAAM,SAAS,GAAmB;oBAChC,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,MAAM,EAAE,IAAA,8BAAa,EAAC,aAAa,EAAE,OAAO,CAAC,MAAM,CAAC;oBACpD,YAAY,EAAE,KAAK,CAAC,YAAY;oBAChC,UAAU,EAAE,IAAA,kCAAiB,EAAC,QAAQ,EAAE,OAAO,CAAC;oBAChD,aAAa;oBACb,IAAI,EAAE,WAAW;iBAClB,CAAC;gBACF,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;oBAC9B,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACtC,IAAI,MAAM,EAAE,CAAC;wBACX,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACzB,CAAC;yBAAM,CAAC;wBACN,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;oBACtC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;QAE3F,IAAI,OAAO,CAAC,OAAO,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/C,MAAM,cAAc,GAAG,MAAM,oBAAoB,CAAC;gBAChD,QAAQ,EAAE,OAAO;gBACjB,aAAa,EAAE,YAAY;gBAC3B,QAAQ,EAAE,OAAO,CAAC,OAAO;gBACzB,OAAO,EAAE,YAAY;gBACrB,KAAK,EAAE,KAAK,GAAG,CAAC;gBAChB,OAAO;gBACP,QAAQ,EAAE,KAAK;aAChB,CAAC,CAAC;YACH,QAAQ,GAAG,IAAA,8BAAa,EAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,iBAAiB,CACxB,IAAY,EACZ,KAAa,EACb,OAAiC,EACjC,IAAiB,EACjB,OAA+B,EAC/B,aAA6C;;IAE7C,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,6BAAqB,CAAC;IACrD,MAAM,WAAW,GAA2B,EAAE,CAAC;IAE/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,mBAAmB,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YACzE,KAAK,MAAM,SAAS,IAAI,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;gBACrD,iEAAiE;gBACjE,yDAAyD;gBACzD,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC9B,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBAC1B,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,OAAC,MAAM,CAAC,GAAG,EAAC,QAAQ,QAAR,QAAQ,GAAK,EAAE,EAAC,CAAC;QAE3C,IAAI,OAAO,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC1E,MAAM,IAAI,wBAAgB,CACxB,YAAY,KAAK,0CAA0C,MAAM,CAAC,KAAK,YAAY;oBACnF,GAAG,OAAO,CAAC,MAAM,uBAAuB,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK;oBACrF,yDAAyD,CAC1D,CAAC;YACJ,CAAC;YACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;YAClB,WAAW,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAE,CAAC,aAAa,EAAE,CAAC,CAAC;YACpF,SAAS;QACX,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAA,kCAAiB,EAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;QACxE,MAAM,IAAI,GAAqB,EAAE,CAAC;QAClC,KAAK,MAAM,SAAS,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,GAAG,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,WAAW,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,aAAa,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,4DAA4D;AAC5D,SAAS,aAAa,CAAC,SAAyB;IAC9C,OAAO;QACL,KAAK,EAAE,SAAS,CAAC,KAAK;QACtB,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,YAAY,EAAE,SAAS,CAAC,YAAY;KACrC,CAAC;AACJ,CAAC"}

package/dist/core/query/index.d.ts

@@ -1,5 +1,6 @@
-export { MindooQueryError, type MindooQuery, type MindooQuerySortKey, type MindooQueryTextClause, type MindooQueryErrorCode, type MindooQueryOptions, type MindooQueryRow, type MindooQueryCoverage, type MindooQueryResult, } from "./types";
+export { MindooQueryError, DEFAULT_INCLUDE_LIMIT, MAX_INCLUDE_DEPTH, type MindooQuery, type MindooQueryInclude, type MindooQueryIncludeCardinality, type MindooQueryIncludeSlots, type MindooQuerySortKey, type MindooQueryTextClause, type MindooQueryErrorCode, type MindooQueryOptions, type MindooQueryRow, type MindooQueryCoverage, type MindooQueryResult, } from "./types";
 export { executeQuery } from "./executeQuery";
+export { extractJoinKey, type JoinKeyExtraction, type JoinKeyPlan, type JoinKeySide, } from "./executeQueryInclude";
 export { EphemeralSummaryView, createEphemeralSummaryView, queryViewAcross, type EphemeralViewSource, type MindooQueryViewDefinition, } from "./queryView";
 export { executeQueryLive, type MindooQuerySubscription, } from "./queryLive";
 //# sourceMappingURL=index.d.ts.map

package/dist/core/query/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/query/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gBAAgB,EAChB,KAAK,WAAW,EAChB,KAAK,kBAAkB,EACvB,KAAK,qBAAqB,EAC1B,KAAK,oBAAoB,EACzB,KAAK,kBAAkB,EACvB,KAAK,cAAc,EACnB,KAAK,mBAAmB,EACxB,KAAK,iBAAiB,GACvB,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EACL,oBAAoB,EACpB,0BAA0B,EAC1B,eAAe,EACf,KAAK,mBAAmB,EACxB,KAAK,yBAAyB,GAC/B,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,gBAAgB,EAChB,KAAK,uBAAuB,GAC7B,MAAM,aAAa,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/query/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gBAAgB,EAChB,qBAAqB,EACrB,iBAAiB,EACjB,KAAK,WAAW,EAChB,KAAK,kBAAkB,EACvB,KAAK,6BAA6B,EAClC,KAAK,uBAAuB,EAC5B,KAAK,kBAAkB,EACvB,KAAK,qBAAqB,EAC1B,KAAK,oBAAoB,EACzB,KAAK,kBAAkB,EACvB,KAAK,cAAc,EACnB,KAAK,mBAAmB,EACxB,KAAK,iBAAiB,GACvB,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EACL,cAAc,EACd,KAAK,iBAAiB,EACtB,KAAK,WAAW,EAChB,KAAK,WAAW,GACjB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,oBAAoB,EACpB,0BAA0B,EAC1B,eAAe,EACf,KAAK,mBAAmB,EACxB,KAAK,yBAAyB,GAC/B,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,gBAAgB,EAChB,KAAK,uBAAuB,GAC7B,MAAM,aAAa,CAAC"}

package/dist/core/query/index.js

@@ -1,10 +1,14 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.executeQueryLive = exports.queryViewAcross = exports.createEphemeralSummaryView = exports.EphemeralSummaryView = exports.executeQuery = exports.MindooQueryError = void 0;
+exports.executeQueryLive = exports.queryViewAcross = exports.createEphemeralSummaryView = exports.EphemeralSummaryView = exports.extractJoinKey = exports.executeQuery = exports.MAX_INCLUDE_DEPTH = exports.DEFAULT_INCLUDE_LIMIT = exports.MindooQueryError = void 0;
 var types_1 = require("./types");
 Object.defineProperty(exports, "MindooQueryError", { enumerable: true, get: function () { return types_1.MindooQueryError; } });
+Object.defineProperty(exports, "DEFAULT_INCLUDE_LIMIT", { enumerable: true, get: function () { return types_1.DEFAULT_INCLUDE_LIMIT; } });
+Object.defineProperty(exports, "MAX_INCLUDE_DEPTH", { enumerable: true, get: function () { return types_1.MAX_INCLUDE_DEPTH; } });
 var executeQuery_1 = require("./executeQuery");
 Object.defineProperty(exports, "executeQuery", { enumerable: true, get: function () { return executeQuery_1.executeQuery; } });
+var executeQueryInclude_1 = require("./executeQueryInclude");
+Object.defineProperty(exports, "extractJoinKey", { enumerable: true, get: function () { return executeQueryInclude_1.extractJoinKey; } });
 var queryView_1 = require("./queryView");
 Object.defineProperty(exports, "EphemeralSummaryView", { enumerable: true, get: function () { return queryView_1.EphemeralSummaryView; } });
 Object.defineProperty(exports, "createEphemeralSummaryView", { enumerable: true, get: function () { return queryView_1.createEphemeralSummaryView; } });

package/dist/core/query/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/query/index.ts"],"names":[],"mappings":";;;AAAA,iCAUiB;AATf,yGAAA,gBAAgB,OAAA;AAUlB,+CAA8C;AAArC,4GAAA,YAAY,OAAA;AACrB,yCAMqB;AALnB,iHAAA,oBAAoB,OAAA;AACpB,uHAAA,0BAA0B,OAAA;AAC1B,4GAAA,eAAe,OAAA;AAIjB,yCAGqB;AAFnB,6GAAA,gBAAgB,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/query/index.ts"],"names":[],"mappings":";;;AAAA,iCAeiB;AAdf,yGAAA,gBAAgB,OAAA;AAChB,8GAAA,qBAAqB,OAAA;AACrB,0GAAA,iBAAiB,OAAA;AAanB,+CAA8C;AAArC,4GAAA,YAAY,OAAA;AACrB,6DAK+B;AAJ7B,qHAAA,cAAc,OAAA;AAKhB,yCAMqB;AALnB,iHAAA,oBAAoB,OAAA;AACpB,uHAAA,0BAA0B,OAAA;AAC1B,4GAAA,eAAe,OAAA;AAIjB,yCAGqB;AAFnB,6GAAA,gBAAgB,OAAA"}

package/dist/core/query/queryInternals.d.ts

@@ -0,0 +1,45 @@
+import type { MindooDB } from "../types";
+import { type ExpressionEvaluationContext } from "../expressions";
+import type { MindooQueryCoverage, MindooQueryRow, MindooQuerySortKey, ParsedMindooQuery } from "./types";
+/**
+ * Pieces shared by the root query scan ({@link executeQuery}) and the
+ * nested include hydration ({@link hydrateQueryIncludes}).
+ *
+ * They live here rather than in `executeQuery.ts` so both paths sort and
+ * project through the SAME code: an included row must be built exactly
+ * like a root row, otherwise projection or ordering semantics drift apart
+ * between the two levels of the same result.
+ */
+/** A row plus its scan-internal bookkeeping, used while a scan is in progress. */
+export type CandidateRow = MindooQueryRow & {
+    sortValues: unknown[];
+    /**
+     * The document's UNPROJECTED values in evaluation form. Kept alongside
+     * the (possibly projected) `fields` because include hydration reads
+     * join keys from it — projecting the result must not break the join.
+     */
+    evaluationDoc: Record<string, unknown>;
+};
+/**
+ * Effective sort keys of a query: an explicit `sortBy` wins; a `text`
+ * clause without one defaults to relevance ranking (best score first).
+ */
+export declare function effectiveSortKeys(query: ParsedMindooQuery): MindooQuerySortKey[];
+export declare function sortDirectionDescending(sortKey: MindooQuerySortKey): boolean;
+export declare function computeSortValues(sortKeys: MindooQuerySortKey[], context: ExpressionEvaluationContext, textScore?: number): unknown[];
+/**
+ * Orders two candidates by their precomputed sort values, falling back to
+ * the document id so equal keys still produce a stable, reproducible
+ * order.
+ */
+export declare function compareCandidates(left: CandidateRow, right: CandidateRow, sortKeys: MindooQuerySortKey[]): number;
+export declare function projectFields(fields: Record<string, unknown>, projection?: string[]): Record<string, unknown>;
+export declare function queryOrigin(db: MindooDB): string;
+/**
+ * Merges the coverage of several data sources into the one reported for
+ * the result. Anything less than complete wins: a query joining a current
+ * summary with one that is still backfilling may be missing rows, and
+ * saying `"full"` there would be the most misleading answer available.
+ */
+export declare function mergeCoverage(current: MindooQueryCoverage, next: MindooQueryCoverage): MindooQueryCoverage;
+//# sourceMappingURL=queryInternals.d.ts.map

package/dist/core/query/queryInternals.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queryInternals.d.ts","sourceRoot":"","sources":["../../../src/core/query/queryInternals.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAsB,KAAK,2BAA2B,EAAE,MAAM,gBAAgB,CAAC;AAGtF,OAAO,KAAK,EAAE,mBAAmB,EAAE,cAAc,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAE1G;;;;;;;;GAQG;AAEH,kFAAkF;AAClF,MAAM,MAAM,YAAY,GAAG,cAAc,GAAG;IAC1C,UAAU,EAAE,OAAO,EAAE,CAAC;IACtB;;;;OAIG;IACH,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACxC,CAAC;AAEF;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,iBAAiB,GAAG,kBAAkB,EAAE,CAQhF;AAED,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,kBAAkB,GAAG,OAAO,CAE5E;AAED,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,kBAAkB,EAAE,EAC9B,OAAO,EAAE,2BAA2B,EACpC,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,EAAE,CAYX;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,YAAY,EAClB,KAAK,EAAE,YAAY,EACnB,QAAQ,EAAE,kBAAkB,EAAE,GAC7B,MAAM,CAQR;AAED,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/B,UAAU,CAAC,EAAE,MAAM,EAAE,GACpB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAYzB;AAED,wBAAgB,WAAW,CAAC,EAAE,EAAE,QAAQ,GAAG,MAAM,CAEhD;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,mBAAmB,EAC5B,IAAI,EAAE,mBAAmB,GACxB,mBAAmB,CAQrB"}

package/dist/core/query/queryInternals.js

@@ -0,0 +1,87 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.effectiveSortKeys = effectiveSortKeys;
+exports.sortDirectionDescending = sortDirectionDescending;
+exports.computeSortValues = computeSortValues;
+exports.compareCandidates = compareCandidates;
+exports.projectFields = projectFields;
+exports.queryOrigin = queryOrigin;
+exports.mergeCoverage = mergeCoverage;
+const expressions_1 = require("../expressions");
+const extractSummaryFields_1 = require("../indexing/summary/extractSummaryFields");
+const types_1 = require("../indexing/virtualviews/types");
+/**
+ * Effective sort keys of a query: an explicit `sortBy` wins; a `text`
+ * clause without one defaults to relevance ranking (best score first).
+ */
+function effectiveSortKeys(query) {
+    if (query.sortBy && query.sortBy.length > 0) {
+        return query.sortBy;
+    }
+    if (query.text) {
+        return [{ special: "textScore", direction: "descending" }];
+    }
+    return [];
+}
+function sortDirectionDescending(sortKey) {
+    return sortKey.direction === "descending";
+}
+function computeSortValues(sortKeys, context, textScore) {
+    return sortKeys.map((sortKey) => {
+        if (sortKey.special === "textScore") {
+            return textScore ?? 0;
+        }
+        if (sortKey.expression) {
+            return (0, expressions_1.evaluateExpression)(sortKey.expression, context);
+        }
+        // Plain field sort keys resolve against the evaluation doc, which also
+        // carries the mirrored managed fields (`_lastModified`, `_attachments`).
+        return (0, extractSummaryFields_1.getSummaryFieldValue)(context.doc, sortKey.field ?? "");
+    });
+}
+/**
+ * Orders two candidates by their precomputed sort values, falling back to
+ * the document id so equal keys still produce a stable, reproducible
+ * order.
+ */
+function compareCandidates(left, right, sortKeys) {
+    for (let i = 0; i < sortKeys.length; i++) {
+        const result = (0, types_1.compareValues)(left.sortValues[i], right.sortValues[i], sortDirectionDescending(sortKeys[i]));
+        if (result !== 0) {
+            return result;
+        }
+    }
+    return left.docId.localeCompare(right.docId);
+}
+function projectFields(fields, projection) {
+    if (!projection) {
+        return fields;
+    }
+    const projected = {};
+    for (const path of projection) {
+        const value = (0, extractSummaryFields_1.getSummaryFieldValue)(fields, path);
+        if (value !== undefined) {
+            projected[path] = value;
+        }
+    }
+    return projected;
+}
+function queryOrigin(db) {
+    return `${db.getTenant().getId()}/${db.getStore().getId()}`;
+}
+/**
+ * Merges the coverage of several data sources into the one reported for
+ * the result. Anything less than complete wins: a query joining a current
+ * summary with one that is still backfilling may be missing rows, and
+ * saying `"full"` there would be the most misleading answer available.
+ */
+function mergeCoverage(current, next) {
+    if (current === "rebuilding" || next === "rebuilding") {
+        return "rebuilding";
+    }
+    if (current === "full-scan" || next === "full-scan") {
+        return "full-scan";
+    }
+    return "full";
+}
+//# sourceMappingURL=queryInternals.js.map