pyric 0.0.1 → 0.1.0-alpha.11

package/dist/rules/indexes/extract/classify.js

@@ -0,0 +1,138 @@
+/**
+ * `classifyQueryCall` — given a `query(...)` call expression, decide whether
+ * it's an INIT (`query(collection(db, "X"), ...)`) or a WRAP
+ * (`query(q, ...constraints)`), and produce the fragments contributed by
+ * the call's constraint arguments.
+ *
+ * One call may produce multiple fragments — `query(q, where(...), orderBy(...))`
+ * yields a `where` and an `orderBy` fragment. Callers wrap each fragment
+ * with branch context (branchId/clauseId/skippable) before storing.
+ */
+import ts from 'typescript';
+import { getCalleeName, strLit } from './ast.js';
+/**
+ * Resolve a `collection(db, "a", id?, "b"?, ...)` or
+ * `collectionGroup(db, "name")` call into its (possibly composite) path.
+ *
+ * For modular `collection(db, ...segments)`:
+ *   - 2-arg form returns the literal path (or null).
+ *   - 3+ arg form stitches literal segments and replaces dynamic ones with
+ *     `{*}`. The result still pins the **last segment** as the collection
+ *     group, which is the only piece an index spec needs.
+ *
+ * Returns `null` when the first segment isn't a literal — in that case
+ * we have no statically resolvable path at all.
+ */
+function resolveCollectionPath(call) {
+    // First arg is `db`; segments start at index 1.
+    if (call.arguments.length < 2)
+        return null;
+    const segs = [];
+    for (let i = 1; i < call.arguments.length; i++) {
+        const lit = strLit(call.arguments[i]);
+        if (lit !== null)
+            segs.push(lit);
+        else
+            segs.push('{*}');
+    }
+    // If the very first segment is dynamic, we can't say anything useful.
+    if (segs[0] === '{*}')
+        return null;
+    return segs.join('/');
+}
+/**
+ * Process a single constraint call (`where`, `orderBy`, `limit`) and emit
+ * one or more fragments. Splits the dynamic-direction `orderBy(field, dir)`
+ * case into two fragments (asc + desc) so over-shoot is preferred to
+ * silent under-shoot.
+ */
+function classifyConstraint(call) {
+    const cn = getCalleeName(call);
+    const args = call.arguments;
+    if (cn === 'where') {
+        const field = args[0] ? strLit(args[0]) : null;
+        const op = args[1] ? strLit(args[1]) : null;
+        if (field && op)
+            return [{ kind: 'where', filter: { field, op } }];
+        return [{ kind: 'unknown' }];
+    }
+    if (cn === 'orderBy') {
+        const field = args[0] ? strLit(args[0]) : null;
+        if (!field)
+            return [{ kind: 'unknown' }];
+        if (args.length === 1) {
+            // Default direction is asc.
+            return [{ kind: 'orderBy', order: { field, direction: 'asc' } }];
+        }
+        const dirLit = args[1] ? strLit(args[1]) : null;
+        if (dirLit === 'asc' || dirLit === 'desc') {
+            return [{ kind: 'orderBy', order: { field, direction: dirLit } }];
+        }
+        // Dynamic direction — emit both. Better to over-index than under-index;
+        // the agent layer can prune via @firestore-mutex if it knows better.
+        return [
+            { kind: 'orderBy', order: { field, direction: 'asc' } },
+            { kind: 'orderBy', order: { field, direction: 'desc' } },
+        ];
+    }
+    if (cn === 'limit') {
+        const n = args[0];
+        if (n && ts.isNumericLiteral(n)) {
+            return [{ kind: 'limit', limit: Number(n.text) }];
+        }
+        return [{ kind: 'unknown' }];
+    }
+    // Anything else — `startAt`, `endBefore`, custom helpers — count as
+    // unknown for now. The composite-index detector treats unknown as a
+    // pass-through (no constraint contribution).
+    return [{ kind: 'unknown' }];
+}
+/**
+ * Classify a `query(...)` call. Caller is expected to have already
+ * confirmed `getCalleeName(call) === 'query'`.
+ *
+ * `varName` is the local that the chain is being built on (typically `q`).
+ * Used to recognize the WRAP shape `query(q, ...)`.
+ */
+export function classifyQueryCall(call, varName) {
+    const args = call.arguments;
+    if (args.length === 0)
+        return { isInit: false, fragments: [] };
+    const first = args[0];
+    let isInit = false;
+    let collectionPath = undefined;
+    let isCollectionGroup = false;
+    if (ts.isCallExpression(first)) {
+        const cname = getCalleeName(first);
+        if (cname === 'collection' || cname === 'collectionGroup') {
+            isInit = true;
+            isCollectionGroup = cname === 'collectionGroup';
+            if (cname === 'collectionGroup') {
+                // collectionGroup(db, "name")
+                collectionPath = first.arguments[1] ? strLit(first.arguments[1]) : null;
+            }
+            else {
+                collectionPath = resolveCollectionPath(first);
+            }
+        }
+    }
+    else if (ts.isIdentifier(first) && first.text === varName) {
+        // WRAP: query(q, ...constraints)
+        isInit = false;
+    }
+    else {
+        // First arg is something else — different variable, expression, etc.
+        // Treat as unknown, no fragments.
+        return { isInit: false, fragments: [{ kind: 'unknown' }] };
+    }
+    // Process the rest as constraints.
+    const fragments = [];
+    for (let i = 1; i < args.length; i++) {
+        const a = args[i];
+        if (!ts.isCallExpression(a))
+            continue;
+        fragments.push(...classifyConstraint(a));
+    }
+    return { isInit, collectionPath, isCollectionGroup, fragments };
+}
+//# sourceMappingURL=classify.js.map

