mongo-query-normalizer 0.1.0

package/dist/passes/simplify.js

@@ -0,0 +1,49 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.simplify = simplify;
+const builders_1 = require("../ast/builders");
+const guards_1 = require("../ast/guards");
+function simplify(node, normalizeContext) {
+    return simplifyRecursive(node, normalizeContext);
+}
+function simplifyRecursive(node, _normalizeContext) {
+    if (!(0, guards_1.isLogicalNode)(node)) {
+        return node;
+    }
+    const simplifiedChildren = node.children.map((child) => simplifyRecursive(child, _normalizeContext));
+    const rebuilt = node.op === "$and" ? (0, builders_1.andNode)(simplifiedChildren) : (0, builders_1.orNode)(simplifiedChildren);
+    return simplifyLogicalNode(rebuilt, _normalizeContext);
+}
+function simplifyLogicalNode(node, _normalizeContext) {
+    if (!(0, guards_1.isLogicalNode)(node)) {
+        return node;
+    }
+    if (node.op === "$and") {
+        if (node.children.some(guards_1.isFalseNode)) {
+            return (0, builders_1.falseNode)();
+        }
+        const filtered = node.children.filter((child) => !(0, guards_1.isTrueNode)(child));
+        if (filtered.length === 0) {
+            return (0, builders_1.trueNode)();
+        }
+        if (filtered.length === 1) {
+            return filtered[0];
+        }
+        return (0, builders_1.andNode)(filtered);
+    }
+    if (node.op === "$or") {
+        if (node.children.some(guards_1.isTrueNode)) {
+            return (0, builders_1.trueNode)();
+        }
+        const filtered = node.children.filter((child) => !(0, guards_1.isFalseNode)(child));
+        if (filtered.length === 0) {
+            return (0, builders_1.falseNode)();
+        }
+        if (filtered.length === 1) {
+            return filtered[0];
+        }
+        return (0, builders_1.orNode)(filtered);
+    }
+    return node;
+}
+//# sourceMappingURL=simplify.js.map

package/dist/passes/simplify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplify.js","sourceRoot":"","sources":["../../src/passes/simplify.ts"],"names":[],"mappings":";;AAKA,4BAEC;AAPD,8CAAuE;AACvE,0CAAuE;AAIvE,SAAgB,QAAQ,CAAC,IAAe,EAAE,gBAAkC;IACxE,OAAO,iBAAiB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAe,EAAE,iBAAmC;IAC3E,IAAI,CAAC,IAAA,sBAAa,EAAC,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAErG,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAM,EAAC,kBAAkB,CAAC,CAAC;IAE9F,OAAO,mBAAmB,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAe,EAAE,iBAAmC;IAC7E,IAAI,CAAC,IAAA,sBAAa,EAAC,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;QACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,oBAAW,CAAC,EAAE,CAAC;YAClC,OAAO,IAAA,oBAAS,GAAE,CAAC;QACvB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,IAAA,mBAAU,EAAC,KAAK,CAAC,CAAC,CAAC;QAErE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,IAAA,mBAAQ,GAAE,CAAC;QACtB,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAED,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,mBAAU,CAAC,EAAE,CAAC;YACjC,OAAO,IAAA,mBAAQ,GAAE,CAAC;QACtB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,IAAA,oBAAW,EAAC,KAAK,CAAC,CAAC,CAAC;QAEtE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,IAAA,oBAAS,GAAE,CAAC;QACvB,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAA,iBAAM,EAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/prune/conflict.d.ts

@@ -0,0 +1,18 @@
+/**
+ * 判断内层选择子句与外层选择子句在同一字段上的条件是否冲突。
+ * 冲突时修减阶段应舍弃该子分支或合并为更严条件。
+ *
+ * @param innerClause - 内层扁平条件（单层，无 $and/$or/$nor）
+ * @param outerClause - 外层已有扁平条件
+ * @returns 若存在某字段上条件互斥则为 true
+ */
+export declare function hasConflictingClauses(innerClause: Record<string, unknown>, outerClause: Record<string, unknown>): boolean;
+/**
+ * 判断同一字段上两个条件值是否互斥（如 $eq: 1 与 $eq: 2，或 $in 与 $nin 交集为空）。
+ *
+ * @param outerValue - 外层该字段的条件值
+ * @param innerValue - 内层该字段的条件值
+ * @returns 若两条件不可能同时满足则为 true
+ */
+export declare function isValueConflict(outerValue: unknown, innerValue: unknown): boolean;
+//# sourceMappingURL=conflict.d.ts.map

package/dist/prune/conflict.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict.d.ts","sourceRoot":"","sources":["../../src/prune/conflict.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACpC,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACnC,OAAO,CAIT;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO,CAIjF"}

