@rkmodules/rules 0.0.68 → 0.0.70
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/dist/index.cjs.js
CHANGED
|
@@ -873,6 +873,36 @@ var divide = {
|
|
|
873
873
|
}); },
|
|
874
874
|
};
|
|
875
875
|
|
|
876
|
+
var equalTo = {
|
|
877
|
+
name: "equalTo",
|
|
878
|
+
label: "Equal to",
|
|
879
|
+
description: "Compare equal and not equal",
|
|
880
|
+
inputs: {
|
|
881
|
+
a: { type: "number", default: 0 },
|
|
882
|
+
b: { type: "number", default: 0 },
|
|
883
|
+
},
|
|
884
|
+
outputs: {
|
|
885
|
+
eq: "boolean",
|
|
886
|
+
neq: "boolean",
|
|
887
|
+
},
|
|
888
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
889
|
+
return __generator(this, function (_a) {
|
|
890
|
+
return [2 /*return*/, {
|
|
891
|
+
eq: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
892
|
+
if (itemA === undefined || itemB === undefined)
|
|
893
|
+
return DISCARD;
|
|
894
|
+
return itemA === itemB;
|
|
895
|
+
}, true),
|
|
896
|
+
neq: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
897
|
+
if (itemA === undefined || itemB === undefined)
|
|
898
|
+
return DISCARD;
|
|
899
|
+
return itemA !== itemB;
|
|
900
|
+
}, true),
|
|
901
|
+
}];
|
|
902
|
+
});
|
|
903
|
+
}); },
|
|
904
|
+
};
|
|
905
|
+
|
|
876
906
|
var greaterThan = {
|
|
877
907
|
name: "greaterThan",
|
|
878
908
|
label: "Greater Than",
|
|
@@ -1103,6 +1133,7 @@ var tanDeg = {
|
|
|
1103
1133
|
var _a$5;
|
|
1104
1134
|
var primitives$5 = (_a$5 = {},
|
|
1105
1135
|
_a$5[calc.name] = calc,
|
|
1136
|
+
_a$5[equalTo.name] = equalTo,
|
|
1106
1137
|
_a$5[lessThan.name] = lessThan,
|
|
1107
1138
|
_a$5[greaterThan.name] = greaterThan,
|
|
1108
1139
|
_a$5[add$1.name] = add$1,
|
|
@@ -1125,24 +1156,35 @@ var filterList = {
|
|
|
1125
1156
|
list: "any",
|
|
1126
1157
|
keep: "boolean",
|
|
1127
1158
|
},
|
|
1159
|
+
params: {
|
|
1160
|
+
removeEmpty: { type: "boolean", default: false },
|
|
1161
|
+
},
|
|
1128
1162
|
outputs: {
|
|
1129
1163
|
list: "any",
|
|
1130
1164
|
others: "any",
|
|
1131
1165
|
},
|
|
1132
|
-
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1166
|
+
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1133
1167
|
return __generator(this, function (_a) {
|
|
1134
1168
|
return [2 /*return*/, {
|
|
1135
1169
|
list: binaryOnTreeBranch(inputs.list || {}, inputs.keep || {}, function (branchA, branchB) {
|
|
1136
|
-
|
|
1170
|
+
var result = branchA.filter(function (item, index) {
|
|
1137
1171
|
return (branchB[Math.min(index, branchB.length - 1)] ===
|
|
1138
1172
|
true);
|
|
1139
1173
|
});
|
|
1174
|
+
if (!result.length && params.removeEmpty) {
|
|
1175
|
+
return DISCARD;
|
|
1176
|
+
}
|
|
1177
|
+
return result;
|
|
1140
1178
|
}),
|
|
1141
1179
|
others: binaryOnTreeBranch(inputs.list || {}, inputs.keep || {}, function (branchA, branchB) {
|
|
1142
|
-
|
|
1180
|
+
var result = branchA.filter(function (item, index) {
|
|
1143
1181
|
return (branchB[Math.min(index, branchB.length - 1)] ===
|
|
1144
1182
|
false);
|
|
1145
1183
|
});
|
|
1184
|
+
if (!result.length && params.removeEmpty) {
|
|
1185
|
+
return DISCARD;
|
|
1186
|
+
}
|
|
1187
|
+
return result;
|
|
1146
1188
|
}),
|
|
1147
1189
|
}];
|
|
1148
1190
|
});
|
|
@@ -1321,6 +1363,32 @@ var cartesianGroups = {
|
|
|
1321
1363
|
}); },
|
|
1322
1364
|
};
|
|
1323
1365
|
|
|
1366
|
+
var concat = {
|
|
1367
|
+
name: "concat",
|
|
1368
|
+
label: "Concat",
|
|
1369
|
+
description: "Concatenates two lists back to back",
|
|
1370
|
+
inputs: {
|
|
1371
|
+
treeA: "any",
|
|
1372
|
+
treeB: "any",
|
|
1373
|
+
},
|
|
1374
|
+
outputs: {
|
|
1375
|
+
result: "any",
|
|
1376
|
+
},
|
|
1377
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1378
|
+
return __generator(this, function (_a) {
|
|
1379
|
+
return [2 /*return*/, {
|
|
1380
|
+
result: binaryOnTreeBranch(inputs.treeA || {}, inputs.treeB || {}, function (branchA, branchB) {
|
|
1381
|
+
if (branchA === undefined)
|
|
1382
|
+
return branchB || DISCARD;
|
|
1383
|
+
if (branchB === undefined)
|
|
1384
|
+
return branchA || DISCARD;
|
|
1385
|
+
return branchA.concat(branchB);
|
|
1386
|
+
}),
|
|
1387
|
+
}];
|
|
1388
|
+
});
|
|
1389
|
+
}); },
|
|
1390
|
+
};
|
|
1391
|
+
|
|
1324
1392
|
var _a$4;
|
|
1325
1393
|
var primitives$4 = (_a$4 = {},
|
|
1326
1394
|
_a$4[splitGroup.name] = splitGroup,
|
|
@@ -1330,6 +1398,7 @@ var primitives$4 = (_a$4 = {},
|
|
|
1330
1398
|
_a$4[filterList.name] = filterList,
|
|
1331
1399
|
_a$4[shiftList.name] = shiftList,
|
|
1332
1400
|
_a$4[cartesianGroups.name] = cartesianGroups,
|
|
1401
|
+
_a$4[concat.name] = concat,
|
|
1333
1402
|
_a$4);
|
|
1334
1403
|
|
|
1335
1404
|
var series = {
|
|
@@ -1442,7 +1511,7 @@ var groupAnd = {
|
|
|
1442
1511
|
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1443
1512
|
return __generator(this, function (_a) {
|
|
1444
1513
|
return [2 /*return*/, {
|
|
1445
|
-
result: mapTreeBranch(inputs.tree, function (branch) {
|
|
1514
|
+
result: mapTreeBranch(inputs.tree || {}, function (branch) {
|
|
1446
1515
|
return [branch.reduce(function (acc, val) { return acc && val; }, true)];
|
|
1447
1516
|
}),
|
|
1448
1517
|
}];
|
|
@@ -1463,7 +1532,7 @@ var groupOr = {
|
|
|
1463
1532
|
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1464
1533
|
return __generator(this, function (_a) {
|
|
1465
1534
|
return [2 /*return*/, {
|
|
1466
|
-
result: mapTreeBranch(inputs.tree, function (branch) {
|
|
1535
|
+
result: mapTreeBranch(inputs.tree || {}, function (branch) {
|
|
1467
1536
|
return [branch.reduce(function (acc, val) { return acc || val; }, false)];
|
|
1468
1537
|
}),
|
|
1469
1538
|
}];
|