package/dist/rules/indexes/extract/classify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify.js","sourceRoot":"","sources":["../../../../src/rules/indexes/extract/classify.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5B,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAyBjD;;;;;;;;;;;;GAYG;AACH,SAAS,qBAAqB,CAAC,IAAuB;IACpD,gDAAgD;IAChD,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3C,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,GAAG,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YAC5B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IACD,sEAAsE;IACtE,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,IAAuB;IACjD,MAAM,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;IAE5B,IAAI,EAAE,KAAK,OAAO,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,IAAI,KAAK,IAAI,EAAE;YAAE,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACnE,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QAEzC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,4BAA4B;YAC5B,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACnE,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAChD,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YAC1C,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;QACpE,CAAC;QAED,wEAAwE;QACxE,qEAAqE;QACrE,OAAO;YACL,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE;YACvD,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE;SACzD,CAAC;IACJ,CAAC;IAED,IAAI,EAAE,KAAK,OAAO,EAAE,CAAC;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,oEAAoE;IACpE,oEAAoE;IACpE,6CAA6C;IAC7C,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAuB,EAAE,OAAe;IACxE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;IAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAE/D,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,cAAc,GAA8B,SAAS,CAAC;IAC1D,IAAI,iBAAiB,GAAG,KAAK,CAAC;IAE9B,IAAI,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,YAAY,IAAI,KAAK,KAAK,iBAAiB,EAAE,CAAC;YAC1D,MAAM,GAAG,IAAI,CAAC;YACd,iBAAiB,GAAG,KAAK,KAAK,iBAAiB,CAAC;YAChD,IAAI,KAAK,KAAK,iBAAiB,EAAE,CAAC;gBAChC,8BAA8B;gBAC9B,cAAc,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC1E,CAAC;iBAAM,CAAC;gBACN,cAAc,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC5D,iCAAiC;QACjC,MAAM,GAAG,KAAK,CAAC;IACjB,CAAC;SAAM,CAAC;QACN,qEAAqE;QACrE,kCAAkC;QAClC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,mCAAmC;IACnC,MAAM,SAAS,GAAyB,EAAE,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAAE,SAAS;QACtC,SAAS,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,iBAAiB,EAAE,SAAS,EAAE,CAAC;AAClE,CAAC"}