package/dist/prune/conflict.js

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.hasConflictingClauses = hasConflictingClauses;
+exports.isValueConflict = isValueConflict;
+/**
+ * 判断内层选择子句与外层选择子句在同一字段上的条件是否冲突。
+ * 冲突时修减阶段应舍弃该子分支或合并为更严条件。
+ *
+ * @param innerClause - 内层扁平条件（单层，无 $and/$or/$nor）
+ * @param outerClause - 外层已有扁平条件
+ * @returns 若存在某字段上条件互斥则为 true
+ */
+function hasConflictingClauses(innerClause, outerClause) {
+    void innerClause;
+    void outerClause;
+    return false;
+}
+/**
+ * 判断同一字段上两个条件值是否互斥（如 $eq: 1 与 $eq: 2，或 $in 与 $nin 交集为空）。
+ *
+ * @param outerValue - 外层该字段的条件值
+ * @param innerValue - 内层该字段的条件值
+ * @returns 若两条件不可能同时满足则为 true
+ */
+function isValueConflict(outerValue, innerValue) {
+    void outerValue;
+    void innerValue;
+    return false;
+}
+//# sourceMappingURL=conflict.js.map

package/dist/prune/conflict.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict.js","sourceRoot":"","sources":["../../src/prune/conflict.ts"],"names":[],"mappings":";;AAQA,sDAOC;AASD,0CAIC;AA5BD;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CACnC,WAAoC,EACpC,WAAoC;IAEpC,KAAK,WAAW,CAAC;IACjB,KAAK,WAAW,CAAC;IACjB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,eAAe,CAAC,UAAmB,EAAE,UAAmB;IACtE,KAAK,UAAU,CAAC;IAChB,KAAK,UAAU,CAAC;IAChB,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/prune/index.d.ts

@@ -0,0 +1,3 @@
+export { simplifySelector } from "./prune.js";
+export { hasConflictingClauses, isValueConflict } from "./conflict.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/prune/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,EAAE,qBAAqB,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC"}

package/dist/prune/index.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isValueConflict = exports.hasConflictingClauses = exports.simplifySelector = void 0;
+var prune_js_1 = require("./prune.js");
+Object.defineProperty(exports, "simplifySelector", { enumerable: true, get: function () { return prune_js_1.simplifySelector; } });
+var conflict_js_1 = require("./conflict.js");
+Object.defineProperty(exports, "hasConflictingClauses", { enumerable: true, get: function () { return conflict_js_1.hasConflictingClauses; } });
+Object.defineProperty(exports, "isValueConflict", { enumerable: true, get: function () { return conflict_js_1.isValueConflict; } });
+//# sourceMappingURL=index.js.map

package/dist/prune/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/prune/index.ts"],"names":[],"mappings":";;;AAAA,uCAA8C;AAArC,4GAAA,gBAAgB,OAAA;AACzB,6CAAuE;AAA9D,oHAAA,qBAAqB,OAAA;AAAE,8GAAA,eAAe,OAAA"}

package/dist/prune/prune.d.ts

@@ -0,0 +1,11 @@
+import type { Selector } from "../common/types.js";
+/**
+ * 阶段一：递归修减分支（冲突消除、去重、单值提升等）。
+ * 逐层处理 $and/$or/$nor，过滤无效条件、冲突则舍弃、合并同类项，不改变整体逻辑结构。
+ * 遇到 $nor / $comment / $text / $where 时保持原样不深入优化。
+ *
+ * @param selector - 原始选择器
+ * @returns 修减后的选择器（逻辑等价或更严，无新增分支）
+ */
+export declare function simplifySelector(selector: Selector): Selector;
+//# sourceMappingURL=prune.d.ts.map

package/dist/prune/prune.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.d.ts","sourceRoot":"","sources":["../../src/prune/prune.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAEnD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAM7D"}

package/dist/prune/prune.js

@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.simplifySelector = simplifySelector;
+/**
+ * 阶段一：递归修减分支（冲突消除、去重、单值提升等）。
+ * 逐层处理 $and/$or/$nor，过滤无效条件、冲突则舍弃、合并同类项，不改变整体逻辑结构。
+ * 遇到 $nor / $comment / $text / $where 时保持原样不深入优化。
+ *
+ * @param selector - 原始选择器
+ * @returns 修减后的选择器（逻辑等价或更严，无新增分支）
+ */
+function simplifySelector(selector) {
+    // TODO: 1. 拆出 $and/$or/$nor 与 base
+    // TODO: 2. 对 $nor/$comment/$text/$where 直接 return selector
+    // TODO: 3. 对 $and/$or 每项递归 simplifySelector，再合并同类、冲突检测舍弃
+    void selector;
+    return selector;
+}
+//# sourceMappingURL=prune.js.map

package/dist/prune/prune.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.js","sourceRoot":"","sources":["../../src/prune/prune.ts"],"names":[],"mappings":";;AAUA,4CAMC;AAdD;;;;;;;GAOG;AACH,SAAgB,gBAAgB,CAAC,QAAkB;IACjD,mCAAmC;IACnC,2DAA2D;IAC3D,yDAAyD;IACzD,KAAK,QAAQ,CAAC;IACd,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/prune.d.ts

