mongo-query-normalizer 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +15 -0
- package/README.md +193 -0
- package/README.zh-CN.md +194 -0
- package/dist/ast/builders.d.ts +8 -0
- package/dist/ast/builders.d.ts.map +1 -0
- package/dist/ast/builders.js +27 -0
- package/dist/ast/builders.js.map +1 -0
- package/dist/ast/contains-opaque.d.ts +3 -0
- package/dist/ast/contains-opaque.d.ts.map +1 -0
- package/dist/ast/contains-opaque.js +14 -0
- package/dist/ast/contains-opaque.js.map +1 -0
- package/dist/ast/guards.d.ts +7 -0
- package/dist/ast/guards.d.ts.map +1 -0
- package/dist/ast/guards.js +23 -0
- package/dist/ast/guards.js.map +1 -0
- package/dist/ast/hash.d.ts +4 -0
- package/dist/ast/hash.d.ts.map +1 -0
- package/dist/ast/hash.js +67 -0
- package/dist/ast/hash.js.map +1 -0
- package/dist/ast/index.d.ts +6 -0
- package/dist/ast/index.d.ts.map +1 -0
- package/dist/ast/index.js +22 -0
- package/dist/ast/index.js.map +1 -0
- package/dist/ast/types.d.ts +28 -0
- package/dist/ast/types.d.ts.map +1 -0
- package/dist/ast/types.js +3 -0
- package/dist/ast/types.js.map +1 -0
- package/dist/ast/visitor.d.ts +3 -0
- package/dist/ast/visitor.d.ts.map +1 -0
- package/dist/ast/visitor.js +12 -0
- package/dist/ast/visitor.js.map +1 -0
- package/dist/common/types.d.ts +46 -0
- package/dist/common/types.d.ts.map +1 -0
- package/dist/common/types.js +3 -0
- package/dist/common/types.js.map +1 -0
- package/dist/compile/compile.d.ts +5 -0
- package/dist/compile/compile.d.ts.map +1 -0
- package/dist/compile/compile.js +69 -0
- package/dist/compile/compile.js.map +1 -0
- package/dist/compile-selector.d.ts +9 -0
- package/dist/compile-selector.d.ts.map +1 -0
- package/dist/compile-selector.js +14 -0
- package/dist/compile-selector.js.map +1 -0
- package/dist/conflict.d.ts +18 -0
- package/dist/conflict.d.ts.map +1 -0
- package/dist/conflict.js +30 -0
- package/dist/conflict.js.map +1 -0
- package/dist/core/canonicalize.d.ts +11 -0
- package/dist/core/canonicalize.d.ts.map +1 -0
- package/dist/core/canonicalize.js +104 -0
- package/dist/core/canonicalize.js.map +1 -0
- package/dist/core/conditions.d.ts +8 -0
- package/dist/core/conditions.d.ts.map +1 -0
- package/dist/core/conditions.js +282 -0
- package/dist/core/conditions.js.map +1 -0
- package/dist/core/conflicts-and-tighten.d.ts +15 -0
- package/dist/core/conflicts-and-tighten.d.ts.map +1 -0
- package/dist/core/conflicts-and-tighten.js +26 -0
- package/dist/core/conflicts-and-tighten.js.map +1 -0
- package/dist/core/conflicts.d.ts +14 -0
- package/dist/core/conflicts.d.ts.map +1 -0
- package/dist/core/conflicts.js +157 -0
- package/dist/core/conflicts.js.map +1 -0
- package/dist/core/constraint-propagation.d.ts +15 -0
- package/dist/core/constraint-propagation.d.ts.map +1 -0
- package/dist/core/constraint-propagation.js +93 -0
- package/dist/core/constraint-propagation.js.map +1 -0
- package/dist/core/field-condition-normalize.d.ts +22 -0
- package/dist/core/field-condition-normalize.d.ts.map +1 -0
- package/dist/core/field-condition-normalize.js +225 -0
- package/dist/core/field-condition-normalize.js.map +1 -0
- package/dist/core/index.d.ts +6 -0
- package/dist/core/index.d.ts.map +1 -0
- package/dist/core/index.js +14 -0
- package/dist/core/index.js.map +1 -0
- package/dist/core/normalize.d.ts +8 -0
- package/dist/core/normalize.d.ts.map +1 -0
- package/dist/core/normalize.js +44 -0
- package/dist/core/normalize.js.map +1 -0
- package/dist/core/operators.d.ts +11 -0
- package/dist/core/operators.d.ts.map +1 -0
- package/dist/core/operators.js +26 -0
- package/dist/core/operators.js.map +1 -0
- package/dist/core/predicate-merge.d.ts +9 -0
- package/dist/core/predicate-merge.d.ts.map +1 -0
- package/dist/core/predicate-merge.js +105 -0
- package/dist/core/predicate-merge.js.map +1 -0
- package/dist/core/predicateMerge.d.ts +17 -0
- package/dist/core/predicateMerge.d.ts.map +1 -0
- package/dist/core/predicateMerge.js +57 -0
- package/dist/core/predicateMerge.js.map +1 -0
- package/dist/core/simplify.d.ts +11 -0
- package/dist/core/simplify.d.ts.map +1 -0
- package/dist/core/simplify.js +128 -0
- package/dist/core/simplify.js.map +1 -0
- package/dist/core/stable-structural-key.d.ts +7 -0
- package/dist/core/stable-structural-key.d.ts.map +1 -0
- package/dist/core/stable-structural-key.js +71 -0
- package/dist/core/stable-structural-key.js.map +1 -0
- package/dist/core/utils.d.ts +16 -0
- package/dist/core/utils.d.ts.map +1 -0
- package/dist/core/utils.js +109 -0
- package/dist/core/utils.js.map +1 -0
- package/dist/flatten/flatten.d.ts +43 -0
- package/dist/flatten/flatten.d.ts.map +1 -0
- package/dist/flatten/flatten.js +68 -0
- package/dist/flatten/flatten.js.map +1 -0
- package/dist/flatten/index.d.ts +2 -0
- package/dist/flatten/index.d.ts.map +1 -0
- package/dist/flatten/index.js +10 -0
- package/dist/flatten/index.js.map +1 -0
- package/dist/flatten.d.ts +43 -0
- package/dist/flatten.d.ts.map +1 -0
- package/dist/flatten.js +68 -0
- package/dist/flatten.js.map +1 -0
- package/dist/index.d.ts +4 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +8 -0
- package/dist/index.js.map +1 -0
- package/dist/merge-ops.d.ts +33 -0
- package/dist/merge-ops.d.ts.map +1 -0
- package/dist/merge-ops.js +52 -0
- package/dist/merge-ops.js.map +1 -0
- package/dist/normalize-context.d.ts +16 -0
- package/dist/normalize-context.d.ts.map +1 -0
- package/dist/normalize-context.js +19 -0
- package/dist/normalize-context.js.map +1 -0
- package/dist/normalize.d.ts +6 -0
- package/dist/normalize.d.ts.map +1 -0
- package/dist/normalize.js +122 -0
- package/dist/normalize.js.map +1 -0
- package/dist/observe/diff.d.ts +7 -0
- package/dist/observe/diff.d.ts.map +1 -0
- package/dist/observe/diff.js +15 -0
- package/dist/observe/diff.js.map +1 -0
- package/dist/observe/level-boundary-hints.d.ts +11 -0
- package/dist/observe/level-boundary-hints.d.ts.map +1 -0
- package/dist/observe/level-boundary-hints.js +42 -0
- package/dist/observe/level-boundary-hints.js.map +1 -0
- package/dist/observe/level-preview-warning.d.ts +11 -0
- package/dist/observe/level-preview-warning.d.ts.map +1 -0
- package/dist/observe/level-preview-warning.js +42 -0
- package/dist/observe/level-preview-warning.js.map +1 -0
- package/dist/observe/metrics.d.ts +4 -0
- package/dist/observe/metrics.d.ts.map +1 -0
- package/dist/observe/metrics.js +30 -0
- package/dist/observe/metrics.js.map +1 -0
- package/dist/observe/warnings.d.ts +6 -0
- package/dist/observe/warnings.d.ts.map +1 -0
- package/dist/observe/warnings.js +24 -0
- package/dist/observe/warnings.js.map +1 -0
- package/dist/operations/compile.d.ts +7 -0
- package/dist/operations/compile.d.ts.map +1 -0
- package/dist/operations/compile.js +70 -0
- package/dist/operations/compile.js.map +1 -0
- package/dist/operations/conflicts-and-tighten.d.ts +29 -0
- package/dist/operations/conflicts-and-tighten.d.ts.map +1 -0
- package/dist/operations/conflicts-and-tighten.js +40 -0
- package/dist/operations/conflicts-and-tighten.js.map +1 -0
- package/dist/operations/conflicts.d.ts +28 -0
- package/dist/operations/conflicts.d.ts.map +1 -0
- package/dist/operations/conflicts.js +216 -0
- package/dist/operations/conflicts.js.map +1 -0
- package/dist/operations/conflictsAndTighten.d.ts +29 -0
- package/dist/operations/conflictsAndTighten.d.ts.map +1 -0
- package/dist/operations/conflictsAndTighten.js +40 -0
- package/dist/operations/conflictsAndTighten.js.map +1 -0
- package/dist/operations/merge.d.ts +18 -0
- package/dist/operations/merge.d.ts.map +1 -0
- package/dist/operations/merge.js +266 -0
- package/dist/operations/merge.js.map +1 -0
- package/dist/operations/parse.d.ts +20 -0
- package/dist/operations/parse.d.ts.map +1 -0
- package/dist/operations/parse.js +128 -0
- package/dist/operations/parse.js.map +1 -0
- package/dist/ops/compile-selector.d.ts +9 -0
- package/dist/ops/compile-selector.d.ts.map +1 -0
- package/dist/ops/compile-selector.js +14 -0
- package/dist/ops/compile-selector.js.map +1 -0
- package/dist/ops/index.d.ts +4 -0
- package/dist/ops/index.d.ts.map +1 -0
- package/dist/ops/index.js +14 -0
- package/dist/ops/index.js.map +1 -0
- package/dist/ops/merge-ops.d.ts +33 -0
- package/dist/ops/merge-ops.d.ts.map +1 -0
- package/dist/ops/merge-ops.js +52 -0
- package/dist/ops/merge-ops.js.map +1 -0
- package/dist/ops/parse-selector.d.ts +18 -0
- package/dist/ops/parse-selector.d.ts.map +1 -0
- package/dist/ops/parse-selector.js +29 -0
- package/dist/ops/parse-selector.js.map +1 -0
- package/dist/optimize.d.ts +18 -0
- package/dist/optimize.d.ts.map +1 -0
- package/dist/optimize.js +33 -0
- package/dist/optimize.js.map +1 -0
- package/dist/options/constants.d.ts +6 -0
- package/dist/options/constants.d.ts.map +1 -0
- package/dist/options/constants.js +72 -0
- package/dist/options/constants.js.map +1 -0
- package/dist/options/resolve.d.ts +3 -0
- package/dist/options/resolve.d.ts.map +1 -0
- package/dist/options/resolve.js +35 -0
- package/dist/options/resolve.js.map +1 -0
- package/dist/options/types.d.ts +2 -0
- package/dist/options/types.d.ts.map +1 -0
- package/dist/options/types.js +3 -0
- package/dist/options/types.js.map +1 -0
- package/dist/parse/parse.d.ts +4 -0
- package/dist/parse/parse.d.ts.map +1 -0
- package/dist/parse/parse.js +114 -0
- package/dist/parse/parse.js.map +1 -0
- package/dist/parse/plain-object.d.ts +2 -0
- package/dist/parse/plain-object.d.ts.map +1 -0
- package/dist/parse/plain-object.js +7 -0
- package/dist/parse/plain-object.js.map +1 -0
- package/dist/parse-selector.d.ts +18 -0
- package/dist/parse-selector.d.ts.map +1 -0
- package/dist/parse-selector.js +29 -0
- package/dist/parse-selector.js.map +1 -0
- package/dist/passes/canonicalize.d.ts +4 -0
- package/dist/passes/canonicalize.d.ts.map +1 -0
- package/dist/passes/canonicalize.js +40 -0
- package/dist/passes/canonicalize.js.map +1 -0
- package/dist/passes/normalize-predicate.d.ts +4 -0
- package/dist/passes/normalize-predicate.d.ts.map +1 -0
- package/dist/passes/normalize-predicate.js +57 -0
- package/dist/passes/normalize-predicate.js.map +1 -0
- package/dist/passes/normalize-shape.d.ts +4 -0
- package/dist/passes/normalize-shape.d.ts.map +1 -0
- package/dist/passes/normalize-shape.js +37 -0
- package/dist/passes/normalize-shape.js.map +1 -0
- package/dist/passes/simplify.d.ts +4 -0
- package/dist/passes/simplify.d.ts.map +1 -0
- package/dist/passes/simplify.js +49 -0
- package/dist/passes/simplify.js.map +1 -0
- package/dist/prune/conflict.d.ts +18 -0
- package/dist/prune/conflict.d.ts.map +1 -0
- package/dist/prune/conflict.js +30 -0
- package/dist/prune/conflict.js.map +1 -0
- package/dist/prune/index.d.ts +3 -0
- package/dist/prune/index.d.ts.map +1 -0
- package/dist/prune/index.js +9 -0
- package/dist/prune/index.js.map +1 -0
- package/dist/prune/prune.d.ts +11 -0
- package/dist/prune/prune.d.ts.map +1 -0
- package/dist/prune/prune.js +19 -0
- package/dist/prune/prune.js.map +1 -0
- package/dist/prune.d.ts +11 -0
- package/dist/prune.d.ts.map +1 -0
- package/dist/prune.js +19 -0
- package/dist/prune.js.map +1 -0
- package/dist/rewrite.d.ts +27 -0
- package/dist/rewrite.d.ts.map +1 -0
- package/dist/rewrite.js +62 -0
- package/dist/rewrite.js.map +1 -0
- package/dist/rules/experimental/hoist-common-predicates-from-or.d.ts +5 -0
- package/dist/rules/experimental/hoist-common-predicates-from-or.d.ts.map +1 -0
- package/dist/rules/experimental/hoist-common-predicates-from-or.js +153 -0
- package/dist/rules/experimental/hoist-common-predicates-from-or.js.map +1 -0
- package/dist/rules/logical/detect-common-predicates-in-or.d.ts +5 -0
- package/dist/rules/logical/detect-common-predicates-in-or.d.ts.map +1 -0
- package/dist/rules/logical/detect-common-predicates-in-or.js +82 -0
- package/dist/rules/logical/detect-common-predicates-in-or.js.map +1 -0
- package/dist/rules/predicate/collapse-contradictions.d.ts +5 -0
- package/dist/rules/predicate/collapse-contradictions.d.ts.map +1 -0
- package/dist/rules/predicate/collapse-contradictions.js +45 -0
- package/dist/rules/predicate/collapse-contradictions.js.map +1 -0
- package/dist/rules/predicate/dedupe-same-field-predicates.d.ts +5 -0
- package/dist/rules/predicate/dedupe-same-field-predicates.d.ts.map +1 -0
- package/dist/rules/predicate/dedupe-same-field-predicates.js +33 -0
- package/dist/rules/predicate/dedupe-same-field-predicates.js.map +1 -0
- package/dist/rules/predicate/merge-comparable-predicates.d.ts +5 -0
- package/dist/rules/predicate/merge-comparable-predicates.d.ts.map +1 -0
- package/dist/rules/predicate/merge-comparable-predicates.js +30 -0
- package/dist/rules/predicate/merge-comparable-predicates.js.map +1 -0
- package/dist/rules/predicate/merge-predicates-internal.d.ts +7 -0
- package/dist/rules/predicate/merge-predicates-internal.d.ts.map +1 -0
- package/dist/rules/predicate/merge-predicates-internal.js +186 -0
- package/dist/rules/predicate/merge-predicates-internal.js.map +1 -0
- package/dist/rules/shape/collapse-single-child-logical.d.ts +5 -0
- package/dist/rules/shape/collapse-single-child-logical.d.ts.map +1 -0
- package/dist/rules/shape/collapse-single-child-logical.js +20 -0
- package/dist/rules/shape/collapse-single-child-logical.js.map +1 -0
- package/dist/rules/shape/dedupe-logical-children.d.ts +6 -0
- package/dist/rules/shape/dedupe-logical-children.d.ts.map +1 -0
- package/dist/rules/shape/dedupe-logical-children.js +37 -0
- package/dist/rules/shape/dedupe-logical-children.js.map +1 -0
- package/dist/rules/shape/flatten-logical.d.ts +6 -0
- package/dist/rules/shape/flatten-logical.d.ts.map +1 -0
- package/dist/rules/shape/flatten-logical.js +37 -0
- package/dist/rules/shape/flatten-logical.js.map +1 -0
- package/dist/rules/shape/remove-empty-logical.d.ts +5 -0
- package/dist/rules/shape/remove-empty-logical.d.ts.map +1 -0
- package/dist/rules/shape/remove-empty-logical.js +21 -0
- package/dist/rules/shape/remove-empty-logical.js.map +1 -0
- package/dist/types.d.ts +70 -0
- package/dist/types.d.ts.map +1 -0
- package/dist/types.js +8 -0
- package/dist/types.js.map +1 -0
- package/dist/utils/compare-values.d.ts +6 -0
- package/dist/utils/compare-values.d.ts.map +1 -0
- package/dist/utils/compare-values.js +31 -0
- package/dist/utils/compare-values.js.map +1 -0
- package/dist/utils/deep-equal.d.ts +2 -0
- package/dist/utils/deep-equal.d.ts.map +1 -0
- package/dist/utils/deep-equal.js +30 -0
- package/dist/utils/deep-equal.js.map +1 -0
- package/dist/utils/is-opaque.d.ts +4 -0
- package/dist/utils/is-opaque.d.ts.map +1 -0
- package/dist/utils/is-opaque.js +42 -0
- package/dist/utils/is-opaque.js.map +1 -0
- package/dist/utils/stable-sort.d.ts +2 -0
- package/dist/utils/stable-sort.d.ts.map +1 -0
- package/dist/utils/stable-sort.js +16 -0
- package/dist/utils/stable-sort.js.map +1 -0
- package/package.json +51 -0
|
@@ -0,0 +1,282 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.tightenChildConditionsByParent = tightenChildConditionsByParent;
|
|
4
|
+
const utils_1 = require("./utils");
|
|
5
|
+
/** 与 `operators.ts` 分层一致:仅这些 op 参与父子 tighten;其余保留在子条件中。 */
|
|
6
|
+
const SUPPORTED_TIGHTEN_OPS = new Set([
|
|
7
|
+
"$eq",
|
|
8
|
+
"$ne",
|
|
9
|
+
"$gt",
|
|
10
|
+
"$gte",
|
|
11
|
+
"$lt",
|
|
12
|
+
"$lte",
|
|
13
|
+
"$nin",
|
|
14
|
+
"$exists",
|
|
15
|
+
]);
|
|
16
|
+
function toNum(value) {
|
|
17
|
+
return value instanceof Date ? value.getTime() : value;
|
|
18
|
+
}
|
|
19
|
+
function maxLowerBound(current, next) {
|
|
20
|
+
if (!current) {
|
|
21
|
+
return next;
|
|
22
|
+
}
|
|
23
|
+
const currentNum = toNum(current.value);
|
|
24
|
+
const nextNum = toNum(next.value);
|
|
25
|
+
if (nextNum > currentNum) {
|
|
26
|
+
return next;
|
|
27
|
+
}
|
|
28
|
+
if (nextNum < currentNum) {
|
|
29
|
+
return current;
|
|
30
|
+
}
|
|
31
|
+
return current.inclusive && !next.inclusive ? next : current;
|
|
32
|
+
}
|
|
33
|
+
function minUpperBound(current, next) {
|
|
34
|
+
if (!current) {
|
|
35
|
+
return next;
|
|
36
|
+
}
|
|
37
|
+
const currentNum = toNum(current.value);
|
|
38
|
+
const nextNum = toNum(next.value);
|
|
39
|
+
if (nextNum < currentNum) {
|
|
40
|
+
return next;
|
|
41
|
+
}
|
|
42
|
+
if (nextNum > currentNum) {
|
|
43
|
+
return current;
|
|
44
|
+
}
|
|
45
|
+
return current.inclusive && !next.inclusive ? next : current;
|
|
46
|
+
}
|
|
47
|
+
function boundsImpossible(lower, upper) {
|
|
48
|
+
if (!lower || !upper) {
|
|
49
|
+
return false;
|
|
50
|
+
}
|
|
51
|
+
const lowerNum = toNum(lower.value);
|
|
52
|
+
const upperNum = toNum(upper.value);
|
|
53
|
+
if (lowerNum > upperNum) {
|
|
54
|
+
return true;
|
|
55
|
+
}
|
|
56
|
+
if (lowerNum < upperNum) {
|
|
57
|
+
return false;
|
|
58
|
+
}
|
|
59
|
+
return !(lower.inclusive && upper.inclusive);
|
|
60
|
+
}
|
|
61
|
+
function uniqueByValue(items) {
|
|
62
|
+
const result = [];
|
|
63
|
+
for (const item of items) {
|
|
64
|
+
if (!result.some((existing) => (0, utils_1.areValuesEqual)(existing, item))) {
|
|
65
|
+
result.push(item);
|
|
66
|
+
}
|
|
67
|
+
}
|
|
68
|
+
return result;
|
|
69
|
+
}
|
|
70
|
+
function intersectByValue(left, right) {
|
|
71
|
+
return left.filter((item) => right.some((candidate) => (0, utils_1.areValuesEqual)(item, candidate)));
|
|
72
|
+
}
|
|
73
|
+
function inSetFromConditions(conditions) {
|
|
74
|
+
let set;
|
|
75
|
+
for (const condition of conditions) {
|
|
76
|
+
if (condition.op !== "$in") {
|
|
77
|
+
continue;
|
|
78
|
+
}
|
|
79
|
+
const array = Array.isArray(condition.value) ? condition.value : [condition.value];
|
|
80
|
+
set = set ? intersectByValue(set, array) : uniqueByValue(array);
|
|
81
|
+
}
|
|
82
|
+
return set;
|
|
83
|
+
}
|
|
84
|
+
function valueSetEqual(left, right) {
|
|
85
|
+
if (left.length !== right.length) {
|
|
86
|
+
return false;
|
|
87
|
+
}
|
|
88
|
+
return left.every((value) => right.some((candidate) => (0, utils_1.areValuesEqual)(value, candidate)));
|
|
89
|
+
}
|
|
90
|
+
function tightenChildConditionsByParent(parent, child) {
|
|
91
|
+
const parentSupported = parent.filter((condition) => SUPPORTED_TIGHTEN_OPS.has(condition.op));
|
|
92
|
+
const childSupported = child.filter((condition) => SUPPORTED_TIGHTEN_OPS.has(condition.op));
|
|
93
|
+
const childUnsupported = child.filter((condition) => !SUPPORTED_TIGHTEN_OPS.has(condition.op));
|
|
94
|
+
const parentInSet = inSetFromConditions(parentSupported);
|
|
95
|
+
const effective = [...parentSupported, ...childSupported];
|
|
96
|
+
let eq;
|
|
97
|
+
const neList = [];
|
|
98
|
+
let inSet;
|
|
99
|
+
const ninSet = [];
|
|
100
|
+
let exists;
|
|
101
|
+
let lower;
|
|
102
|
+
let upper;
|
|
103
|
+
for (const condition of effective) {
|
|
104
|
+
switch (condition.op) {
|
|
105
|
+
case "$eq":
|
|
106
|
+
eq = condition.value;
|
|
107
|
+
break;
|
|
108
|
+
case "$ne":
|
|
109
|
+
neList.push(condition.value);
|
|
110
|
+
break;
|
|
111
|
+
case "$in": {
|
|
112
|
+
const array = Array.isArray(condition.value)
|
|
113
|
+
? condition.value
|
|
114
|
+
: [condition.value];
|
|
115
|
+
inSet = inSet ? intersectByValue(inSet, array) : uniqueByValue(array);
|
|
116
|
+
break;
|
|
117
|
+
}
|
|
118
|
+
case "$nin": {
|
|
119
|
+
const array = Array.isArray(condition.value)
|
|
120
|
+
? condition.value
|
|
121
|
+
: [condition.value];
|
|
122
|
+
for (const value of array) {
|
|
123
|
+
ninSet.push(value);
|
|
124
|
+
}
|
|
125
|
+
break;
|
|
126
|
+
}
|
|
127
|
+
case "$exists":
|
|
128
|
+
exists = Boolean(condition.value);
|
|
129
|
+
break;
|
|
130
|
+
case "$gt":
|
|
131
|
+
if (typeof condition.value === "number" || condition.value instanceof Date) {
|
|
132
|
+
lower = maxLowerBound(lower, {
|
|
133
|
+
value: condition.value,
|
|
134
|
+
inclusive: false,
|
|
135
|
+
});
|
|
136
|
+
}
|
|
137
|
+
break;
|
|
138
|
+
case "$gte":
|
|
139
|
+
if (typeof condition.value === "number" || condition.value instanceof Date) {
|
|
140
|
+
lower = maxLowerBound(lower, {
|
|
141
|
+
value: condition.value,
|
|
142
|
+
inclusive: true,
|
|
143
|
+
});
|
|
144
|
+
}
|
|
145
|
+
break;
|
|
146
|
+
case "$lt":
|
|
147
|
+
if (typeof condition.value === "number" || condition.value instanceof Date) {
|
|
148
|
+
upper = minUpperBound(upper, {
|
|
149
|
+
value: condition.value,
|
|
150
|
+
inclusive: false,
|
|
151
|
+
});
|
|
152
|
+
}
|
|
153
|
+
break;
|
|
154
|
+
case "$lte":
|
|
155
|
+
if (typeof condition.value === "number" || condition.value instanceof Date) {
|
|
156
|
+
upper = minUpperBound(upper, {
|
|
157
|
+
value: condition.value,
|
|
158
|
+
inclusive: true,
|
|
159
|
+
});
|
|
160
|
+
}
|
|
161
|
+
break;
|
|
162
|
+
}
|
|
163
|
+
}
|
|
164
|
+
const uniqNin = uniqueByValue(ninSet);
|
|
165
|
+
const uniqNe = uniqueByValue(neList);
|
|
166
|
+
if (exists === false) {
|
|
167
|
+
if (eq !== undefined) {
|
|
168
|
+
return { conditions: child, impossible: true, changed: false };
|
|
169
|
+
}
|
|
170
|
+
if (inSet && inSet.length > 0) {
|
|
171
|
+
return { conditions: child, impossible: true, changed: false };
|
|
172
|
+
}
|
|
173
|
+
if (lower || upper) {
|
|
174
|
+
return { conditions: child, impossible: true, changed: false };
|
|
175
|
+
}
|
|
176
|
+
}
|
|
177
|
+
if (boundsImpossible(lower, upper)) {
|
|
178
|
+
return { conditions: child, impossible: true, changed: false };
|
|
179
|
+
}
|
|
180
|
+
if (eq !== undefined) {
|
|
181
|
+
if (exists === true && eq === null) {
|
|
182
|
+
return { conditions: child, impossible: true, changed: false };
|
|
183
|
+
}
|
|
184
|
+
if (inSet && !inSet.some((value) => (0, utils_1.areValuesEqual)(value, eq))) {
|
|
185
|
+
return { conditions: child, impossible: true, changed: false };
|
|
186
|
+
}
|
|
187
|
+
if (uniqNin.some((value) => (0, utils_1.areValuesEqual)(value, eq))) {
|
|
188
|
+
return { conditions: child, impossible: true, changed: false };
|
|
189
|
+
}
|
|
190
|
+
if (uniqNe.some((value) => (0, utils_1.areValuesEqual)(value, eq))) {
|
|
191
|
+
return { conditions: child, impossible: true, changed: false };
|
|
192
|
+
}
|
|
193
|
+
if (lower) {
|
|
194
|
+
const eqNum = typeof eq === "number" || eq instanceof Date
|
|
195
|
+
? toNum(eq)
|
|
196
|
+
: undefined;
|
|
197
|
+
if (eqNum !== undefined) {
|
|
198
|
+
const lowerNum = toNum(lower.value);
|
|
199
|
+
if (lower.inclusive ? eqNum < lowerNum : eqNum <= lowerNum) {
|
|
200
|
+
return { conditions: child, impossible: true, changed: false };
|
|
201
|
+
}
|
|
202
|
+
}
|
|
203
|
+
}
|
|
204
|
+
if (upper) {
|
|
205
|
+
const eqNum = typeof eq === "number" || eq instanceof Date
|
|
206
|
+
? toNum(eq)
|
|
207
|
+
: undefined;
|
|
208
|
+
if (eqNum !== undefined) {
|
|
209
|
+
const upperNum = toNum(upper.value);
|
|
210
|
+
if (upper.inclusive ? eqNum > upperNum : eqNum >= upperNum) {
|
|
211
|
+
return { conditions: child, impossible: true, changed: false };
|
|
212
|
+
}
|
|
213
|
+
}
|
|
214
|
+
}
|
|
215
|
+
}
|
|
216
|
+
const childHasIn = childSupported.some((condition) => condition.op === "$in");
|
|
217
|
+
const childHasBounds = childSupported.some((condition) => ["$gt", "$gte", "$lt", "$lte"].includes(condition.op));
|
|
218
|
+
const childHasExists = childSupported.some((condition) => condition.op === "$exists");
|
|
219
|
+
const childHasEq = childSupported.some((condition) => condition.op === "$eq");
|
|
220
|
+
const childHasNin = childSupported.some((condition) => condition.op === "$nin" || condition.op === "$ne");
|
|
221
|
+
const outSupported = [];
|
|
222
|
+
const effectiveIsSingleValue = eq !== undefined && (!inSet || inSet.some((value) => (0, utils_1.areValuesEqual)(value, eq)));
|
|
223
|
+
const childContributedEq = (childHasEq && eq !== undefined) || (childHasIn && effectiveIsSingleValue);
|
|
224
|
+
if (childContributedEq && eq !== undefined) {
|
|
225
|
+
outSupported.push({ op: "$eq", value: eq });
|
|
226
|
+
}
|
|
227
|
+
if (childHasExists && exists !== undefined) {
|
|
228
|
+
outSupported.push({ op: "$exists", value: exists });
|
|
229
|
+
}
|
|
230
|
+
if (childHasIn) {
|
|
231
|
+
const inValue = eq !== undefined ? [eq] : inSet;
|
|
232
|
+
const redundantWithParent = inValue !== undefined &&
|
|
233
|
+
parentInSet !== undefined &&
|
|
234
|
+
valueSetEqual(inValue, parentInSet);
|
|
235
|
+
const redundantWithEq = eq !== undefined &&
|
|
236
|
+
inValue !== undefined &&
|
|
237
|
+
inValue.length === 1 &&
|
|
238
|
+
(0, utils_1.areValuesEqual)(inValue[0], eq);
|
|
239
|
+
if (inValue !== undefined && !redundantWithParent && !redundantWithEq) {
|
|
240
|
+
outSupported.push({ op: "$in", value: inValue });
|
|
241
|
+
}
|
|
242
|
+
}
|
|
243
|
+
if (childHasBounds) {
|
|
244
|
+
if (lower) {
|
|
245
|
+
outSupported.push({
|
|
246
|
+
op: lower.inclusive ? "$gte" : "$gt",
|
|
247
|
+
value: lower.value,
|
|
248
|
+
});
|
|
249
|
+
}
|
|
250
|
+
if (upper) {
|
|
251
|
+
outSupported.push({
|
|
252
|
+
op: upper.inclusive ? "$lte" : "$lt",
|
|
253
|
+
value: upper.value,
|
|
254
|
+
});
|
|
255
|
+
}
|
|
256
|
+
}
|
|
257
|
+
if (childHasNin) {
|
|
258
|
+
const mergedNin = uniqueByValue([...uniqNin, ...uniqNe]);
|
|
259
|
+
if (childSupported.some((condition) => condition.op === "$nin") || mergedNin.length > 1) {
|
|
260
|
+
if (mergedNin.length > 0) {
|
|
261
|
+
outSupported.push({ op: "$nin", value: mergedNin });
|
|
262
|
+
}
|
|
263
|
+
}
|
|
264
|
+
else if (mergedNin.length === 1) {
|
|
265
|
+
outSupported.push({ op: "$ne", value: mergedNin[0] });
|
|
266
|
+
}
|
|
267
|
+
}
|
|
268
|
+
const nextConditions = [...outSupported, ...childUnsupported];
|
|
269
|
+
const changed = nextConditions.length !== child.length ||
|
|
270
|
+
nextConditions.some((condition, index) => {
|
|
271
|
+
const original = child[index];
|
|
272
|
+
if (!original) {
|
|
273
|
+
return true;
|
|
274
|
+
}
|
|
275
|
+
if (original.op !== condition.op) {
|
|
276
|
+
return true;
|
|
277
|
+
}
|
|
278
|
+
return !(0, utils_1.areValuesEqual)(original.value, condition.value);
|
|
279
|
+
});
|
|
280
|
+
return { conditions: nextConditions, impossible: false, changed };
|
|
281
|
+
}
|
|
282
|
+
//# sourceMappingURL=conditions.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"conditions.js","sourceRoot":"","sources":["../../src/core/conditions.ts"],"names":[],"mappings":";;AAyGA,wEA2OC;AAnVD,mCAAyC;AAIzC,2DAA2D;AAC3D,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAAC;IAClC,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;CACH,CAAC,CAAC;AAEZ,SAAS,KAAK,CAAC,KAAoB;IAC/B,OAAO,KAAK,YAAY,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;AAC3D,CAAC;AAED,SAAS,aAAa,CAAC,OAA0B,EAAE,IAAW;IAC1D,IAAI,CAAC,OAAO,EAAE,CAAC;QACX,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACvB,OAAO,OAAO,CAAC;IACnB,CAAC;IACD,OAAO,OAAO,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;AACjE,CAAC;AAED,SAAS,aAAa,CAAC,OAA0B,EAAE,IAAW;IAC1D,IAAI,CAAC,OAAO,EAAE,CAAC;QACX,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACvB,OAAO,OAAO,CAAC;IACnB,CAAC;IACD,OAAO,OAAO,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;AACjE,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAwB,EAAE,KAAwB;IACxE,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,QAAQ,GAAG,QAAQ,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,IAAI,QAAQ,GAAG,QAAQ,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,OAAO,CAAC,CAAC,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,aAAa,CAAC,KAAgB;IACnC,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAe,EAAE,KAAgB;IACvD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED,SAAS,mBAAmB,CAAC,UAA4B;IACrD,IAAI,GAA0B,CAAC;IAC/B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACjC,IAAI,SAAS,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,SAAS,CAAC,KAAmB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAClG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED,SAAS,aAAa,CAAC,IAAe,EAAE,KAAgB;IACpD,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;AAC9F,CAAC;AAQD,SAAgB,8BAA8B,CAC1C,MAAwB,EACxB,KAAuB;IAEvB,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAChD,qBAAqB,CAAC,GAAG,CACrB,SAAS,CAAC,EAAqE,CAClF,CACJ,CAAC;IACF,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAC9C,qBAAqB,CAAC,GAAG,CACrB,SAAS,CAAC,EAAqE,CAClF,CACJ,CAAC;IACF,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,CACjC,CAAC,SAAS,EAAE,EAAE,CACV,CAAC,qBAAqB,CAAC,GAAG,CACtB,SAAS,CAAC,EAAqE,CAClF,CACR,CAAC;IAEF,MAAM,WAAW,GAAG,mBAAmB,CAAC,eAAe,CAAC,CAAC;IAEzD,MAAM,SAAS,GAAG,CAAC,GAAG,eAAe,EAAE,GAAG,cAAc,CAAC,CAAC;IAE1D,IAAI,EAAuB,CAAC;IAC5B,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,IAAI,KAA4B,CAAC;IACjC,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,IAAI,MAA2B,CAAC;IAChC,IAAI,KAAwB,CAAC;IAC7B,IAAI,KAAwB,CAAC;IAE7B,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE,CAAC;QAChC,QAAQ,SAAS,CAAC,EAAE,EAAE,CAAC;YACnB,KAAK,KAAK;gBACN,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC;gBACrB,MAAM;YACV,KAAK,KAAK;gBACN,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBAC7B,MAAM;YACV,KAAK,KAAK,CAAC,CAAC,CAAC;gBACT,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC;oBACxC,CAAC,CAAE,SAAS,CAAC,KAAmB;oBAChC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACxB,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBACtE,MAAM;YACV,CAAC;YACD,KAAK,MAAM,CAAC,CAAC,CAAC;gBACV,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC;oBACxC,CAAC,CAAE,SAAS,CAAC,KAAmB;oBAChC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACxB,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;oBACxB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;gBACD,MAAM;YACV,CAAC;YACD,KAAK,SAAS;gBACV,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBAClC,MAAM;YACV,KAAK,KAAK;gBACN,IAAI,OAAO,SAAS,CAAC,KAAK,KAAK,QAAQ,IAAI,SAAS,CAAC,KAAK,YAAY,IAAI,EAAE,CAAC;oBACzE,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE;wBACzB,KAAK,EAAE,SAAS,CAAC,KAAsB;wBACvC,SAAS,EAAE,KAAK;qBACnB,CAAC,CAAC;gBACP,CAAC;gBACD,MAAM;YACV,KAAK,MAAM;gBACP,IAAI,OAAO,SAAS,CAAC,KAAK,KAAK,QAAQ,IAAI,SAAS,CAAC,KAAK,YAAY,IAAI,EAAE,CAAC;oBACzE,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE;wBACzB,KAAK,EAAE,SAAS,CAAC,KAAsB;wBACvC,SAAS,EAAE,IAAI;qBAClB,CAAC,CAAC;gBACP,CAAC;gBACD,MAAM;YACV,KAAK,KAAK;gBACN,IAAI,OAAO,SAAS,CAAC,KAAK,KAAK,QAAQ,IAAI,SAAS,CAAC,KAAK,YAAY,IAAI,EAAE,CAAC;oBACzE,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE;wBACzB,KAAK,EAAE,SAAS,CAAC,KAAsB;wBACvC,SAAS,EAAE,KAAK;qBACnB,CAAC,CAAC;gBACP,CAAC;gBACD,MAAM;YACV,KAAK,MAAM;gBACP,IAAI,OAAO,SAAS,CAAC,KAAK,KAAK,QAAQ,IAAI,SAAS,CAAC,KAAK,YAAY,IAAI,EAAE,CAAC;oBACzE,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE;wBACzB,KAAK,EAAE,SAAS,CAAC,KAAsB;wBACvC,SAAS,EAAE,IAAI;qBAClB,CAAC,CAAC;gBACP,CAAC;gBACD,MAAM;QACd,CAAC;IACL,CAAC;IAED,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAErC,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;QACnB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACnB,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACjB,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnE,CAAC;IACL,CAAC;IAED,IAAI,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACnE,CAAC;IAED,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACnB,IAAI,MAAM,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YACjC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;YAC7D,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;YACrD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;YACpD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,KAAK,EAAE,CAAC;YACR,MAAM,KAAK,GACP,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,YAAY,IAAI;gBACxC,CAAC,CAAC,KAAK,CAAC,EAAmB,CAAC;gBAC5B,CAAC,CAAC,SAAS,CAAC;YACpB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACpC,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;oBACzD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;gBACnE,CAAC;YACL,CAAC;QACL,CAAC;QACD,IAAI,KAAK,EAAE,CAAC;YACR,MAAM,KAAK,GACP,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,YAAY,IAAI;gBACxC,CAAC,CAAC,KAAK,CAAC,EAAmB,CAAC;gBAC5B,CAAC,CAAC,SAAS,CAAC;YACpB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACpC,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;oBACzD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;gBACnE,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC;IAC9E,MAAM,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CACrD,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CACxD,CAAC;IACF,MAAM,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;IACtF,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC;IAC9E,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CACnC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,MAAM,IAAI,SAAS,CAAC,EAAE,KAAK,KAAK,CACnE,CAAC;IAEF,MAAM,YAAY,GAAqB,EAAE,CAAC;IAE1C,MAAM,sBAAsB,GACxB,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACrF,MAAM,kBAAkB,GACpB,CAAC,UAAU,IAAI,EAAE,KAAK,SAAS,CAAC,IAAI,CAAC,UAAU,IAAI,sBAAsB,CAAC,CAAC;IAC/E,IAAI,kBAAkB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACzC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,cAAc,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,IAAI,UAAU,EAAE,CAAC;QACb,MAAM,OAAO,GAA0B,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACvE,MAAM,mBAAmB,GACrB,OAAO,KAAK,SAAS;YACrB,WAAW,KAAK,SAAS;YACzB,aAAa,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACxC,MAAM,eAAe,GACjB,EAAE,KAAK,SAAS;YAChB,OAAO,KAAK,SAAS;YACrB,OAAO,CAAC,MAAM,KAAK,CAAC;YACpB,IAAA,sBAAc,EAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnC,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,mBAAmB,IAAI,CAAC,eAAe,EAAE,CAAC;YACpE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACrD,CAAC;IACL,CAAC;IAED,IAAI,cAAc,EAAE,CAAC;QACjB,IAAI,KAAK,EAAE,CAAC;YACR,YAAY,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK;gBACpC,KAAK,EAAE,KAAK,CAAC,KAAK;aACrB,CAAC,CAAC;QACP,CAAC;QACD,IAAI,KAAK,EAAE,CAAC;YACR,YAAY,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK;gBACpC,KAAK,EAAE,KAAK,CAAC,KAAK;aACrB,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IAED,IAAI,WAAW,EAAE,CAAC;QACd,MAAM,SAAS,GAAG,aAAa,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACzD,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;YACxD,CAAC;QACL,CAAC;aAAM,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1D,CAAC;IACL,CAAC;IAED,MAAM,cAAc,GAAG,CAAC,GAAG,YAAY,EAAE,GAAG,gBAAgB,CAAC,CAAC;IAE9D,MAAM,OAAO,GACT,cAAc,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;QACtC,cAAc,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;YACrC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACZ,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,IAAI,QAAQ,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,OAAO,CAAC,IAAA,sBAAc,EAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;IAEP,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AACtE,CAAC"}
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
import type { FieldCondition } from "../ast/types";
|
|
2
|
+
import type { TightenResult } from "./conditions";
|
|
3
|
+
/**
|
|
4
|
+
* 判断同一字段上的一组条件是否自相冲突(不可满足)。
|
|
5
|
+
*/
|
|
6
|
+
export declare function isConditionsImpossible(conditions: FieldCondition[]): boolean;
|
|
7
|
+
/**
|
|
8
|
+
* 判断父级条件与子级条件是否冲突。
|
|
9
|
+
*/
|
|
10
|
+
export declare function isParentChildImpossible(parent: FieldCondition[], child: FieldCondition[]): boolean;
|
|
11
|
+
/**
|
|
12
|
+
* 在父级条件约束下收紧子级条件(取交集),并判断合并后是否不可能满足。
|
|
13
|
+
*/
|
|
14
|
+
export declare function tightenWithParent(parent: FieldCondition[], child: FieldCondition[]): TightenResult;
|
|
15
|
+
//# sourceMappingURL=conflicts-and-tighten.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"conflicts-and-tighten.d.ts","sourceRoot":"","sources":["../../src/core/conflicts-and-tighten.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAIlD;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,OAAO,CAE5E;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACnC,MAAM,EAAE,cAAc,EAAE,EACxB,KAAK,EAAE,cAAc,EAAE,GACxB,OAAO,CAET;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC7B,MAAM,EAAE,cAAc,EAAE,EACxB,KAAK,EAAE,cAAc,EAAE,GACxB,aAAa,CAEf"}
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.isConditionsImpossible = isConditionsImpossible;
|
|
4
|
+
exports.isParentChildImpossible = isParentChildImpossible;
|
|
5
|
+
exports.tightenWithParent = tightenWithParent;
|
|
6
|
+
const conditions_1 = require("./conditions");
|
|
7
|
+
const conflicts_1 = require("./conflicts");
|
|
8
|
+
/**
|
|
9
|
+
* 判断同一字段上的一组条件是否自相冲突(不可满足)。
|
|
10
|
+
*/
|
|
11
|
+
function isConditionsImpossible(conditions) {
|
|
12
|
+
return (0, conflicts_1.hasConditionConflict)(conditions, conditions);
|
|
13
|
+
}
|
|
14
|
+
/**
|
|
15
|
+
* 判断父级条件与子级条件是否冲突。
|
|
16
|
+
*/
|
|
17
|
+
function isParentChildImpossible(parent, child) {
|
|
18
|
+
return (0, conflicts_1.hasConditionConflict)(parent, child);
|
|
19
|
+
}
|
|
20
|
+
/**
|
|
21
|
+
* 在父级条件约束下收紧子级条件(取交集),并判断合并后是否不可能满足。
|
|
22
|
+
*/
|
|
23
|
+
function tightenWithParent(parent, child) {
|
|
24
|
+
return (0, conditions_1.tightenChildConditionsByParent)(parent, child);
|
|
25
|
+
}
|
|
26
|
+
//# sourceMappingURL=conflicts-and-tighten.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"conflicts-and-tighten.js","sourceRoot":"","sources":["../../src/core/conflicts-and-tighten.ts"],"names":[],"mappings":";;AAQA,wDAEC;AAKD,0DAKC;AAKD,8CAKC;AA5BD,6CAA8D;AAC9D,2CAAmD;AAEnD;;GAEG;AACH,SAAgB,sBAAsB,CAAC,UAA4B;IAC/D,OAAO,IAAA,gCAAoB,EAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,SAAgB,uBAAuB,CACnC,MAAwB,EACxB,KAAuB;IAEvB,OAAO,IAAA,gCAAoB,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAC7B,MAAwB,EACxB,KAAuB;IAEvB,OAAO,IAAA,2CAA8B,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACzD,CAAC"}
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
import type { FieldCondition } from "../ast/types";
|
|
2
|
+
/**
|
|
3
|
+
* 判断两条同字段条件是否互斥。
|
|
4
|
+
*/
|
|
5
|
+
export declare function twoConditionsConflict(a: FieldCondition, b: FieldCondition): boolean;
|
|
6
|
+
/**
|
|
7
|
+
* 判断同一字段上父条件与子条件是否冲突。
|
|
8
|
+
*
|
|
9
|
+
* @param parent - 父级该字段的条件列表
|
|
10
|
+
* @param child - 当前节点的条件列表
|
|
11
|
+
* @returns 若存在互斥则为 true
|
|
12
|
+
*/
|
|
13
|
+
export declare function hasConditionConflict(parent: FieldCondition[], child: FieldCondition[]): boolean;
|
|
14
|
+
//# sourceMappingURL=conflicts.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"conflicts.d.ts","sourceRoot":"","sources":["../../src/core/conflicts.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAWnD;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,cAAc,GAAG,OAAO,CA2InF;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE,GAAG,OAAO,CAS/F"}
|
|
@@ -0,0 +1,157 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.twoConditionsConflict = twoConditionsConflict;
|
|
4
|
+
exports.hasConditionConflict = hasConditionConflict;
|
|
5
|
+
const utils_1 = require("./utils");
|
|
6
|
+
function isNumberOrDate(v) {
|
|
7
|
+
return typeof v === "number" || v instanceof Date;
|
|
8
|
+
}
|
|
9
|
+
function toNum(v) {
|
|
10
|
+
return v instanceof Date ? v.getTime() : v;
|
|
11
|
+
}
|
|
12
|
+
/**
|
|
13
|
+
* 判断两条同字段条件是否互斥。
|
|
14
|
+
*/
|
|
15
|
+
function twoConditionsConflict(a, b) {
|
|
16
|
+
if (a.op === "$eq" && b.op === "$eq") {
|
|
17
|
+
return !(0, utils_1.areValuesEqual)(a.value, b.value);
|
|
18
|
+
}
|
|
19
|
+
if (a.op === "$eq" || b.op === "$eq") {
|
|
20
|
+
const eq = a.op === "$eq" ? a : b;
|
|
21
|
+
const other = a.op === "$eq" ? b : a;
|
|
22
|
+
const v = eq.value;
|
|
23
|
+
if (other.op === "$gt" || other.op === "$gte" || other.op === "$lt" || other.op === "$lte") {
|
|
24
|
+
if (!isNumberOrDate(v) || !isNumberOrDate(other.value)) {
|
|
25
|
+
return false;
|
|
26
|
+
}
|
|
27
|
+
const cv = other.value;
|
|
28
|
+
const nv = toNum(v);
|
|
29
|
+
const nc = toNum(cv);
|
|
30
|
+
if (other.op === "$gt") {
|
|
31
|
+
return nv <= nc;
|
|
32
|
+
}
|
|
33
|
+
if (other.op === "$gte") {
|
|
34
|
+
return nv < nc;
|
|
35
|
+
}
|
|
36
|
+
if (other.op === "$lt") {
|
|
37
|
+
return nv >= nc;
|
|
38
|
+
}
|
|
39
|
+
if (other.op === "$lte") {
|
|
40
|
+
return nv > nc;
|
|
41
|
+
}
|
|
42
|
+
}
|
|
43
|
+
if (other.op === "$in" || other.op === "$nin") {
|
|
44
|
+
const arr = Array.isArray(other.value) ? other.value : [other.value];
|
|
45
|
+
const found = arr.some((x) => (0, utils_1.areValuesEqual)(v, x));
|
|
46
|
+
if (other.op === "$in") {
|
|
47
|
+
return !found;
|
|
48
|
+
}
|
|
49
|
+
if (other.op === "$nin") {
|
|
50
|
+
return found;
|
|
51
|
+
}
|
|
52
|
+
}
|
|
53
|
+
if (other.op === "$exists") {
|
|
54
|
+
const exists = Boolean(other.value);
|
|
55
|
+
if (v === undefined) {
|
|
56
|
+
return exists === true;
|
|
57
|
+
}
|
|
58
|
+
if (v === null) {
|
|
59
|
+
return false;
|
|
60
|
+
}
|
|
61
|
+
if (exists === false) {
|
|
62
|
+
return true;
|
|
63
|
+
}
|
|
64
|
+
return false;
|
|
65
|
+
}
|
|
66
|
+
if (other.op === "$ne") {
|
|
67
|
+
return (0, utils_1.areValuesEqual)(v, other.value);
|
|
68
|
+
}
|
|
69
|
+
}
|
|
70
|
+
const cmpOps = ["$gt", "$gte", "$lt", "$lte"];
|
|
71
|
+
if (cmpOps.includes(a.op) && cmpOps.includes(b.op)) {
|
|
72
|
+
if (!isNumberOrDate(a.value) || !isNumberOrDate(b.value)) {
|
|
73
|
+
return false;
|
|
74
|
+
}
|
|
75
|
+
const na = toNum(a.value);
|
|
76
|
+
const nb = toNum(b.value);
|
|
77
|
+
const aop = a.op;
|
|
78
|
+
const bop = b.op;
|
|
79
|
+
if ((aop === "$gt" || aop === "$gte") && (bop === "$lt" || bop === "$lte")) {
|
|
80
|
+
return na > nb || (na === nb && (aop === "$gt" || bop === "$lt"));
|
|
81
|
+
}
|
|
82
|
+
if ((aop === "$lt" || aop === "$lte") && (bop === "$gt" || bop === "$gte")) {
|
|
83
|
+
return nb > na || (nb === na && (bop === "$gt" || aop === "$lt"));
|
|
84
|
+
}
|
|
85
|
+
}
|
|
86
|
+
if (a.op === "$exists" && a.value === false) {
|
|
87
|
+
if ((b.op === "$eq" && b.value !== null) ||
|
|
88
|
+
b.op === "$in" ||
|
|
89
|
+
b.op === "$gt" ||
|
|
90
|
+
b.op === "$gte" ||
|
|
91
|
+
b.op === "$lt" ||
|
|
92
|
+
b.op === "$lte") {
|
|
93
|
+
return true;
|
|
94
|
+
}
|
|
95
|
+
}
|
|
96
|
+
if (b.op === "$exists" && b.value === false) {
|
|
97
|
+
if ((a.op === "$eq" && a.value !== null) ||
|
|
98
|
+
a.op === "$in" ||
|
|
99
|
+
a.op === "$gt" ||
|
|
100
|
+
a.op === "$gte" ||
|
|
101
|
+
a.op === "$lt" ||
|
|
102
|
+
a.op === "$lte") {
|
|
103
|
+
return true;
|
|
104
|
+
}
|
|
105
|
+
}
|
|
106
|
+
if ((a.op === "$in" && b.op === "$nin") || (a.op === "$nin" && b.op === "$in")) {
|
|
107
|
+
const inArr = (a.op === "$in" ? a.value : b.value);
|
|
108
|
+
const ninArr = (a.op === "$nin" ? a.value : b.value);
|
|
109
|
+
const allInBanned = inArr.length > 0 && inArr.every((x) => ninArr.some((y) => (0, utils_1.areValuesEqual)(x, y)));
|
|
110
|
+
return allInBanned;
|
|
111
|
+
}
|
|
112
|
+
if (a.op === "$exists" && b.op === "$exists") {
|
|
113
|
+
return a.value !== b.value;
|
|
114
|
+
}
|
|
115
|
+
if (a.op === "$ne" && b.op === "$exists") {
|
|
116
|
+
if (b.value === false && a.value === null) {
|
|
117
|
+
return true;
|
|
118
|
+
}
|
|
119
|
+
return false;
|
|
120
|
+
}
|
|
121
|
+
if (b.op === "$ne" && a.op === "$exists") {
|
|
122
|
+
if (a.value === false && b.value === null) {
|
|
123
|
+
return true;
|
|
124
|
+
}
|
|
125
|
+
return false;
|
|
126
|
+
}
|
|
127
|
+
if ((a.op === "$ne" && b.op === "$in") ||
|
|
128
|
+
(a.op === "$in" && b.op === "$ne")) {
|
|
129
|
+
const ne = a.op === "$ne" ? a : b;
|
|
130
|
+
const inp = a.op === "$in" ? a : b;
|
|
131
|
+
const inArr = Array.isArray(inp.value) ? inp.value : [inp.value];
|
|
132
|
+
if (inArr.length === 0) {
|
|
133
|
+
return false;
|
|
134
|
+
}
|
|
135
|
+
const allEqualExcluded = inArr.every((x) => (0, utils_1.areValuesEqual)(x, ne.value));
|
|
136
|
+
return allEqualExcluded;
|
|
137
|
+
}
|
|
138
|
+
return false;
|
|
139
|
+
}
|
|
140
|
+
/**
|
|
141
|
+
* 判断同一字段上父条件与子条件是否冲突。
|
|
142
|
+
*
|
|
143
|
+
* @param parent - 父级该字段的条件列表
|
|
144
|
+
* @param child - 当前节点的条件列表
|
|
145
|
+
* @returns 若存在互斥则为 true
|
|
146
|
+
*/
|
|
147
|
+
function hasConditionConflict(parent, child) {
|
|
148
|
+
for (const pc of parent) {
|
|
149
|
+
for (const cc of child) {
|
|
150
|
+
if (twoConditionsConflict(pc, cc)) {
|
|
151
|
+
return true;
|
|
152
|
+
}
|
|
153
|
+
}
|
|
154
|
+
}
|
|
155
|
+
return false;
|
|
156
|
+
}
|
|
157
|
+
//# sourceMappingURL=conflicts.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"conflicts.js","sourceRoot":"","sources":["../../src/core/conflicts.ts"],"names":[],"mappings":";;AAcA,sDA2IC;AASD,oDASC;AA1KD,mCAAyC;AAEzC,SAAS,cAAc,CAAC,CAAU;IAC9B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,YAAY,IAAI,CAAC;AACtD,CAAC;AAED,SAAS,KAAK,CAAC,CAAgB;IAC3B,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,SAAgB,qBAAqB,CAAC,CAAiB,EAAE,CAAiB;IACtE,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QACnC,OAAO,CAAC,IAAA,sBAAc,EAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;QACnB,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;YACzF,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrD,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,MAAM,EAAE,GAAG,KAAK,CAAC,KAAsB,CAAC;YACxC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACrB,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;gBACrB,OAAO,EAAE,IAAI,EAAE,CAAC;YACpB,CAAC;YACD,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;gBACtB,OAAO,EAAE,GAAG,EAAE,CAAC;YACnB,CAAC;YACD,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;gBACrB,OAAO,EAAE,IAAI,EAAE,CAAC;YACpB,CAAC;YACD,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;gBACtB,OAAO,EAAE,GAAG,EAAE,CAAC;YACnB,CAAC;QACL,CAAC;QACD,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;YAC5C,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACrE,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACpD,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;gBACrB,OAAO,CAAC,KAAK,CAAC;YAClB,CAAC;YACD,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;gBACtB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,IAAI,KAAK,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAEpC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAClB,OAAO,MAAM,KAAK,IAAI,CAAC;YAC3B,CAAC;YACD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACb,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;YACrB,OAAO,IAAA,sBAAc,EAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;IACL,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAU,CAAC;IACvD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAA6B,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAA6B,CAAC,EAAE,CAAC;QACvG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,KAAsB,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,KAAsB,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,CAAC,CAAC,EAA6B,CAAC;QAC5C,MAAM,GAAG,GAAG,CAAC,CAAC,EAA6B,CAAC;QAC5C,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,EAAE,CAAC;YACzE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,EAAE,CAAC;YACzE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;QACtE,CAAC;IACL,CAAC;IAED,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;QAC1C,IACI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC;YACpC,CAAC,CAAC,EAAE,KAAK,KAAK;YACd,CAAC,CAAC,EAAE,KAAK,KAAK;YACd,CAAC,CAAC,EAAE,KAAK,MAAM;YACf,CAAC,CAAC,EAAE,KAAK,KAAK;YACd,CAAC,CAAC,EAAE,KAAK,MAAM,EACjB,CAAC;YACC,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IACD,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;QAC1C,IACI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC;YACpC,CAAC,CAAC,EAAE,KAAK,KAAK;YACd,CAAC,CAAC,EAAE,KAAK,KAAK;YACd,CAAC,CAAC,EAAE,KAAK,MAAM;YACf,CAAC,CAAC,EAAE,KAAK,KAAK;YACd,CAAC,CAAC,EAAE,KAAK,MAAM,EACjB,CAAC;YACC,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC;QAC7E,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAc,CAAC;QAChE,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAc,CAAC;QAClE,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrG,OAAO,WAAW,CAAC;IACvB,CAAC;IAED,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;QAC3C,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC;IAC/B,CAAC;IAED,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;QACvC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;QACvC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IACI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC;QAClC,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EACpC,CAAC;QACC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACjE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,MAAM,gBAAgB,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QACzE,OAAO,gBAAgB,CAAC;IAC5B,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,oBAAoB,CAAC,MAAwB,EAAE,KAAuB;IAClF,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACrB,IAAI,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC"}
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
import type { FieldCondition, FieldNode, SelectorAST } from "../ast/types";
|
|
2
|
+
export type FieldConditionMap = Map<string, FieldCondition[]>;
|
|
3
|
+
export declare function cloneContext(context: FieldConditionMap): FieldConditionMap;
|
|
4
|
+
export declare function addToContext(context: FieldConditionMap, node: FieldNode): void;
|
|
5
|
+
export declare function buildLayerContext(parentContext: FieldConditionMap, layerAll: FieldConditionMap): FieldConditionMap;
|
|
6
|
+
export declare function buildSiblingContext(parentContext: FieldConditionMap, layerAll: FieldConditionMap, self: FieldNode): FieldConditionMap;
|
|
7
|
+
export declare function subtractConditions(all: FieldCondition[], sub: FieldCondition[]): FieldCondition[];
|
|
8
|
+
/**
|
|
9
|
+
* 在父级上下文中化简单个 FieldNode:冲突 → false;否则在支持的操作符上做等价收紧(见 tightenWithParent)。
|
|
10
|
+
*/
|
|
11
|
+
export declare function simplifyFieldAgainstContext(node: FieldNode, context: FieldConditionMap): SelectorAST;
|
|
12
|
+
export declare function collectAndLayerFieldConditions(node: {
|
|
13
|
+
children: SelectorAST[];
|
|
14
|
+
}): FieldConditionMap;
|
|
15
|
+
//# sourceMappingURL=constraint-propagation.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"constraint-propagation.d.ts","sourceRoot":"","sources":["../../src/core/constraint-propagation.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAQ3E,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC,CAAC;AAE9D,wBAAgB,YAAY,CAAC,OAAO,EAAE,iBAAiB,GAAG,iBAAiB,CAM1E;AAED,wBAAgB,YAAY,CAAC,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,SAAS,GAAG,IAAI,CAG9E;AAED,wBAAgB,iBAAiB,CAAC,aAAa,EAAE,iBAAiB,EAAE,QAAQ,EAAE,iBAAiB,GAAG,iBAAiB,CAOlH;AAED,wBAAgB,mBAAmB,CAC/B,aAAa,EAAE,iBAAiB,EAChC,QAAQ,EAAE,iBAAiB,EAC3B,IAAI,EAAE,SAAS,GAChB,iBAAiB,CAanB;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,cAAc,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE,CAcjG;AAED;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,GAAG,WAAW,CAsBpG;AAED,wBAAgB,8BAA8B,CAAC,IAAI,EAAE;IAAE,QAAQ,EAAE,WAAW,EAAE,CAAA;CAAE,GAAG,iBAAiB,CAUnG"}
|
|
@@ -0,0 +1,93 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.cloneContext = cloneContext;
|
|
4
|
+
exports.addToContext = addToContext;
|
|
5
|
+
exports.buildLayerContext = buildLayerContext;
|
|
6
|
+
exports.buildSiblingContext = buildSiblingContext;
|
|
7
|
+
exports.subtractConditions = subtractConditions;
|
|
8
|
+
exports.simplifyFieldAgainstContext = simplifyFieldAgainstContext;
|
|
9
|
+
exports.collectAndLayerFieldConditions = collectAndLayerFieldConditions;
|
|
10
|
+
const builders_1 = require("../ast/builders");
|
|
11
|
+
const guards_1 = require("../ast/guards");
|
|
12
|
+
const conflicts_and_tighten_1 = require("./conflicts-and-tighten");
|
|
13
|
+
const utils_1 = require("./utils");
|
|
14
|
+
function cloneContext(context) {
|
|
15
|
+
const next = new Map();
|
|
16
|
+
for (const [k, v] of context) {
|
|
17
|
+
next.set(k, [...v]);
|
|
18
|
+
}
|
|
19
|
+
return next;
|
|
20
|
+
}
|
|
21
|
+
function addToContext(context, node) {
|
|
22
|
+
const existing = context.get(node.field) ?? [];
|
|
23
|
+
context.set(node.field, [...existing, ...node.conditions]);
|
|
24
|
+
}
|
|
25
|
+
function buildLayerContext(parentContext, layerAll) {
|
|
26
|
+
const next = cloneContext(parentContext);
|
|
27
|
+
for (const [field, conds] of layerAll) {
|
|
28
|
+
const existing = next.get(field) ?? [];
|
|
29
|
+
next.set(field, [...existing, ...conds]);
|
|
30
|
+
}
|
|
31
|
+
return next;
|
|
32
|
+
}
|
|
33
|
+
function buildSiblingContext(parentContext, layerAll, self) {
|
|
34
|
+
const next = cloneContext(parentContext);
|
|
35
|
+
const all = layerAll.get(self.field);
|
|
36
|
+
if (!all) {
|
|
37
|
+
return next;
|
|
38
|
+
}
|
|
39
|
+
const siblingsOnly = subtractConditions(all, self.conditions);
|
|
40
|
+
if (siblingsOnly.length > 0) {
|
|
41
|
+
const parentExisting = next.get(self.field) ?? [];
|
|
42
|
+
next.set(self.field, [...parentExisting, ...siblingsOnly]);
|
|
43
|
+
}
|
|
44
|
+
return next;
|
|
45
|
+
}
|
|
46
|
+
function subtractConditions(all, sub) {
|
|
47
|
+
if (sub.length === 0) {
|
|
48
|
+
return [...all];
|
|
49
|
+
}
|
|
50
|
+
const remaining = [...all];
|
|
51
|
+
for (const s of sub) {
|
|
52
|
+
const idx = remaining.findIndex((c) => c.op === s.op && (0, utils_1.areValuesEqual)(c.value, s.value));
|
|
53
|
+
if (idx >= 0) {
|
|
54
|
+
remaining.splice(idx, 1);
|
|
55
|
+
}
|
|
56
|
+
}
|
|
57
|
+
return remaining;
|
|
58
|
+
}
|
|
59
|
+
/**
|
|
60
|
+
* 在父级上下文中化简单个 FieldNode:冲突 → false;否则在支持的操作符上做等价收紧(见 tightenWithParent)。
|
|
61
|
+
*/
|
|
62
|
+
function simplifyFieldAgainstContext(node, context) {
|
|
63
|
+
if ((0, conflicts_and_tighten_1.isConditionsImpossible)(node.conditions)) {
|
|
64
|
+
return builders_1.ASTNodeBuilder.falseNode();
|
|
65
|
+
}
|
|
66
|
+
const parent = context.get(node.field);
|
|
67
|
+
if (!parent) {
|
|
68
|
+
return node;
|
|
69
|
+
}
|
|
70
|
+
if ((0, conflicts_and_tighten_1.isParentChildImpossible)(parent, node.conditions)) {
|
|
71
|
+
return builders_1.ASTNodeBuilder.falseNode();
|
|
72
|
+
}
|
|
73
|
+
const tightened = (0, conflicts_and_tighten_1.tightenWithParent)(parent, node.conditions);
|
|
74
|
+
if (tightened.impossible) {
|
|
75
|
+
return builders_1.ASTNodeBuilder.falseNode();
|
|
76
|
+
}
|
|
77
|
+
if (tightened.changed && tightened.conditions.length === 0) {
|
|
78
|
+
return builders_1.ASTNodeBuilder.trueNode();
|
|
79
|
+
}
|
|
80
|
+
return tightened.changed ? { ...node, conditions: tightened.conditions } : node;
|
|
81
|
+
}
|
|
82
|
+
function collectAndLayerFieldConditions(node) {
|
|
83
|
+
const layerAll = new Map();
|
|
84
|
+
for (const child of node.children) {
|
|
85
|
+
if (!(0, guards_1.isFieldNode)(child)) {
|
|
86
|
+
continue;
|
|
87
|
+
}
|
|
88
|
+
const existing = layerAll.get(child.field) ?? [];
|
|
89
|
+
layerAll.set(child.field, [...existing, ...child.conditions]);
|
|
90
|
+
}
|
|
91
|
+
return layerAll;
|
|
92
|
+
}
|
|
93
|
+
//# sourceMappingURL=constraint-propagation.js.map
|