package/dist/rules/indexes/extract/composite.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Composite-index detection + QueryShape → IndexesConfigEntry mapping.
+ *
+ * Firestore's actual index-required rules are nuanced; this is a
+ * conservative approximation that matches the cases the agent layer
+ * needs to pre-seed:
+ *
+ *   - 0 filters and ≤ 1 orderBy → single-field, no composite needed.
+ *   - 1 equality filter and 0 orderBy → single-field.
+ *   - 1 equality filter + 1 orderBy on the same field → single-field.
+ *   - 2+ equality filters → composite.
+ *   - Equality filter + orderBy on a different field → composite.
+ *   - Range/inequality filter + orderBy on a different field → composite.
+ *   - array-contains is treated like equality for composite purposes.
+ *
+ * Vector indexes are not handled here — they have their own creation
+ * surface that goes through the same deploy handler but with a
+ * `vectorConfig` field on each indexed field.
+ */
+import type { QueryShape } from './types.js';
+import type { IndexesConfigEntry } from '../types.js';
+export declare function needsCompositeIndex(s: QueryShape): boolean;
+/**
+ * Map a QueryShape to a Firestore index-spec entry. The output drops
+ * directly into `firestore.indexes.json`'s `indexes[]`.
+ *
+ * Field ordering rule: equality filters first (Firestore's docs put them
+ * before range/orderBy), then range filters, then orderBy fields. Within
+ * each group we preserve source order so the agent can correlate the
+ * extracted index with the source query.
+ */
+export declare function shapeToIndexEntry(s: QueryShape): IndexesConfigEntry;
+/**
+ * Stable string key for an index entry — used by the orchestrator to
+ * dedupe across multiple shapes that map to the same index.
+ */
+export declare function indexEntryKey(e: IndexesConfigEntry): string;
+//# sourceMappingURL=composite.d.ts.map

package/dist/rules/indexes/extract/composite.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"composite.d.ts","sourceRoot":"","sources":["../../../../src/rules/indexes/extract/composite.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,KAAK,EAAU,UAAU,EAAE,MAAM,YAAY,CAAC;AACrD,OAAO,KAAK,EAAE,kBAAkB,EAAmB,MAAM,aAAa,CAAC;AAQvE,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO,CA0B1D;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,UAAU,GAAG,kBAAkB,CAqCnE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,kBAAkB,GAAG,MAAM,CAG3D"}

package/dist/rules/indexes/extract/composite.js

@@ -0,0 +1,85 @@
+const EQ_LIKE = new Set(['==', 'in', 'array-contains', 'array-contains-any']);
+function isEqualityLike(f) {
+    return EQ_LIKE.has(f.op);
+}
+export function needsCompositeIndex(s) {
+    const eq = s.filters.filter(isEqualityLike);
+    const range = s.filters.filter(f => !isEqualityLike(f));
+    // Trivially no composite — too few constraints.
+    if (s.filters.length === 0 && s.orders.length <= 1)
+        return false;
+    if (s.filters.length === 1 && s.orders.length === 0)
+        return false;
+    // 2+ filters of any kind → composite.
+    if (s.filters.length >= 2)
+        return true;
+    // Equality + orderBy: composite iff orderBy is on a different field.
+    if (eq.length >= 1 && s.orders.length >= 1) {
+        const orderField = s.orders[0].field;
+        if (!eq.some(f => f.field === orderField))
+            return true;
+    }
+    // Range + orderBy on a different field → composite.
+    if (range.length >= 1 && s.orders.length >= 1) {
+        if (range[0].field !== s.orders[0].field)
+            return true;
+    }
+    // 2+ orderBys → composite (Firestore needs an index for each ordering combo).
+    if (s.orders.length >= 2)
+        return true;
+    return false;
+}
+/**
+ * Map a QueryShape to a Firestore index-spec entry. The output drops
+ * directly into `firestore.indexes.json`'s `indexes[]`.
+ *
+ * Field ordering rule: equality filters first (Firestore's docs put them
+ * before range/orderBy), then range filters, then orderBy fields. Within
+ * each group we preserve source order so the agent can correlate the
+ * extracted index with the source query.
+ */
+export function shapeToIndexEntry(s) {
+    const fields = [];
+    // Equality filters → ASCENDING.
+    for (const f of s.filters) {
+        if (isEqualityLike(f)) {
+            fields.push({ fieldPath: f.field, order: 'ASCENDING' });
+        }
+    }
+    // Range filters → ASCENDING.
+    for (const f of s.filters) {
+        if (!isEqualityLike(f)) {
+            fields.push({ fieldPath: f.field, order: 'ASCENDING' });
+        }
+    }
+    // OrderBy fields — direction matters; only include fields not already in.
+    for (const o of s.orders) {
+        const existing = fields.findIndex(x => x.fieldPath === o.field);
+        if (existing >= 0) {
+            // The orderBy direction wins over a default-ascending entry from
+            // the filter loop — Firestore's index requires the orderBy
+            // direction to match.
+            fields[existing] = { fieldPath: o.field, order: o.direction === 'desc' ? 'DESCENDING' : 'ASCENDING' };
+        }
+        else {
+            fields.push({ fieldPath: o.field, order: o.direction === 'desc' ? 'DESCENDING' : 'ASCENDING' });
+        }
+    }
+    // Last segment of the path is the collectionGroup (subcollection
+    // queries pin the group to the leaf segment).
+    const collectionGroup = s.collectionPath.split('/').pop() || s.collectionPath;
+    return {
+        collectionGroup,
+        queryScope: s.isCollectionGroup ? 'COLLECTION_GROUP' : 'COLLECTION',
+        fields,
+    };
+}
+/**
+ * Stable string key for an index entry — used by the orchestrator to
+ * dedupe across multiple shapes that map to the same index.
+ */
+export function indexEntryKey(e) {
+    const fields = e.fields.map(f => `${f.fieldPath}:${f.order ?? 'ASCENDING'}`).join(',');
+    return `${e.queryScope}|${e.collectionGroup}|${fields}`;
+}
+//# sourceMappingURL=composite.js.map