@@ -0,0 +1,11 @@
+import type { FilterQuery } from "./types";
+/**
+ * 阶段一：递归修减分支。
+ * 逐层处理 $and/$or/$nor，过滤无效条件、冲突则舍弃、合并同类项，不改变整体逻辑结构。
+ * 遇到 $nor / $comment / $text / $where 时保持原样不深入优化。
+ *
+ * @param query - 原始查询条件
+ * @returns 修减后的查询（逻辑等价或更严，无新增分支）
+ */
+export declare function pruneSelector(query: FilterQuery): FilterQuery;
+//# sourceMappingURL=prune.d.ts.map

package/dist/prune.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.d.ts","sourceRoot":"","sources":["../src/prune.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE3C;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,WAAW,GAAG,WAAW,CAM7D"}

package/dist/prune.js

@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.pruneSelector = pruneSelector;
+/**
+ * 阶段一：递归修减分支。
+ * 逐层处理 $and/$or/$nor，过滤无效条件、冲突则舍弃、合并同类项，不改变整体逻辑结构。
+ * 遇到 $nor / $comment / $text / $where 时保持原样不深入优化。
+ *
+ * @param query - 原始查询条件
+ * @returns 修减后的查询（逻辑等价或更严，无新增分支）
+ */
+function pruneSelector(query) {
+    // TODO: 1. 拆出 $and/$or/$nor 与 baseQuery
+    // TODO: 2. 对 $nor/$comment/$text/$where 直接 return query
+    // TODO: 3. 对 $and/$or 每项递归 pruneSelector，再合并同类、冲突检测舍弃
+    void query;
+    return query;
+}
+//# sourceMappingURL=prune.js.map

package/dist/prune.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prune.js","sourceRoot":"","sources":["../src/prune.ts"],"names":[],"mappings":";;AAUA,sCAMC;AAdD;;;;;;;GAOG;AACH,SAAgB,aAAa,CAAC,KAAkB;IAC9C,wCAAwC;IACxC,wDAAwD;IACxD,sDAAsD;IACtD,KAAK,KAAK,CAAC;IACX,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/rewrite.d.ts

@@ -0,0 +1,27 @@
+import type { SelectorAST } from "./ast/types";
+import type { RewriteOptions, Selector } from "./types";
+/**
+ * 仅对 AST 做重写（不 parse、不 compile），便于复用 AST 重写逻辑或做 AST 级测试/模糊测试。
+ *
+ * **单轮管线**：normalize → predicateMerge → fieldConditionNormalize → simplify → predicateMerge →
+ * fieldConditionNormalize → canonicalize。
+ *
+ * simplify 会打平 `$and` 并可能把原先隔在嵌套里的同字段 `FieldNode` 变成兄弟节点，故在 simplify
+ * 之后必须再跑一轮 merge + 字段规范化，否则 compile 会输出「同字段拆成多条 $and 子句」，再 parse
+ * 时会被合并成单字段多 op，与首轮 AST 不一致。
+ *
+ * **固定点**：对上述管线反复应用直至 AST 稳定或达到 `REWRITE_AST_MAX_PASSES`（对外仍是一次 API 调用）。
+ * 保证在已支持范围内 `rewriteAst(rewriteAst(x))` 与 `rewriteAst(x)` 结构一致。
+ *
+ * 在已建模操作符子集内输出与输入**语义等价**的 AST；可判定矛盾时为 FalseNode。
+ * `options.indexSpecs` 仅影响 canonicalize 中 `$and` 下字段节点顺序，不改变语义。
+ */
+export declare function rewriteAst(ast: SelectorAST, options?: RewriteOptions): SelectorAST;
+/**
+ * 重写 MongoDB 查询过滤器：结构规范化、同字段条件合并、逻辑化简与可判定冲突下的 IMPOSSIBLE_SELECTOR。
+ *
+ * **语义**（已建模字段操作符，见 README 矩阵）：输出与输入匹配同一文档集；若可证明不可满足则返回
+ * `IMPOSSIBLE_SELECTOR`。未建模字段操作符透传，本库不对其做语义变换承诺。
+ */
+export declare function rewriteQuerySelector(selector: Selector, options?: RewriteOptions): Selector;
+//# sourceMappingURL=rewrite.d.ts.map

package/dist/rewrite.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rewrite.d.ts","sourceRoot":"","sources":["../src/rewrite.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAsBxD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,WAAW,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,WAAW,CAUlF;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,QAAQ,CAI3F"}

package/dist/rewrite.js

