pyric 0.0.1 → 0.1.0-alpha.7

package/dist/rules/linter/ast-utils.js

@@ -0,0 +1,491 @@
+/**
+ * Count the maximum flat binary chain depth for a given operator.
+ *
+ * A flat chain `a && b && c` has depth 3 (three operands joined by &&).
+ * Nested chains `(a && b) || (c && d)` have OR-depth 2 and AND-depth 2.
+ *
+ * The Firestore compilation limit is 98 for both AND and OR chains.
+ *
+ * The parser builds right-associative trees: `a && b && c` becomes
+ * `binaryOp(&&, a, binaryOp(&&, b, c))`. So we count by following the
+ * right branch while the operator matches.
+ */
+export function maxChainDepth(expr, op) {
+    if (expr.type !== 'binaryOp' || expr.op !== op)
+        return 0;
+    // Count: 1 for this node + continue down the right branch
+    return 1 + maxChainDepth(expr.right, op);
+}
+/**
+ * Find the maximum chain depth for ANY binary operator in an expression tree.
+ * Walks all subexpressions to find the deepest chain anywhere.
+ */
+export function deepestChain(expr) {
+    let max = { op: '', depth: 0 };
+    function walk(e) {
+        if (e.type === 'binaryOp') {
+            const andDepth = maxChainDepth(e, '&&');
+            const orDepth = maxChainDepth(e, '||');
+            if (andDepth > max.depth)
+                max = { op: '&&', depth: andDepth };
+            if (orDepth > max.depth)
+                max = { op: '||', depth: orDepth };
+            walk(e.left);
+            walk(e.right);
+        }
+        else {
+            walkChildren(e);
+        }
+    }
+    function walkChildren(e) {
+        switch (e.type) {
+            case 'unaryOp':
+                walk(e.operand);
+                break;
+            case 'methodCall':
+                walk(e.object);
+                e.args.forEach(walk);
+                break;
+            case 'memberAccess':
+                walk(e.object);
+                break;
+            case 'bracketAccess':
+                walk(e.object);
+                walk(e.index);
+                break;
+            case 'ternary':
+                walk(e.condition);
+                walk(e.consequent);
+                walk(e.alternate);
+                break;
+            case 'inExpr':
+                walk(e.element);
+                walk(e.collection);
+                break;
+            case 'isExpr':
+                walk(e.value);
+                break;
+            case 'listLiteral':
+                e.elements.forEach(walk);
+                break;
+            case 'mapLiteral':
+                e.entries.forEach(en => { walk(en.key); walk(en.value); });
+                break;
+            case 'functionCall':
+                e.args.forEach(walk);
+                break;
+        }
+    }
+    walk(expr);
+    return max;
+}
+/**
+ * Count total expression nodes in an expression tree.
+ * Used for runtime budget estimation.
+ */
+export function countExpressionNodes(expr) {
+    let count = 1; // this node
+    switch (expr.type) {
+        case 'binaryOp':
+            count += countExpressionNodes(expr.left) + countExpressionNodes(expr.right);
+            break;
+        case 'unaryOp':
+            count += countExpressionNodes(expr.operand);
+            break;
+        case 'methodCall':
+            count += countExpressionNodes(expr.object);
+            for (const a of expr.args)
+                count += countExpressionNodes(a);
+            break;
+        case 'memberAccess':
+            count += countExpressionNodes(expr.object);
+            break;
+        case 'bracketAccess':
+            count += countExpressionNodes(expr.object) + countExpressionNodes(expr.index);
+            break;
+        case 'ternary':
+            count += countExpressionNodes(expr.condition) + countExpressionNodes(expr.consequent) + countExpressionNodes(expr.alternate);
+            break;
+        case 'inExpr':
+            count += countExpressionNodes(expr.element) + countExpressionNodes(expr.collection);
+            break;
+        case 'isExpr':
+            count += countExpressionNodes(expr.value);
+            break;
+        case 'listLiteral':
+            for (const el of expr.elements)
+                count += countExpressionNodes(el);
+            break;
+        case 'mapLiteral':
+            for (const en of expr.entries)
+                count += countExpressionNodes(en.key) + countExpressionNodes(en.value);
+            break;
+        case 'functionCall':
+            for (const a of expr.args)
+                count += countExpressionNodes(a);
+            break;
+        case 'pathLiteral':
+            for (const seg of expr.segments) {
+                if (typeof seg !== 'string')
+                    count += countExpressionNodes(seg);
+            }
+            break;
+    }
+    return count;
+}
+/**
+ * Produce a structural fingerprint of an expression for comparison.
+ * Used by SHARED_GATE to detect identical first expressions across allow rules.
+ *
+ * Two expressions with the same fingerprint are structurally identical
+ * (same operators, same field names, same literals, same nesting).
+ */
+export function expressionFingerprint(expr) {
+    switch (expr.type) {
+        case 'literal': return `L:${expr.raw}`;
+        case 'identifier': return `I:${expr.name}`;
+        case 'memberAccess': return `M:${expressionFingerprint(expr.object)}.${expr.property}`;
+        case 'methodCall': return `MC:${expressionFingerprint(expr.object)}.${expr.method}(${expr.args.map(expressionFingerprint).join(',')})`;
+        case 'bracketAccess': return `B:${expressionFingerprint(expr.object)}[${expressionFingerprint(expr.index)}]`;
+        case 'binaryOp': return `BO:${expressionFingerprint(expr.left)}${expr.op}${expressionFingerprint(expr.right)}`;
+        case 'unaryOp': return `UO:${expr.op}${expressionFingerprint(expr.operand)}`;
+        case 'ternary': return `T:${expressionFingerprint(expr.condition)}?${expressionFingerprint(expr.consequent)}:${expressionFingerprint(expr.alternate)}`;
+        case 'inExpr': return `IN:${expressionFingerprint(expr.element)}in${expressionFingerprint(expr.collection)}`;
+        case 'isExpr': return `IS:${expressionFingerprint(expr.value)}is${expr.typeName}`;
+        case 'listLiteral': return `LL:[${expr.elements.map(expressionFingerprint).join(',')}]`;
+        case 'mapLiteral': return `ML:{${expr.entries.map(e => expressionFingerprint(e.key) + ':' + expressionFingerprint(e.value)).join(',')}}`;
+        case 'functionCall': return `FC:${expr.name}(${expr.args.map(expressionFingerprint).join(',')})`;
+        case 'pathLiteral': return `PL:${expr.raw}`;
+        case 'sliceAccess': return `SL:${expressionFingerprint(expr.object)}[${expressionFingerprint(expr.start)}:${expressionFingerprint(expr.end)}]`;
+        default: {
+            const _exhaustive = expr;
+            throw new Error(`expressionFingerprint: unhandled type ${_exhaustive.type}`);
+        }
+    }
+}
+/**
+ * Extract the first (leftmost) condition from a binary AND chain.
+ * For `a && b && c`, returns `a` (the gate expression).
+ *
+ * The parser builds: binaryOp(&&, a, binaryOp(&&, b, c))
+ * So the first expression is always the left child of the outermost &&.
+ */
+export function extractFirstExpression(condition) {
+    if (condition.type === 'binaryOp' && condition.op === '&&') {
+        return extractFirstExpression(condition.left);
+    }
+    return condition;
+}
+/**
+ * Build a call graph: function name → list of functions it calls.
+ * Includes both direct and let-binding calls.
+ */
+export function buildCallGraph(functions) {
+    const graph = new Map();
+    const fnNames = new Set(functions.map(f => f.name));
+    const builtins = new Set(['get', 'exists', 'getAfter', 'debug']);
+    function collectCalls(expr) {
+        const calls = [];
+        const walk = (e) => {
+            switch (e.type) {
+                case 'functionCall':
+                    if (fnNames.has(e.name) && !builtins.has(e.name))
+                        calls.push(e.name);
+                    e.args.forEach(walk);
+                    break;
+                case 'binaryOp':
+                    walk(e.left);
+                    walk(e.right);
+                    break;
+                case 'unaryOp':
+                    walk(e.operand);
+                    break;
+                case 'methodCall':
+                    walk(e.object);
+                    e.args.forEach(walk);
+                    break;
+                case 'memberAccess':
+                    walk(e.object);
+                    break;
+                case 'bracketAccess':
+                    walk(e.object);
+                    walk(e.index);
+                    break;
+                case 'ternary':
+                    walk(e.condition);
+                    walk(e.consequent);
+                    walk(e.alternate);
+                    break;
+                case 'inExpr':
+                    walk(e.element);
+                    walk(e.collection);
+                    break;
+                case 'isExpr':
+                    walk(e.value);
+                    break;
+                case 'listLiteral':
+                    e.elements.forEach(walk);
+                    break;
+                case 'mapLiteral':
+                    e.entries.forEach(en => { walk(en.key); walk(en.value); });
+                    break;
+            }
+        };
+        walk(expr);
+        return [...new Set(calls)];
+    }
+    for (const fn of functions) {
+        const calls = [];
+        calls.push(...collectCalls(fn.body));
+        for (const binding of fn.lets) {
+            calls.push(...collectCalls(binding.value));
+        }
+        graph.set(fn.name, [...new Set(calls)]);
+    }
+    return graph;
+}
+/**
+ * Find the maximum call chain depth from a starting point.
+ */
+export function maxCallDepth(start, graph, visited = new Set()) {
+    if (visited.has(start))
+        return 0;
+    visited.add(start);
+    const callees = graph.get(start) || [];
+    if (callees.length === 0)
+        return 1;
+    let max = 0;
+    for (const callee of callees) {
+        max = Math.max(max, maxCallDepth(callee, graph, new Set(visited)));
+    }
+    return 1 + max;
+}
+/**
+ * Count get() and exists() calls reachable from an expression,
+ * following function calls transitively.
+ */
+export function countGetCalls(expr, functions, visited = new Set()) {
+    let count = 0;
+    const walk = (e) => {
+        switch (e.type) {
+            case 'functionCall':
+                if (e.name === 'get' || e.name === 'exists') {
+                    count++;
+                }
+                else if (functions.has(e.name) && !visited.has(e.name)) {
+                    visited.add(e.name);
+                    const fn = functions.get(e.name);
+                    walk(fn.body);
+                    for (const b of fn.lets)
+                        walk(b.value);
+                }
+                e.args.forEach(walk);
+                break;
+            case 'binaryOp':
+                walk(e.left);
+                walk(e.right);
+                break;
+            case 'unaryOp':
+                walk(e.operand);
+                break;
+            case 'methodCall':
+                walk(e.object);
+                e.args.forEach(walk);
+                break;
+            case 'memberAccess':
+                walk(e.object);
+                break;
+            case 'bracketAccess':
+                walk(e.object);
+                walk(e.index);
+                break;
+            case 'ternary':
+                walk(e.condition);
+                walk(e.consequent);
+                walk(e.alternate);
+                break;
+            case 'inExpr':
+                walk(e.element);
+                walk(e.collection);
+                break;
+            case 'isExpr':
+                walk(e.value);
+                break;
+            case 'listLiteral':
+                e.elements.forEach(walk);
+                break;
+            case 'mapLiteral':
+                e.entries.forEach(en => { walk(en.key); walk(en.value); });
+                break;
+        }
+    };
+    walk(expr);
+    return count;
+}
+/**
+ * Count how many times each user-defined function is called in an expression.
+ * Unlike countGetCalls (which deduplicates), this counts raw call-site occurrences.
+ */
+export function countFunctionCallSites(expr, fnNames) {
+    const counts = new Map();
+    const walk = (e) => {
+        switch (e.type) {
+            case 'functionCall':
+                if (fnNames.has(e.name)) {
+                    counts.set(e.name, (counts.get(e.name) ?? 0) + 1);
+                }
+                e.args.forEach(walk);
+                break;
+            case 'binaryOp':
+                walk(e.left);
+                walk(e.right);
+                break;
+            case 'unaryOp':
+                walk(e.operand);
+                break;
+            case 'methodCall':
+                walk(e.object);
+                e.args.forEach(walk);
+                break;
+            case 'memberAccess':
+                walk(e.object);
+                break;
+            case 'bracketAccess':
+                walk(e.object);
+                walk(e.index);
+                break;
+            case 'ternary':
+                walk(e.condition);
+                walk(e.consequent);
+                walk(e.alternate);
+                break;
+            case 'inExpr':
+                walk(e.element);
+                walk(e.collection);
+                break;
+            case 'isExpr':
+                walk(e.value);
+                break;
+            case 'listLiteral':
+                e.elements.forEach(walk);
+                break;
+            case 'mapLiteral':
+                e.entries.forEach(en => { walk(en.key); walk(en.value); });
+                break;
+        }
+    };
+    walk(expr);
+    return counts;
+}
+/**
+ * Check if a function transitively contains get() or exists() calls.
+ */
+export function functionContainsGet(fnName, fnMap, visited = new Set()) {
+    if (visited.has(fnName))
+        return false;
+    visited.add(fnName);
+    const fn = fnMap.get(fnName);
+    if (!fn)
+        return false;
+    const check = (e) => {
+        switch (e.type) {
+            case 'functionCall':
+                if (e.name === 'get' || e.name === 'exists')
+                    return true;
+                if (fnMap.has(e.name))
+                    return functionContainsGet(e.name, fnMap, visited);
+                return e.args.some(check);
+            case 'binaryOp': return check(e.left) || check(e.right);
+            case 'unaryOp': return check(e.operand);
+            case 'methodCall': return check(e.object) || e.args.some(check);
+            case 'memberAccess': return check(e.object);
+            case 'bracketAccess': return check(e.object) || check(e.index);
+            case 'ternary': return check(e.condition) || check(e.consequent) || check(e.alternate);
+            case 'inExpr': return check(e.element) || check(e.collection);
+            case 'isExpr': return check(e.value);
+            case 'listLiteral': return e.elements.some(check);
+            case 'mapLiteral': return e.entries.some(en => check(en.key) || check(en.value));
+            default: return false;
+        }
+    };
+    return check(fn.body) || fn.lets.some(b => check(b.value));
+}
+/**
+ * Check if an expression transitively references `request.time`. Walks
+ * subexpressions and follows user-defined function calls. Used by the
+ * REQUEST_TIME_NOT_PINNED lint rule (REBUILD_PLAN.md Item 0.F follow-up):
+ * a rule that reads `request.time` produces non-deterministic outcomes
+ * across CI runs unless the test pins `requestTime`.
+ *
+ * Matches both the dot form (`request.time`) — `memberAccess` whose
+ * object is the identifier `request` and property is `time` — and the
+ * bracket form (`request['time']`).
+ */
+export function referencesRequestTime(expr, fnMap, visited = new Set()) {
+    const check = (e) => {
+        switch (e.type) {
+            case 'memberAccess':
+                if (e.property === 'time' &&
+                    e.object.type === 'identifier' &&
+                    e.object.name === 'request')
+                    return true;
+                return check(e.object);
+            case 'bracketAccess':
+                if (e.object.type === 'identifier' &&
+                    e.object.name === 'request' &&
+                    e.index.type === 'literal' &&
+                    e.index.value === 'time')
+                    return true;
+                return check(e.object) || check(e.index);
+            case 'functionCall':
+                if (fnMap.has(e.name) && !visited.has(e.name)) {
+                    visited.add(e.name);
+                    const fn = fnMap.get(e.name);
+                    if (referencesRequestTime(fn.body, fnMap, visited))
+                        return true;
+                    if (fn.lets.some(b => referencesRequestTime(b.value, fnMap, visited)))
+                        return true;
+                }
+                return e.args.some(check);
+            case 'binaryOp': return check(e.left) || check(e.right);
+            case 'unaryOp': return check(e.operand);
+            case 'methodCall': return check(e.object) || e.args.some(check);
+            case 'ternary': return check(e.condition) || check(e.consequent) || check(e.alternate);
+            case 'inExpr': return check(e.element) || check(e.collection);
+            case 'isExpr': return check(e.value);
+            case 'listLiteral': return e.elements.some(check);
+            case 'mapLiteral': return e.entries.some(en => check(en.key) || check(en.value));
+            default: return false;
+        }
+    };
+    return check(expr);
+}
+/**
+ * Collect all functions from a match block and its children (recursive).
+ */
+export function collectAllFunctions(match) {
+    const fns = [...match.functions];
+    for (const child of match.children) {
+        fns.push(...collectAllFunctions(child));
+    }
+    return fns;
+}
+/**
+ * Collect all allow rules from a match block and its children (recursive).
+ */
+export function collectAllRules(match) {
+    const results = [];
+    for (const rule of match.allows) {
+        results.push({ rule, path: match.path.raw, matchFunctions: match.functions });
+    }
+    for (const child of match.children) {
+        const childResults = collectAllRules(child);
+        // Child rules can access parent functions too
+        for (const cr of childResults) {
+            cr.matchFunctions = [...match.functions, ...cr.matchFunctions];
+        }
+        results.push(...childResults);
+    }
+    return results;
+}
+//# sourceMappingURL=ast-utils.js.map