package/dist/rules/indexes/extract/composite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"composite.js","sourceRoot":"","sources":["../../../../src/rules/indexes/extract/composite.ts"],"names":[],"mappings":"AAsBA,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,gBAAgB,EAAE,oBAAoB,CAAC,CAAC,CAAC;AAE9E,SAAS,cAAc,CAAC,CAAS;IAC/B,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,CAAa;IAC/C,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,gDAAgD;IAChD,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACjE,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAElE,sCAAsC;IACtC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,qEAAqE;IACrE,IAAI,EAAE,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACrC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC;YAAE,OAAO,IAAI,CAAC;IACzD,CAAC;IAED,oDAAoD;IACpD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;IACxD,CAAC;IAED,8EAA8E;IAC9E,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAa;IAC7C,MAAM,MAAM,GAAoD,EAAE,CAAC;IAEnE,gCAAgC;IAChC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAC1B,IAAI,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,6BAA6B;IAC7B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,0EAA0E;IAC1E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;QAChE,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,iEAAiE;YACjE,2DAA2D;YAC3D,sBAAsB;YACtB,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACxG,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAClG,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,8CAA8C;IAC9C,MAAM,eAAe,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,cAAc,CAAC;IAE9E,OAAO;QACL,eAAe;QACf,UAAU,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,YAAY;QACnE,MAAM;KACP,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,CAAqB;IACjD,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,KAAK,IAAI,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvF,OAAO,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,eAAe,IAAI,MAAM,EAAE,CAAC;AAC1D,CAAC"}

package/dist/rules/indexes/extract/dataflow.d.ts

@@ -0,0 +1,45 @@
+/**
+ * `scanFunctionBody` — intra-procedural walker that finds every assignment
+ * to a chain variable (typically `q`) inside a function body, classifies
+ * each assignment's RHS via `classifyQueryCall`, and stamps each emitted
+ * fragment with branch context (branchId/clauseId/skippable).
+ *
+ * Branch context lets the enumerator (next module) correctly model
+ * mutually exclusive clauses and skippable optional `if (cond)` blocks.
+ *
+ * Scope:
+ *   - Variable bindings tracked at function scope only.
+ *   - if/else-if/else chains supported. switch / try / nested function
+ *     bodies are walked but their branches are NOT enumerated separately
+ *     (treated as unconditional within the enclosing scope).
+ *   - Optional inter-procedural following (Layer 2.5): callers may pass a
+ *     `CallResolver` to recursively inline a same-file wrapper that takes
+ *     the chain variable as a parameter and returns a modified chain.
+ *     Single-level only, root-context only, identifier-arg only.
+ */
+import ts from 'typescript';
+import type { QueryBaseDecl } from './types.js';
+/**
+ * Result returned by a `CallResolver` when it knows how to inline a call.
+ *
+ * `body` is the wrapper function's body node — the recursion runs
+ * `scanFunctionBody`'s inner walker over it, treating `chainParamName` as
+ * the wrapper's chain variable.
+ */
+export interface ResolvedCall {
+    body: ts.Node;
+    chainParamName: string;
+}
+/**
+ * Optional callback that lets the walker follow chain-var-passing calls
+ * into other functions in the same source file (Layer 2.5).
+ *
+ * Receives the called function's name and the position of the chain
+ * variable in the argument list. Returns the wrapper's body and the
+ * parameter name corresponding to that argument, or `null` if the call
+ * shouldn't be followed (unknown function, wrong arity, parameter not an
+ * identifier, etc.).
+ */
+export type CallResolver = (functionName: string, chainArgIndex: number) => ResolvedCall | null;
+export declare function scanFunctionBody(body: ts.Node, varName: string, callResolver?: CallResolver): QueryBaseDecl;
+//# sourceMappingURL=dataflow.d.ts.map