@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.rewriteAst = rewriteAst;
+exports.rewriteQuerySelector = rewriteQuerySelector;
+const node_util_1 = require("node:util");
+const core_1 = require("./core");
+const compile_1 = require("./operations/compile");
+const parse_1 = require("./operations/parse");
+/** 单轮 AST 管线（供内部固定点循环调用）。 */
+function rewriteAstOnce(ast, options) {
+    const normalized = (0, core_1.normalize)(ast);
+    const merged = (0, core_1.predicateMerge)(normalized);
+    const fieldNormalized = (0, core_1.fieldConditionNormalize)(merged);
+    const simplified = (0, core_1.simplify)(fieldNormalized);
+    const mergedAfterSimplify = (0, core_1.predicateMerge)(simplified);
+    const fieldAfterSimplify = (0, core_1.fieldConditionNormalize)(mergedAfterSimplify);
+    return (0, core_1.canonicalize)(fieldAfterSimplify, options?.indexSpecs);
+}
+/**
+ * 内部最多迭代次数：每轮为完整 normalize→…→canonicalize；`canonicalize` 将字段子句排到前、逻辑子句在后，
+ * 可能使下一轮 `simplify` 才在同一 `$and` 层看到 sibling 字段上下文（例如先出现 `x:false` 再化简 `$nor:[{x:true}]`）。
+ */
+const REWRITE_AST_MAX_PASSES = 8;
+/**
+ * 仅对 AST 做重写（不 parse、不 compile），便于复用 AST 重写逻辑或做 AST 级测试/模糊测试。
+ *
+ * **单轮管线**：normalize → predicateMerge → fieldConditionNormalize → simplify → predicateMerge →
+ * fieldConditionNormalize → canonicalize。
+ *
+ * simplify 会打平 `$and` 并可能把原先隔在嵌套里的同字段 `FieldNode` 变成兄弟节点，故在 simplify
+ * 之后必须再跑一轮 merge + 字段规范化，否则 compile 会输出「同字段拆成多条 $and 子句」，再 parse
+ * 时会被合并成单字段多 op，与首轮 AST 不一致。
+ *
+ * **固定点**：对上述管线反复应用直至 AST 稳定或达到 `REWRITE_AST_MAX_PASSES`（对外仍是一次 API 调用）。
+ * 保证在已支持范围内 `rewriteAst(rewriteAst(x))` 与 `rewriteAst(x)` 结构一致。
+ *
+ * 在已建模操作符子集内输出与输入**语义等价**的 AST；可判定矛盾时为 FalseNode。
+ * `options.indexSpecs` 仅影响 canonicalize 中 `$and` 下字段节点顺序，不改变语义。
+ */
+function rewriteAst(ast, options) {
+    let current = ast;
+    for (let pass = 0; pass < REWRITE_AST_MAX_PASSES; pass += 1) {
+        const next = rewriteAstOnce(current, options);
+        if ((0, node_util_1.isDeepStrictEqual)(next, current)) {
+            return next;
+        }
+        current = next;
+    }
+    return current;
+}
+/**
+ * 重写 MongoDB 查询过滤器：结构规范化、同字段条件合并、逻辑化简与可判定冲突下的 IMPOSSIBLE_SELECTOR。
+ *
+ * **语义**（已建模字段操作符，见 README 矩阵）：输出与输入匹配同一文档集；若可证明不可满足则返回
+ * `IMPOSSIBLE_SELECTOR`。未建模字段操作符透传，本库不对其做语义变换承诺。
+ */
+function rewriteQuerySelector(selector, options) {
+    const ast = (0, parse_1.parseSelector)(selector);
+    const canonical = rewriteAst(ast, options);
+    return (0, compile_1.compileSelector)(canonical);
+}
+//# sourceMappingURL=rewrite.js.map

package/dist/rewrite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rewrite.js","sourceRoot":"","sources":["../src/rewrite.ts"],"names":[],"mappings":";;AAwCA,gCAUC;AAQD,oDAIC;AA9DD,yCAA8C;AAG9C,iCAAoG;AACpG,kDAAuD;AACvD,8CAAmD;AAEnD,6BAA6B;AAC7B,SAAS,cAAc,CAAC,GAAgB,EAAE,OAAwB;IAC9D,MAAM,UAAU,GAAG,IAAA,gBAAS,EAAC,GAAG,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,IAAA,qBAAc,EAAC,UAAU,CAAC,CAAC;IAC1C,MAAM,eAAe,GAAG,IAAA,8BAAuB,EAAC,MAAM,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,IAAA,eAAQ,EAAC,eAAe,CAAC,CAAC;IAC7C,MAAM,mBAAmB,GAAG,IAAA,qBAAc,EAAC,UAAU,CAAC,CAAC;IACvD,MAAM,kBAAkB,GAAG,IAAA,8BAAuB,EAAC,mBAAmB,CAAC,CAAC;IACxE,OAAO,IAAA,mBAAY,EAAC,kBAAkB,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;AACjE,CAAC;AAED;;;GAGG;AACH,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAEjC;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,UAAU,CAAC,GAAgB,EAAE,OAAwB;IACjE,IAAI,OAAO,GAAgB,GAAG,CAAC;IAC/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,sBAAsB,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAG,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC9C,IAAI,IAAA,6BAAiB,EAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,GAAG,IAAI,CAAC;IACnB,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,oBAAoB,CAAC,QAAkB,EAAE,OAAwB;IAC7E,MAAM,GAAG,GAAG,IAAA,qBAAa,EAAC,QAAQ,CAAC,CAAC;IACpC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAC3C,OAAO,IAAA,yBAAe,EAAC,SAAS,CAAC,CAAC;AACtC,CAAC"}

