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