package/dist/rules/indexes/extract/dataflow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataflow.d.ts","sourceRoot":"","sources":["../../../../src/rules/indexes/extract/dataflow.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,EAAE,MAAM,YAAY,CAAC;AAG5B,OAAO,KAAK,EAAY,aAAa,EAAE,MAAM,YAAY,CAAC;AAE1D;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC;IACd,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;GASG;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,YAAY,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,KAAK,YAAY,GAAG,IAAI,CAAC;AAmDhG,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,EAAE,CAAC,IAAI,EACb,OAAO,EAAE,MAAM,EACf,YAAY,CAAC,EAAE,YAAY,GAC1B,aAAa,CA4Jf"}

package/dist/rules/indexes/extract/dataflow.js

@@ -0,0 +1,200 @@
+/**
+ * `scanFunctionBody` — intra-procedural walker that finds every assignment
+ * to a chain variable (typically `q`) inside a function body, classifies
+ * each assignment's RHS via `classifyQueryCall`, and stamps each emitted
+ * fragment with branch context (branchId/clauseId/skippable).
+ *
+ * Branch context lets the enumerator (next module) correctly model
+ * mutually exclusive clauses and skippable optional `if (cond)` blocks.
+ *
+ * Scope:
+ *   - Variable bindings tracked at function scope only.
+ *   - if/else-if/else chains supported. switch / try / nested function
+ *     bodies are walked but their branches are NOT enumerated separately
+ *     (treated as unconditional within the enclosing scope).
+ *   - Optional inter-procedural following (Layer 2.5): callers may pass a
+ *     `CallResolver` to recursively inline a same-file wrapper that takes
+ *     the chain variable as a parameter and returns a modified chain.
+ *     Single-level only, root-context only, identifier-arg only.
+ */
+import ts from 'typescript';
+import { getCalleeName } from './ast.js';
+import { classifyQueryCall } from './classify.js';
+const ROOT_CTX = { branchId: null, clauseId: null, skippable: false };
+/**
+ * Decide whether an `if`-chain has a final `else` (so one branch always
+ * runs) or not (so all branches are individually skippable).
+ */
+function ifChainHasFinalElse(node) {
+    let cur = node;
+    while (cur) {
+        if (!cur.elseStatement)
+            return false;
+        if (ts.isIfStatement(cur.elseStatement)) {
+            cur = cur.elseStatement;
+        }
+        else {
+            return true; // final else block
+        }
+    }
+    return false;
+}
+/**
+ * Apply branch context to a classified fragment, producing the final
+ * `Fragment` shape with branchId/clauseId/skippable populated.
+ *
+ * INIT contributions are NOT emitted as fragments — they're recorded on
+ * the QueryBaseDecl directly. Only constraint fragments flow through.
+ */
+function attachContext(frag, ctx) {
+    return {
+        kind: frag.kind,
+        filter: frag.filter,
+        order: frag.order,
+        limit: frag.limit,
+        branchId: ctx.branchId,
+        clauseId: ctx.clauseId,
+        skippable: ctx.skippable,
+    };
+}
+export function scanFunctionBody(body, varName, callResolver) {
+    const decl = {
+        varName,
+        collectionPath: null,
+        isCollectionGroup: false,
+        fragments: [],
+    };
+    const scan = { nextBranchId: 1 };
+    /**
+     * Try to inline a non-`query` call that receives the current chain
+     * variable as an argument. Returns true when the call was recognized
+     * (whether or not it actually inlined — a recognized-but-skipped call
+     * still yields a warning and shouldn't be re-tried elsewhere).
+     *
+     * Hard limits per Layer 2.5 design:
+     *   - Single-level only (depth 0 inlines once; depth ≥ 1 short-circuits
+     *     with `inter-proc-recursion` warning).
+     *   - Root context only — calls inside `if`-branches surface
+     *     `inter-proc-nested` and skip inlining.
+     *   - Chain variable must appear as a bare identifier in the args.
+     */
+    function tryInlineCall(call, chainVar, ctx, depth) {
+        if (!callResolver)
+            return false;
+        const fnName = getCalleeName(call);
+        if (!fnName || fnName === 'query')
+            return false;
+        let chainArgIndex = -1;
+        for (let i = 0; i < call.arguments.length; i++) {
+            const a = call.arguments[i];
+            if (ts.isIdentifier(a) && a.text === chainVar) {
+                chainArgIndex = i;
+                break;
+            }
+        }
+        if (chainArgIndex === -1)
+            return false;
+        if (depth >= 1) {
+            pushInterProcWarning('inter-proc-recursion', fnName, `Skipped follow into '${fnName}': single-level inter-procedural only.`);
+            return true;
+        }
+        if (ctx.branchId !== null) {
+            pushInterProcWarning('inter-proc-nested', fnName, `Skipped follow into '${fnName}': call site is inside a branch.`);
+            return true;
+        }
+        const resolved = callResolver(fnName, chainArgIndex);
+        if (!resolved)
+            return false;
+        walkBody(resolved.body, resolved.chainParamName, depth + 1);
+        decl.inlinedFunctions = decl.inlinedFunctions ?? [];
+        if (!decl.inlinedFunctions.includes(fnName))
+            decl.inlinedFunctions.push(fnName);
+        return true;
+    }
+    function pushInterProcWarning(code, functionName, message) {
+        decl.interProcWarnings = decl.interProcWarnings ?? [];
+        decl.interProcWarnings.push({ code, functionName, message });
+    }
+    /**
+     * Walk a function body looking for assignments to `chainVar`. The same
+     * `decl` and `scan.nextBranchId` are shared across recursive calls so
+     * branch IDs across caller + wrapper stay distinct.
+     */
+    function walkBody(targetBody, chainVar, depth) {
+        function processAssignmentRHS(rhs, ctx) {
+            if (!ts.isCallExpression(rhs))
+                return;
+            if (getCalleeName(rhs) === 'query') {
+                const r = classifyQueryCall(rhs, chainVar);
+                if (r.isInit) {
+                    // The first INIT we see wins. Subsequent re-INITs would mean
+                    // the chain restarts — rare in real code, ignored for v1.
+                    if (decl.collectionPath === null) {
+                        decl.collectionPath = r.collectionPath ?? null;
+                        decl.isCollectionGroup = r.isCollectionGroup ?? false;
+                    }
+                }
+                for (const f of r.fragments) {
+                    decl.fragments.push(attachContext(f, ctx));
+                }
+                return;
+            }
+            // Not a `query(...)` call — try the inter-procedural follower.
+            tryInlineCall(rhs, chainVar, ctx, depth);
+        }
+        function visit(node, ctx) {
+            // 1. Variable declaration: `let q = query(...)` or `let q = wrapper(q,...)`
+            if (ts.isVariableStatement(node)) {
+                for (const d of node.declarationList.declarations) {
+                    if (ts.isIdentifier(d.name) && d.name.text === chainVar && d.initializer) {
+                        processAssignmentRHS(d.initializer, ctx);
+                    }
+                }
+            }
+            // 2. Assignment: `q = query(q, ...)` or `q = wrapper(q, ...)`
+            if (ts.isExpressionStatement(node)
+                && ts.isBinaryExpression(node.expression)
+                && node.expression.operatorToken.kind === ts.SyntaxKind.EqualsToken) {
+                const lhs = node.expression.left;
+                if (ts.isIdentifier(lhs) && lhs.text === chainVar) {
+                    processAssignmentRHS(node.expression.right, ctx);
+                }
+            }
+            // 3. if/else chain: open a new branchId, walk each clause separately.
+            if (ts.isIfStatement(node)) {
+                const branchId = scan.nextBranchId++;
+                const skippable = !ifChainHasFinalElse(node);
+                let clauseIdx = 0;
+                let walker = node;
+                while (walker) {
+                    if (ts.isIfStatement(walker)) {
+                        visit(walker.thenStatement, { branchId, clauseId: clauseIdx, skippable });
+                        if (walker.elseStatement && !ts.isIfStatement(walker.elseStatement)) {
+                            // final else
+                            clauseIdx += 1;
+                            visit(walker.elseStatement, { branchId, clauseId: clauseIdx, skippable });
+                            walker = undefined;
+                        }
+                        else if (walker.elseStatement && ts.isIfStatement(walker.elseStatement)) {
+                            clauseIdx += 1;
+                            walker = walker.elseStatement;
+                        }
+                        else {
+                            walker = undefined;
+                        }
+                    }
+                    else {
+                        walker = undefined;
+                    }
+                }
+                return; // handled — don't recurse into the if's children again
+            }
+            // Default: recurse into children with the current ctx.
+            ts.forEachChild(node, (n) => visit(n, ctx));
+        }
+        visit(targetBody, ROOT_CTX);
+    }
+    walkBody(body, varName, 0);
+    return decl;
+}
+//# sourceMappingURL=dataflow.js.map