package/dist/rules/experimental/hoist-common-predicates-from-or.d.ts

@@ -0,0 +1,5 @@
+import type { QueryNode } from "../../ast/types";
+import type { NormalizeContext } from "../../normalize-context";
+export declare const RULE_ID = "experimental.hoistCommonPredicatesFromOr";
+export declare function hoistCommonPredicatesFromOr(node: QueryNode, normalizeContext: NormalizeContext, depth?: number): QueryNode;
+//# sourceMappingURL=hoist-common-predicates-from-or.d.ts.map

package/dist/rules/experimental/hoist-common-predicates-from-or.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hoist-common-predicates-from-or.d.ts","sourceRoot":"","sources":["../../../src/rules/experimental/hoist-common-predicates-from-or.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAA0C,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACzF,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAIhE,eAAO,MAAM,OAAO,6CAA6C,CAAC;AAElE,wBAAgB,2BAA2B,CAAC,IAAI,EAAE,SAAS,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,KAAK,SAAI,GAAG,SAAS,CAmBrH"}

package/dist/rules/experimental/hoist-common-predicates-from-or.js

@@ -0,0 +1,153 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RULE_ID = void 0;
+exports.hoistCommonPredicatesFromOr = hoistCommonPredicatesFromOr;
+const builders_1 = require("../../ast/builders");
+const contains_opaque_1 = require("../../ast/contains-opaque");
+const hash_1 = require("../../ast/hash");
+const guards_1 = require("../../ast/guards");
+const metrics_1 = require("../../observe/metrics");
+const warnings_1 = require("../../observe/warnings");
+exports.RULE_ID = "experimental.hoistCommonPredicatesFromOr";
+function hoistCommonPredicatesFromOr(node, normalizeContext, depth = 0) {
+    if (!(0, guards_1.isLogicalNode)(node)) {
+        return node;
+    }
+    const rewrittenChildren = node.children.map((child) => hoistCommonPredicatesFromOr(child, normalizeContext, depth + 1));
+    const rebuilt = node.op === "$and" ? (0, builders_1.andNode)(rewrittenChildren) : (0, builders_1.orNode)(rewrittenChildren);
+    if (rebuilt.op !== "$or") {
+        return rebuilt;
+    }
+    if (!canHoistFromOr(rebuilt, normalizeContext, depth)) {
+        (0, warnings_1.markRuleSkipped)(normalizeContext, exports.RULE_ID, "cannot hoist safely");
+        return rebuilt;
+    }
+    return tryHoistCommonPredicates(rebuilt, normalizeContext);
+}
+function canHoistFromOr(node, normalizeContext, depth) {
+    if (normalizeContext.options.level !== "experimental") {
+        return false;
+    }
+    if (!normalizeContext.options.rules.hoistCommonPredicatesFromOr) {
+        return false;
+    }
+    if (depth > normalizeContext.options.safety.maxNormalizeDepth) {
+        return false;
+    }
+    for (const child of node.children) {
+        if ((0, contains_opaque_1.containsOpaqueNode)(child)) {
+            return false;
+        }
+    }
+    return true;
+}
+function tryHoistCommonPredicates(node, normalizeContext) {
+    const split = splitCommonPredicatesFromBranches(node.children, normalizeContext);
+    if (!split || split.common.length === 0) {
+        (0, warnings_1.markRuleSkipped)(normalizeContext, exports.RULE_ID, "no hoistable common predicates");
+        return node;
+    }
+    const nextOr = (0, builders_1.orNode)(split.branches);
+    const result = (0, builders_1.andNode)([...split.common, nextOr]);
+    const oldCount = (0, metrics_1.collectNodeStats)(node).nodeCount;
+    const newCount = (0, metrics_1.collectNodeStats)(result).nodeCount;
+    const ratio = oldCount === 0 ? 0 : newCount / oldCount;
+    if (ratio > normalizeContext.options.safety.maxNodeGrowthRatio) {
+        (0, warnings_1.bailout)(normalizeContext, `node growth ratio exceeded: ${ratio}`);
+        return node;
+    }
+    (0, warnings_1.markRuleApplied)(normalizeContext, exports.RULE_ID);
+    return result;
+}
+function splitCommonPredicatesFromBranches(branches, _normalizeContext) {
+    const normalizedBranches = [];
+    const maps = [];
+    for (const branch of branches) {
+        const fields = extractHoistableFieldNodes(branch);
+        if (!fields) {
+            return null;
+        }
+        normalizedBranches.push(fields);
+        maps.push(toPredicateMap(fields));
+    }
+    const commonMap = intersectFieldPredicateMaps(maps);
+    if (commonMap.size === 0) {
+        return null;
+    }
+    const commonFieldNodes = commonFieldNodesFrom(commonMap);
+    const nextBranches = normalizedBranches.map((fields) => {
+        const remaining = removeCommonPredicates(fields, commonMap);
+        if (remaining.length === 0) {
+            return (0, builders_1.trueNode)();
+        }
+        if (remaining.length === 1) {
+            return remaining[0];
+        }
+        return (0, builders_1.andNode)(remaining);
+    });
+    return {
+        common: commonFieldNodes,
+        branches: nextBranches,
+    };
+}
+function extractHoistableFieldNodes(branch) {
+    if ((0, guards_1.isFieldNode)(branch)) {
+        return [branch];
+    }
+    if ((0, guards_1.isLogicalNode)(branch) && branch.op === "$and") {
+        if (!branch.children.every(guards_1.isFieldNode)) {
+            return null;
+        }
+        return branch.children;
+    }
+    return null;
+}
+function toPredicateMap(fields) {
+    const m = new Map();
+    for (const f of fields) {
+        m.set(f.field, [...f.predicates]);
+    }
+    return m;
+}
+function intersectFieldPredicateMaps(maps) {
+    if (maps.length === 0) {
+        return new Map();
+    }
+    const result = new Map();
+    for (const [field, preds0] of maps[0]) {
+        let common = preds0;
+        for (let i = 1; i < maps.length; i += 1) {
+            const other = maps[i].get(field);
+            if (!other) {
+                common = [];
+                break;
+            }
+            common = common.filter((p) => other.some((q) => (0, hash_1.hashPredicate)(p) === (0, hash_1.hashPredicate)(q)));
+        }
+        if (common.length > 0) {
+            result.set(field, common);
+        }
+    }
+    return result;
+}
+function commonFieldNodesFrom(commonMap) {
+    return [...commonMap.entries()].map(([field, preds]) => (0, builders_1.fieldNode)(field, preds));
+}
+function removeCommonPredicates(fields, commonMap) {
+    const out = [];
+    for (const f of fields) {
+        const commonPreds = commonMap.get(f.field);
+        if (!commonPreds || commonPreds.length === 0) {
+            out.push(f);
+            continue;
+        }
+        const commonHashes = new Set(commonPreds.map((p) => (0, hash_1.hashPredicate)(p)));
+        const remaining = f.predicates.filter((p) => !commonHashes.has((0, hash_1.hashPredicate)(p)));
+        if (remaining.length === 0) {
+            continue;
+        }
+        out.push((0, builders_1.fieldNode)(f.field, remaining));
+    }
+    return out;
+}
+//# sourceMappingURL=hoist-common-predicates-from-or.js.map