package/dist/rules/linter/ast-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-utils.js","sourceRoot":"","sources":["../../../src/rules/linter/ast-utils.ts"],"names":[],"mappings":"AAQA;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,aAAa,CAAC,IAAgB,EAAE,EAAU;IACxD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACzD,0DAA0D;IAC1D,OAAO,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AAC3C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,IAAgB;IAC3C,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAE/B,SAAS,IAAI,CAAC,CAAa;QACzB,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACvC,IAAI,QAAQ,GAAG,GAAG,CAAC,KAAK;gBAAE,GAAG,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;YAC9D,IAAI,OAAO,GAAG,GAAG,CAAC,KAAK;gBAAE,GAAG,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;YAC5D,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACb,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,SAAS,YAAY,CAAC,CAAa;QACjC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,SAAS;gBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAAC,MAAM;YACvC,KAAK,YAAY;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAC,MAAM;YAC/D,KAAK,cAAc;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,MAAM;YAC3C,KAAK,eAAe;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YAC3D,KAAK,SAAS;gBAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAAC,MAAM;YAChF,KAAK,QAAQ;gBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAAC,MAAM;YAC1D,KAAK,QAAQ;gBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YACpC,KAAK,aAAa;gBAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAC,MAAM;YACpD,KAAK,YAAY;gBAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,MAAM;YACrF,KAAK,cAAc;gBAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAC,MAAM;QACnD,CAAC;IACH,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAgB;IACnD,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,YAAY;IAC3B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,UAAU;YACb,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5E,MAAM;QACR,KAAK,SAAS;YACZ,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM;QACR,KAAK,YAAY;YACf,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI;gBAAE,KAAK,IAAI,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM;QACR,KAAK,cAAc;YACjB,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3C,MAAM;QACR,KAAK,eAAe;YAClB,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9E,MAAM;QACR,KAAK,SAAS;YACZ,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7H,MAAM;QACR,KAAK,QAAQ;YACX,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACpF,MAAM;QACR,KAAK,QAAQ;YACX,KAAK,IAAI,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1C,MAAM;QACR,KAAK,aAAa;YAChB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ;gBAAE,KAAK,IAAI,oBAAoB,CAAC,EAAE,CAAC,CAAC;YAClE,MAAM;QACR,KAAK,YAAY;YACf,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,OAAO;gBAAE,KAAK,IAAI,oBAAoB,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,oBAAoB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YACtG,MAAM;QACR,KAAK,cAAc;YACjB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI;gBAAE,KAAK,IAAI,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM;QACR,KAAK,aAAa;YAChB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,IAAI,OAAO,GAAG,KAAK,QAAQ;oBAAE,KAAK,IAAI,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAClE,CAAC;YACD,MAAM;IACV,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAgB;IACpD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,SAAS,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;QACvC,KAAK,YAAY,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;QAC3C,KAAK,cAAc,CAAC,CAAC,OAAO,KAAK,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QACvF,KAAK,YAAY,CAAC,CAAC,OAAO,MAAM,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACvI,KAAK,eAAe,CAAC,CAAC,OAAO,KAAK,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAC7G,KAAK,UAAU,CAAC,CAAC,OAAO,MAAM,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/G,KAAK,SAAS,CAAC,CAAC,OAAO,MAAM,IAAI,CAAC,EAAE,GAAG,qBAAqB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7E,KAAK,SAAS,CAAC,CAAC,OAAO,KAAK,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QACvJ,KAAK,QAAQ,CAAC,CAAC,OAAO,MAAM,qBAAqB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7G,KAAK,QAAQ,CAAC,CAAC,OAAO,MAAM,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClF,KAAK,aAAa,CAAC,CAAC,OAAO,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACxF,KAAK,YAAY,CAAC,CAAC,OAAO,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,qBAAqB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACzI,KAAK,cAAc,CAAC,CAAC,OAAO,MAAM,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACjG,KAAK,aAAa,CAAC,CAAC,OAAO,MAAM,IAAI,CAAC,GAAG,EAAE,CAAC;QAC5C,KAAK,aAAa,CAAC,CAAC,OAAO,MAAM,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QAC/I,OAAO,CAAC,CAAC,CAAC;YACR,MAAM,WAAW,GAAU,IAAI,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,yCAA0C,WAAgC,CAAC,IAAI,EAAE,CAAC,CAAC;QACrG,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,SAAqB;IAC1D,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,IAAI,SAAS,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;QAC3D,OAAO,sBAAsB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,SAAwB;IACrD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IAEjE,SAAS,YAAY,CAAC,IAAgB;QACpC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,CAAa,EAAE,EAAE;YAC7B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;gBACf,KAAK,cAAc;oBACjB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACrE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACrB,MAAM;gBACR,KAAK,UAAU;oBAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBAAC,MAAM;gBACpD,KAAK,SAAS;oBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBAAC,MAAM;gBACvC,KAAK,YAAY;oBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAAC,MAAM;gBAC/D,KAAK,cAAc;oBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBAAC,MAAM;gBAC3C,KAAK,eAAe;oBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBAAC,MAAM;gBAC3D,KAAK,SAAS;oBAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAAC,MAAM;gBAChF,KAAK,QAAQ;oBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM;gBAC1D,KAAK,QAAQ;oBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBAAC,MAAM;gBACpC,KAAK,aAAa;oBAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAAC,MAAM;gBACpD,KAAK,YAAY;oBAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,MAAM;YACvF,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,CAAC;QACX,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,KAAK,MAAM,OAAO,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,KAA4B,EAAE,UAAU,IAAI,GAAG,EAAU;IACnG,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,IAAgB,EAAE,SAAmC,EAAE,UAAU,IAAI,GAAG,EAAU;IAC9G,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,CAAC,CAAa,EAAE,EAAE;QAC7B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,cAAc;gBACjB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBAC5C,KAAK,EAAE,CAAC;gBACV,CAAC;qBAAM,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACpB,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC;oBAClC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;oBACd,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI;wBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACzC,CAAC;gBACD,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACrB,MAAM;YACR,KAAK,UAAU;gBAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YACpD,KAAK,SAAS;gBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAAC,MAAM;YACvC,KAAK,YAAY;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAC,MAAM;YAC/D,KAAK,cAAc;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,MAAM;YAC3C,KAAK,eAAe;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YAC3D,KAAK,SAAS;gBAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAAC,MAAM;YAChF,KAAK,QAAQ;gBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAAC,MAAM;YAC1D,KAAK,QAAQ;gBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YACpC,KAAK,aAAa;gBAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAC,MAAM;YACpD,KAAK,YAAY;gBAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,MAAM;QACvF,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAAgB,EAAE,OAAoB;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,IAAI,GAAG,CAAC,CAAa,EAAE,EAAE;QAC7B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,cAAc;gBACjB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBACxB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpD,CAAC;gBACD,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACrB,MAAM;YACR,KAAK,UAAU;gBAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YACpD,KAAK,SAAS;gBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAAC,MAAM;YACvC,KAAK,YAAY;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAC,MAAM;YAC/D,KAAK,cAAc;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,MAAM;YAC3C,KAAK,eAAe;gBAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YAC3D,KAAK,SAAS;gBAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAAC,MAAM;YAChF,KAAK,QAAQ;gBAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAAC,MAAM;YAC1D,KAAK,QAAQ;gBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM;YACpC,KAAK,aAAa;gBAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAAC,MAAM;YACpD,KAAK,YAAY;gBAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,MAAM;QACvF,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAc,EAAE,KAA+B,EAAE,UAAU,IAAI,GAAG,EAAU;IAC9G,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACpB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,IAAI,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;IAEtB,MAAM,KAAK,GAAG,CAAC,CAAa,EAAW,EAAE;QACvC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,cAAc;gBACjB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;oBAAE,OAAO,IAAI,CAAC;gBACzD,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;oBAAE,OAAO,mBAAmB,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC1E,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5B,KAAK,UAAU,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACxD,KAAK,SAAS,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACxC,KAAK,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChE,KAAK,cAAc,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC5C,KAAK,eAAe,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC/D,KAAK,SAAS,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACvF,KAAK,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC9D,KAAK,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrC,KAAK,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,KAAK,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACjF,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC;QACxB,CAAC;IACH,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,qBAAqB,CACnC,IAAgB,EAChB,KAA+B,EAC/B,UAAU,IAAI,GAAG,EAAU;IAE3B,MAAM,KAAK,GAAG,CAAC,CAAa,EAAW,EAAE;QACvC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,cAAc;gBACjB,IACE,CAAC,CAAC,QAAQ,KAAK,MAAM;oBACrB,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,YAAY;oBAC9B,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS;oBAC3B,OAAO,IAAI,CAAC;gBACd,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACzB,KAAK,eAAe;gBAClB,IACE,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,YAAY;oBAC9B,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS;oBAC3B,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS;oBAC1B,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,MAAM;oBACxB,OAAO,IAAI,CAAC;gBACd,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC3C,KAAK,cAAc;gBACjB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC9C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACpB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC;oBAC9B,IAAI,qBAAqB,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC;wBAAE,OAAO,IAAI,CAAC;oBAChE,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;wBAAE,OAAO,IAAI,CAAC;gBACrF,CAAC;gBACD,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5B,KAAK,UAAU,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACxD,KAAK,SAAS,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACxC,KAAK,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChE,KAAK,SAAS,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACvF,KAAK,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC9D,KAAK,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrC,KAAK,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,KAAK,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACjF,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC;QACxB,CAAC;IACH,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAiB;IACnD,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;IACjC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACnC,GAAG,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,KAAiB;IAC/C,MAAM,OAAO,GAAuE,EAAE,CAAC;IACvF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAChC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,cAAc,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACnC,MAAM,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5C,8CAA8C;QAC9C,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,EAAE,CAAC,cAAc,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/rules/linter/hallucinations.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Hallucination lint rules.
+ *
+ * Catches JavaScript-style code that compiles in Firestore rules
+ * (because CEL is dynamically typed) but fails at runtime with an
+ * opaque `permission-denied` error.
+ *
+ * These rules are mechanical AST checks against a known-bad set of
+ * method names, globals, and context paths. The CEL spec doesn't
+ * change often and Firestore's runtime stdlib is small, so the
+ * known-bad lists are stable.
+ *
+ * All rules in this module emit `error` severity by default — a true
+ * positive is always a true positive (the named method or global
+ * literally does not exist), so blocking deploy is correct behavior.
+ * The exceptions are LENGTH_PROPERTY and METHOD_MISSING_PARENS, which
+ * could theoretically collide with user-chosen field names; those emit
+ * `warning` severity.
+ */
+import type { FirestoreRules } from '../grammar/FirestoreAST.js';
+import type { LintWarning } from './linter.js';
+/**
+ * Pre-parse syntactic check. Strips comments, scans the source for the
+ * SYNTAX_HINTS patterns, emits one `INVALID_OPERATOR` per distinct hit.
+ */
+export declare function checkSyntaxHints(source: string): LintWarning[];
+/**
+ * Walks every expression in the rules and flags JS-style code that
+ * Firestore parses but cannot evaluate. Returns one warning per
+ * distinct (rule, key, location) tuple — duplicate identical patterns
+ * within the same rule are de-duplicated.
+ */
+export declare function checkHallucinations(ast: FirestoreRules): LintWarning[];
+//# sourceMappingURL=hallucinations.d.ts.map

package/dist/rules/linter/hallucinations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hallucinations.d.ts","sourceRoot":"","sources":["../../../src/rules/linter/hallucinations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,KAAK,EACV,cAAc,EAGf,MAAM,4BAA4B,CAAC;AACpC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAmI/C;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE,CAe9D;AAiDD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,cAAc,GAAG,WAAW,EAAE,CA+ItE"}