package/dist/rules/indexes/extract/dataflow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataflow.js","sourceRoot":"","sources":["../../../../src/rules/indexes/extract/dataflow.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5B,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAE,iBAAiB,EAA2B,MAAM,eAAe,CAAC;AAsC3E,MAAM,QAAQ,GAAkB,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAErF;;;GAGG;AACH,SAAS,mBAAmB,CAAC,IAAoB;IAC/C,IAAI,GAAG,GAA+B,IAAI,CAAC;IAC3C,OAAO,GAAG,EAAE,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,aAAa;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;YACxC,GAAG,GAAG,GAAG,CAAC,aAAa,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,CAAC,mBAAmB;QAClC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,IAAwB,EAAE,GAAkB;IACjE,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,SAAS,EAAE,GAAG,CAAC,SAAS;KACzB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,IAAa,EACb,OAAe,EACf,YAA2B;IAE3B,MAAM,IAAI,GAAkB;QAC1B,OAAO;QACP,cAAc,EAAE,IAAI;QACpB,iBAAiB,EAAE,KAAK;QACxB,SAAS,EAAE,EAAE;KACd,CAAC;IACF,MAAM,IAAI,GAAgB,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAE9C;;;;;;;;;;;;OAYG;IACH,SAAS,aAAa,CACpB,IAAuB,EACvB,QAAgB,EAChB,GAAkB,EAClB,KAAa;QAEb,IAAI,CAAC,YAAY;YAAE,OAAO,KAAK,CAAC;QAChC,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,IAAI,MAAM,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC;QAEhD,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC9C,aAAa,GAAG,CAAC,CAAC;gBAClB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,aAAa,KAAK,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAEvC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,oBAAoB,CAAC,sBAAsB,EAAE,MAAM,EAAE,wBAAwB,MAAM,wCAAwC,CAAC,CAAC;YAC7H,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC1B,oBAAoB,CAAC,mBAAmB,EAAE,MAAM,EAAE,wBAAwB,MAAM,kCAAkC,CAAC,CAAC;YACpH,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;QACrD,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QAE5B,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,cAAc,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,IAAI,EAAE,CAAC;QACpD,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChF,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,oBAAoB,CAC3B,IAAkD,EAClD,YAAoB,EACpB,OAAe;QAEf,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,IAAI,EAAE,CAAC;QACtD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED;;;;OAIG;IACH,SAAS,QAAQ,CAAC,UAAmB,EAAE,QAAgB,EAAE,KAAa;QACpE,SAAS,oBAAoB,CAAC,GAAkB,EAAE,GAAkB;YAClE,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC;gBAAE,OAAO;YACtC,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,OAAO,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBAC3C,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;oBACb,6DAA6D;oBAC7D,0DAA0D;oBAC1D,IAAI,IAAI,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;wBACjC,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,IAAI,IAAI,CAAC;wBAC/C,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,IAAI,KAAK,CAAC;oBACxD,CAAC;gBACH,CAAC;gBACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBAC5B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC7C,CAAC;gBACD,OAAO;YACT,CAAC;YACD,+DAA+D;YAC/D,aAAa,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC;QAED,SAAS,KAAK,CAAC,IAAa,EAAE,GAAkB;YAC9C,4EAA4E;YAC5E,IAAI,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,CAAC;oBAClD,IAAI,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;wBACzE,oBAAoB,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;oBAC3C,CAAC;gBACH,CAAC;YACH,CAAC;YAED,8DAA8D;YAC9D,IACE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;mBAC3B,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC;mBACtC,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,EACnE,CAAC;gBACD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;gBACjC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBAClD,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;YAED,sEAAsE;YACtE,IAAI,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBACrC,MAAM,SAAS,GAAG,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;gBAE7C,IAAI,SAAS,GAAG,CAAC,CAAC;gBAClB,IAAI,MAAM,GAA8C,IAAI,CAAC;gBAC7D,OAAO,MAAM,EAAE,CAAC;oBACd,IAAI,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC7B,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;wBAC1E,IAAI,MAAM,CAAC,aAAa,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;4BACpE,aAAa;4BACb,SAAS,IAAI,CAAC,CAAC;4BACf,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;4BAC1E,MAAM,GAAG,SAAS,CAAC;wBACrB,CAAC;6BAAM,IAAI,MAAM,CAAC,aAAa,IAAI,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;4BAC1E,SAAS,IAAI,CAAC,CAAC;4BACf,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;wBAChC,CAAC;6BAAM,CAAC;4BACN,MAAM,GAAG,SAAS,CAAC;wBACrB,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,MAAM,GAAG,SAAS,CAAC;oBACrB,CAAC;gBACH,CAAC;gBACD,OAAO,CAAC,uDAAuD;YACjE,CAAC;YAED,uDAAuD;YACvD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAED,QAAQ,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IAC3B,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/rules/indexes/extract/enumerate.d.ts