package/dist/rules/experimental/hoist-common-predicates-from-or.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hoist-common-predicates-from-or.js","sourceRoot":"","sources":["../../../src/rules/experimental/hoist-common-predicates-from-or.ts"],"names":[],"mappings":";;;AAWA,kEAmBC;AA9BD,iDAA0E;AAC1E,+DAA+D;AAC/D,yCAA+C;AAC/C,6CAA8D;AAG9D,mDAAyD;AACzD,qDAAmF;AAEtE,QAAA,OAAO,GAAG,0CAA0C,CAAC;AAElE,SAAgB,2BAA2B,CAAC,IAAe,EAAE,gBAAkC,EAAE,KAAK,GAAG,CAAC;IACtG,IAAI,CAAC,IAAA,sBAAa,EAAC,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,2BAA2B,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IAExH,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAM,EAAC,iBAAiB,CAAC,CAAC;IAE5F,IAAI,OAAO,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QACvB,OAAO,OAAO,CAAC;IACnB,CAAC;IAED,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,gBAAgB,EAAE,KAAK,CAAC,EAAE,CAAC;QACpD,IAAA,0BAAe,EAAC,gBAAgB,EAAE,eAAO,EAAE,qBAAqB,CAAC,CAAC;QAClE,OAAO,OAAO,CAAC;IACnB,CAAC;IAED,OAAO,wBAAwB,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,cAAc,CAAC,IAAiB,EAAE,gBAAkC,EAAE,KAAa;IACxF,IAAI,gBAAgB,CAAC,OAAO,CAAC,KAAK,KAAK,cAAc,EAAE,CAAC;QACpD,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,2BAA2B,EAAE,CAAC;QAC9D,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,IAAI,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAC5D,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,IAAA,oCAAkB,EAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAiB,EAAE,gBAAkC;IACnF,MAAM,KAAK,GAAG,iCAAiC,CAAC,IAAI,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;IAEjF,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,IAAA,0BAAe,EAAC,gBAAgB,EAAE,eAAO,EAAE,gCAAgC,CAAC,CAAC;QAC7E,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,MAAM,GAAG,IAAA,iBAAM,EAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,IAAA,kBAAO,EAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAElD,MAAM,QAAQ,GAAG,IAAA,0BAAgB,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAA,0BAAgB,EAAC,MAAM,CAAC,CAAC,SAAS,CAAC;IACpD,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAEvD,IAAI,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC7D,IAAA,kBAAO,EAAC,gBAAgB,EAAE,+BAA+B,KAAK,EAAE,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAA,0BAAe,EAAC,gBAAgB,EAAE,eAAO,CAAC,CAAC;IAC3C,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,SAAS,iCAAiC,CACtC,QAAqB,EACrB,iBAAmC;IAEnC,MAAM,kBAAkB,GAAkB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAoC,EAAE,CAAC;IAEjD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,SAAS,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;IAEzD,MAAM,YAAY,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QACnD,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAE5D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAA,mBAAQ,GAAE,CAAC;QACtB,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,OAAO;QACH,MAAM,EAAE,gBAAgB;QACxB,QAAQ,EAAE,YAAY;KACzB,CAAC;AACN,CAAC;AAED,SAAS,0BAA0B,CAAC,MAAiB;IACjD,IAAI,IAAA,oBAAW,EAAC,MAAM,CAAC,EAAE,CAAC;QACtB,OAAO,CAAC,MAAM,CAAC,CAAC;IACpB,CAAC;IAED,IAAI,IAAA,sBAAa,EAAC,MAAM,CAAC,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;QAChD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,oBAAW,CAAC,EAAE,CAAC;YACtC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,MAAM,CAAC,QAAuB,CAAC;IAC1C,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,SAAS,cAAc,CAAC,MAAmB;IACvC,MAAM,CAAC,GAAG,IAAI,GAAG,EAA4B,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACrB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC;AAED,SAAS,2BAA2B,CAAC,IAAqC;IACtE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,IAAI,GAAG,EAAE,CAAC;IACrB,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAA4B,CAAC;IAEnD,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACpC,IAAI,MAAM,GAAqB,MAAM,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACT,MAAM,GAAG,EAAE,CAAC;gBACZ,MAAM;YACV,CAAC;YACD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,oBAAa,EAAC,CAAC,CAAC,KAAK,IAAA,oBAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,SAAwC;IAClE,OAAO,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,IAAA,oBAAS,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,SAAS,sBAAsB,CAAC,MAAmB,EAAE,SAAwC;IACzF,MAAM,GAAG,GAAgB,EAAE,CAAC;IAE5B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACrB,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,SAAS;QACb,CAAC;QACD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,oBAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,IAAA,oBAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,IAAA,oBAAS,EAAC,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,GAAG,CAAC;AACf,CAAC"}

package/dist/rules/logical/detect-common-predicates-in-or.d.ts

@@ -0,0 +1,5 @@
+import type { QueryNode } from "../../ast/types";
+import type { NormalizeContext } from "../../normalize-context";
+export declare const RULE_ID = "logical.detectCommonPredicatesInOr";
+export declare function detectCommonPredicatesInOr(node: QueryNode, normalizeContext: NormalizeContext): QueryNode;
+//# sourceMappingURL=detect-common-predicates-in-or.d.ts.map

package/dist/rules/logical/detect-common-predicates-in-or.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect-common-predicates-in-or.d.ts","sourceRoot":"","sources":["../../../src/rules/logical/detect-common-predicates-in-or.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAe,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC9D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAGhE,eAAO,MAAM,OAAO,uCAAuC,CAAC;AAE5D,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,SAAS,EAAE,gBAAgB,EAAE,gBAAgB,GAAG,SAAS,CAYzG"}

package/dist/rules/logical/detect-common-predicates-in-or.js

@@ -0,0 +1,82 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RULE_ID = void 0;
+exports.detectCommonPredicatesInOr = detectCommonPredicatesInOr;
+const builders_1 = require("../../ast/builders");
+const hash_1 = require("../../ast/hash");
+const guards_1 = require("../../ast/guards");
+const warnings_1 = require("../../observe/warnings");
+exports.RULE_ID = "logical.detectCommonPredicatesInOr";
+function detectCommonPredicatesInOr(node, normalizeContext) {
+    if (!(0, guards_1.isLogicalNode)(node)) {
+        return node;
+    }
+    if (node.op === "$or") {
+        detectCommonPredicates(node, normalizeContext);
+    }
+    const nextChildren = node.children.map((child) => detectCommonPredicatesInOr(child, normalizeContext));
+    return node.op === "$and" ? (0, builders_1.andNode)(nextChildren) : (0, builders_1.orNode)(nextChildren);
+}
+function detectCommonPredicates(node, normalizeContext) {
+    const maps = node.children.map((branch) => extractComparableFieldPredicates(branch));
+    const common = intersectPredicateMaps(maps);
+    if (common.size === 0) {
+        (0, warnings_1.markRuleSkipped)(normalizeContext, exports.RULE_ID, "no common predicates found in $or");
+        return;
+    }
+    (0, warnings_1.markRuleApplied)(normalizeContext, exports.RULE_ID);
+    (0, warnings_1.addWarning)(normalizeContext, `common predicates detected in $or: ${formatPredicateMap(common)}`);
+}
+function extractComparableFieldPredicates(node) {
+    const map = new Map();
+    if ((0, guards_1.isFieldNode)(node)) {
+        const safe = node.predicates
+            .filter((p) => !p.opaque && p.op !== "raw")
+            .map((p) => (0, hash_1.hashPredicate)(p));
+        if (safe.length > 0) {
+            map.set(node.field, safe);
+        }
+        return map;
+    }
+    if ((0, guards_1.isLogicalNode)(node) && node.op === "$and") {
+        for (const child of node.children) {
+            if (!(0, guards_1.isFieldNode)(child)) {
+                continue;
+            }
+            const safe = child.predicates
+                .filter((p) => !p.opaque && p.op !== "raw")
+                .map((p) => (0, hash_1.hashPredicate)(p));
+            if (safe.length > 0) {
+                map.set(child.field, safe);
+            }
+        }
+    }
+    return map;
+}
+function intersectPredicateMaps(maps) {
+    if (maps.length === 0) {
+        return new Map();
+    }
+    const result = new Map(maps[0]);
+    for (let i = 1; i < maps.length; i += 1) {
+        for (const [field, predicates] of [...result.entries()]) {
+            const other = maps[i].get(field);
+            if (!other) {
+                result.delete(field);
+                continue;
+            }
+            const intersection = predicates.filter((p) => other.includes(p));
+            if (intersection.length === 0) {
+                result.delete(field);
+            }
+            else {
+                result.set(field, intersection);
+            }
+        }
+    }
+    return result;
+}
+function formatPredicateMap(common) {
+    return JSON.stringify([...common.entries()]);
+}
+//# sourceMappingURL=detect-common-predicates-in-or.js.map