@@ -0,0 +1,41 @@
+/**
+ * `enumerateShapes` — turn a `QueryBaseDecl` (base + branched fragments)
+ * into the finite set of `QueryShape`s the source may issue at runtime.
+ *
+ * Algorithm:
+ *   1. Group fragments by branchId (null = unconditional).
+ *   2. For each branch, the choices are: each clause's fragment-list,
+ *      plus an empty-choice if the branch is skippable.
+ *   3. Cartesian product across branches.
+ *   4. Each combo includes all unconditional fragments.
+ *   5. Dedupe shapes by stable key.
+ */
+import type { Annotations, QueryBaseDecl, QueryShape } from './types.js';
+export declare function enumerateShapes(decl: QueryBaseDecl): QueryShape[];
+/**
+ * Result of applying `@firestore-mutex` and `@firestore-required` to a
+ * shape list. Counts let the caller surface how many shapes each
+ * annotation pruned via `AnnotationApplied`.
+ */
+export interface PruneResult {
+    shapes: QueryShape[];
+    prunedByMutex: number;
+    prunedByRequired: number;
+}
+/**
+ * Apply mutex + required annotations to an enumerated shape list.
+ *
+ * - Mutex: a shape is dropped if any mutex group has ≥2 of its fields
+ *   present in the shape's filters or orderBy. (One field from a group
+ *   is fine — the constraint is "at most one".)
+ * - Required: a shape is dropped if it doesn't contain every field in
+ *   `annotations.required` somewhere in filters or orderBy.
+ *
+ * `@firestore-budget` is **not** applied here — that's a soft cap
+ * surfaced as a warning at the orchestrator level, not a prune.
+ *
+ * No-op when `annotations` is `undefined`, empty mutexGroups, and empty
+ * required — returns the input shapes with zero prune counts.
+ */
+export declare function pruneByAnnotations(shapes: QueryShape[], annotations: Annotations | undefined): PruneResult;
+//# sourceMappingURL=enumerate.d.ts.map

package/dist/rules/indexes/extract/enumerate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"enumerate.d.ts","sourceRoot":"","sources":["../../../../src/rules/indexes/extract/enumerate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,KAAK,EAAE,WAAW,EAA2B,aAAa,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAoBlG,wBAAgB,eAAe,CAAC,IAAI,EAAE,aAAa,GAAG,UAAU,EAAE,CAuFjE;AAED;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,UAAU,EAAE,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,UAAU,EAAE,EACpB,WAAW,EAAE,WAAW,GAAG,SAAS,GACnC,WAAW,CA2Cb"}