package/dist/rules/logical/detect-common-predicates-in-or.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect-common-predicates-in-or.js","sourceRoot":"","sources":["../../../src/rules/logical/detect-common-predicates-in-or.ts"],"names":[],"mappings":";;;AASA,gEAYC;AArBD,iDAAqD;AACrD,yCAA+C;AAC/C,6CAA8D;AAG9D,qDAAsF;AAEzE,QAAA,OAAO,GAAG,oCAAoC,CAAC;AAE5D,SAAgB,0BAA0B,CAAC,IAAe,EAAE,gBAAkC;IAC1F,IAAI,CAAC,IAAA,sBAAa,EAAC,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QACpB,sBAAsB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,0BAA0B,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC;IAEvG,OAAO,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAM,EAAC,YAAY,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,sBAAsB,CAAC,IAAiB,EAAE,gBAAkC;IACjF,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,gCAAgC,CAAC,MAAM,CAAC,CAAC,CAAC;IACrF,MAAM,MAAM,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAE5C,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACpB,IAAA,0BAAe,EAAC,gBAAgB,EAAE,eAAO,EAAE,mCAAmC,CAAC,CAAC;QAChF,OAAO;IACX,CAAC;IAED,IAAA,0BAAe,EAAC,gBAAgB,EAAE,eAAO,CAAC,CAAC;IAC3C,IAAA,qBAAU,EAAC,gBAAgB,EAAE,sCAAsC,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AACrG,CAAC;AAED,SAAS,gCAAgC,CAAC,IAAe;IACrD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IAExC,IAAI,IAAA,oBAAW,EAAC,IAAI,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU;aACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,oBAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAElC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAED,IAAI,IAAA,sBAAa,EAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,IAAA,oBAAW,EAAC,KAAK,CAAC,EAAE,CAAC;gBACtB,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU;iBACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC;iBAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,oBAAa,EAAC,CAAC,CAAC,CAAC,CAAC;YAElC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClB,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACf,CAAC;AAED,SAAS,sBAAsB,CAAC,IAA6B;IACzD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,IAAI,GAAG,EAAE,CAAC;IACrB,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACT,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACrB,SAAS;YACb,CAAC;YAED,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YACpC,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,SAAS,kBAAkB,CAAC,MAA6B;IACrD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;AACjD,CAAC"}

package/dist/rules/predicate/collapse-contradictions.d.ts

@@ -0,0 +1,5 @@
+import type { QueryNode } from "../../ast/types";
+import type { NormalizeContext } from "../../normalize-context";
+export declare const RULE_ID = "predicate.collapseContradictions";
+export declare function collapseContradictions(node: QueryNode, normalizeContext: NormalizeContext): QueryNode;
+//# sourceMappingURL=collapse-contradictions.d.ts.map

package/dist/rules/predicate/collapse-contradictions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collapse-contradictions.d.ts","sourceRoot":"","sources":["../../../src/rules/predicate/collapse-contradictions.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAkB,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAIhE,eAAO,MAAM,OAAO,qCAAqC,CAAC;AA4B1D,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,gBAAgB,EAAE,gBAAgB,GAAG,SAAS,CAerG"}