@rkmodules/rules 0.0.115 → 0.0.117
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 +218 -94
- package/dist/index.cjs.js.map +1 -1
- package/dist/index.esm.js +218 -94
- package/dist/index.esm.js.map +1 -1
- package/dist/lib/Primitives/Json/index.d.ts +3 -0
- package/dist/lib/Primitives/Json/listToArray.d.ts +2 -0
- package/dist/lib/Primitives/Json/mergeObject.d.ts +2 -0
- package/dist/lib/Primitives/Json/object.d.ts +2 -0
- package/dist/lib/Primitives/Json/objectEntries.d.ts +2 -0
- package/dist/lib/Primitives/String/stringEqualTo.d.ts +2 -0
- package/dist/lib/Primitives/index.d.ts +1 -0
- package/package.json +1 -1
package/dist/index.cjs.js
CHANGED
|
@@ -767,13 +767,13 @@ var value = {
|
|
|
767
767
|
}); },
|
|
768
768
|
};
|
|
769
769
|
|
|
770
|
-
var _a$
|
|
771
|
-
var primitives$
|
|
772
|
-
_a$
|
|
773
|
-
_a$
|
|
774
|
-
_a$
|
|
775
|
-
_a$
|
|
776
|
-
_a$
|
|
770
|
+
var _a$9;
|
|
771
|
+
var primitives$9 = (_a$9 = {},
|
|
772
|
+
_a$9[getValue.name] = getValue,
|
|
773
|
+
_a$9[log.name] = log,
|
|
774
|
+
_a$9[value.name] = value,
|
|
775
|
+
_a$9[getType.name] = getType,
|
|
776
|
+
_a$9);
|
|
777
777
|
|
|
778
778
|
function isNumber() {
|
|
779
779
|
var ns = [];
|
|
@@ -1384,27 +1384,27 @@ var sum = {
|
|
|
1384
1384
|
}); },
|
|
1385
1385
|
};
|
|
1386
1386
|
|
|
1387
|
-
var _a$
|
|
1388
|
-
var primitives$
|
|
1389
|
-
_a$
|
|
1390
|
-
_a$
|
|
1391
|
-
_a$
|
|
1392
|
-
_a$
|
|
1393
|
-
_a$
|
|
1394
|
-
_a$
|
|
1395
|
-
_a$
|
|
1396
|
-
_a$
|
|
1397
|
-
_a$
|
|
1398
|
-
_a$
|
|
1399
|
-
_a$
|
|
1400
|
-
_a$
|
|
1401
|
-
_a$
|
|
1402
|
-
_a$
|
|
1403
|
-
_a$
|
|
1404
|
-
_a$
|
|
1405
|
-
_a$
|
|
1406
|
-
_a$
|
|
1407
|
-
_a$
|
|
1387
|
+
var _a$8;
|
|
1388
|
+
var primitives$8 = (_a$8 = {},
|
|
1389
|
+
_a$8[calc.name] = calc,
|
|
1390
|
+
_a$8[equalTo.name] = equalTo,
|
|
1391
|
+
_a$8[lessThan.name] = lessThan,
|
|
1392
|
+
_a$8[greaterThan.name] = greaterThan,
|
|
1393
|
+
_a$8[add$1.name] = add$1,
|
|
1394
|
+
_a$8[subtract$1.name] = subtract$1,
|
|
1395
|
+
_a$8[multiply.name] = multiply,
|
|
1396
|
+
_a$8[divide.name] = divide,
|
|
1397
|
+
_a$8[modulo.name] = modulo,
|
|
1398
|
+
_a$8[sinDeg.name] = sinDeg,
|
|
1399
|
+
_a$8[cosDeg.name] = cosDeg,
|
|
1400
|
+
_a$8[tanDeg.name] = tanDeg,
|
|
1401
|
+
_a$8[sqrt.name] = sqrt,
|
|
1402
|
+
_a$8[pow.name] = pow,
|
|
1403
|
+
_a$8[round.name] = round,
|
|
1404
|
+
_a$8[ceil.name] = ceil,
|
|
1405
|
+
_a$8[floor.name] = floor,
|
|
1406
|
+
_a$8[sum.name] = sum,
|
|
1407
|
+
_a$8);
|
|
1408
1408
|
|
|
1409
1409
|
var joinStrings = {
|
|
1410
1410
|
name: "joinStrings",
|
|
@@ -1434,6 +1434,32 @@ var joinStrings = {
|
|
|
1434
1434
|
}); },
|
|
1435
1435
|
};
|
|
1436
1436
|
|
|
1437
|
+
var stringEqualTo = {
|
|
1438
|
+
name: "stringEqualTo",
|
|
1439
|
+
label: "String Equal to",
|
|
1440
|
+
description: "Compare string equal and not equal",
|
|
1441
|
+
inputs: {
|
|
1442
|
+
a: { type: "number", default: 0 },
|
|
1443
|
+
b: { type: "number", default: 0 },
|
|
1444
|
+
},
|
|
1445
|
+
outputs: {
|
|
1446
|
+
eq: "boolean",
|
|
1447
|
+
neq: "boolean",
|
|
1448
|
+
},
|
|
1449
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1450
|
+
return __generator(this, function (_a) {
|
|
1451
|
+
return [2 /*return*/, {
|
|
1452
|
+
eq: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
1453
|
+
return itemA === itemB;
|
|
1454
|
+
}, true),
|
|
1455
|
+
neq: binaryOnTree(inputs.a, inputs.b, function (itemA, itemB) {
|
|
1456
|
+
return itemA !== itemB;
|
|
1457
|
+
}, true),
|
|
1458
|
+
}];
|
|
1459
|
+
});
|
|
1460
|
+
}); },
|
|
1461
|
+
};
|
|
1462
|
+
|
|
1437
1463
|
var toString = {
|
|
1438
1464
|
name: "toString",
|
|
1439
1465
|
label: "To String",
|
|
@@ -1457,11 +1483,12 @@ var toString = {
|
|
|
1457
1483
|
}); },
|
|
1458
1484
|
};
|
|
1459
1485
|
|
|
1460
|
-
var _a$
|
|
1461
|
-
var primitives$
|
|
1462
|
-
_a$
|
|
1463
|
-
_a$
|
|
1464
|
-
_a$
|
|
1486
|
+
var _a$7;
|
|
1487
|
+
var primitives$7 = (_a$7 = {},
|
|
1488
|
+
_a$7[toString.name] = toString,
|
|
1489
|
+
_a$7[joinStrings.name] = joinStrings,
|
|
1490
|
+
_a$7[stringEqualTo.name] = stringEqualTo,
|
|
1491
|
+
_a$7);
|
|
1465
1492
|
|
|
1466
1493
|
var filterList = {
|
|
1467
1494
|
name: "filterList",
|
|
@@ -1693,43 +1720,47 @@ var listInput = {
|
|
|
1693
1720
|
},
|
|
1694
1721
|
outputs: {
|
|
1695
1722
|
tree: "string",
|
|
1723
|
+
array: "array",
|
|
1696
1724
|
},
|
|
1697
1725
|
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1726
|
+
var tree;
|
|
1698
1727
|
return __generator(this, function (_a) {
|
|
1728
|
+
tree = mapTreeBranch(inputs.list || {}, function (branch) {
|
|
1729
|
+
if (!branch || branch.length === 0)
|
|
1730
|
+
return DISCARD;
|
|
1731
|
+
var allLines = branch.flatMap(function (text) {
|
|
1732
|
+
return text.replace(/(^[\n\r]+)|([\n\r]+$)/, "").split("\n");
|
|
1733
|
+
});
|
|
1734
|
+
if (allLines.every(function (line) { return isBoolStr(line); })) {
|
|
1735
|
+
allLines = allLines.map(function (line) { return line.toLowerCase() === "true"; });
|
|
1736
|
+
}
|
|
1737
|
+
else if (allLines.every(function (line) { return isNumStr(line); })) {
|
|
1738
|
+
allLines = allLines.map(function (line) {
|
|
1739
|
+
if (!line)
|
|
1740
|
+
return undefined;
|
|
1741
|
+
return Number(line);
|
|
1742
|
+
});
|
|
1743
|
+
}
|
|
1744
|
+
return allLines;
|
|
1745
|
+
});
|
|
1699
1746
|
return [2 /*return*/, {
|
|
1700
|
-
tree:
|
|
1701
|
-
|
|
1702
|
-
return DISCARD;
|
|
1703
|
-
var allLines = branch.flatMap(function (text) {
|
|
1704
|
-
return text.replace(/(^[\n\r]+)|([\n\r]+$)/, "").split("\n");
|
|
1705
|
-
});
|
|
1706
|
-
if (allLines.every(function (line) { return isBoolStr(line); })) {
|
|
1707
|
-
allLines = allLines.map(function (line) { return line.toLowerCase() === "true"; });
|
|
1708
|
-
}
|
|
1709
|
-
else if (allLines.every(function (line) { return isNumStr(line); })) {
|
|
1710
|
-
allLines = allLines.map(function (line) {
|
|
1711
|
-
if (!line)
|
|
1712
|
-
return undefined;
|
|
1713
|
-
return Number(line);
|
|
1714
|
-
});
|
|
1715
|
-
}
|
|
1716
|
-
return allLines;
|
|
1717
|
-
}),
|
|
1747
|
+
tree: tree,
|
|
1748
|
+
array: mapTreeBranch(tree, function (branch) { return [branch]; }),
|
|
1718
1749
|
}];
|
|
1719
1750
|
});
|
|
1720
1751
|
}); },
|
|
1721
1752
|
};
|
|
1722
1753
|
|
|
1723
|
-
var _a$
|
|
1724
|
-
var primitives$
|
|
1725
|
-
_a$
|
|
1726
|
-
_a$
|
|
1727
|
-
_a$
|
|
1728
|
-
_a$
|
|
1729
|
-
_a$
|
|
1730
|
-
_a$
|
|
1731
|
-
_a$
|
|
1732
|
-
_a$
|
|
1754
|
+
var _a$6;
|
|
1755
|
+
var primitives$6 = (_a$6 = {},
|
|
1756
|
+
_a$6[listInput.name] = listInput,
|
|
1757
|
+
_a$6[listItem.name] = listItem,
|
|
1758
|
+
_a$6[listLength.name] = listLength,
|
|
1759
|
+
_a$6[filterList.name] = filterList,
|
|
1760
|
+
_a$6[relativeItem.name] = relativeItem,
|
|
1761
|
+
_a$6[relativeItems.name] = relativeItems,
|
|
1762
|
+
_a$6[concat.name] = concat,
|
|
1763
|
+
_a$6);
|
|
1733
1764
|
|
|
1734
1765
|
var splitGroup = {
|
|
1735
1766
|
name: "splitGroup",
|
|
@@ -1817,7 +1848,7 @@ var cartesianGroups = {
|
|
|
1817
1848
|
var mergeTree = {
|
|
1818
1849
|
name: "mergeTree",
|
|
1819
1850
|
label: "Merge Tree",
|
|
1820
|
-
description: "Merge
|
|
1851
|
+
description: "Merge groups with the same index into a single tree.",
|
|
1821
1852
|
nodeType: "Merge",
|
|
1822
1853
|
inputs: {},
|
|
1823
1854
|
outputs: {
|
|
@@ -1827,14 +1858,13 @@ var mergeTree = {
|
|
|
1827
1858
|
var result;
|
|
1828
1859
|
return __generator(this, function (_a) {
|
|
1829
1860
|
result = {};
|
|
1830
|
-
Object.values(inputs).forEach(function (
|
|
1831
|
-
|
|
1832
|
-
|
|
1833
|
-
|
|
1834
|
-
result[key] = value;
|
|
1861
|
+
Object.values(inputs).forEach(function (tree) {
|
|
1862
|
+
forEachBranch(tree, function (branch, path) {
|
|
1863
|
+
if (!result[path]) {
|
|
1864
|
+
result[path] = branch;
|
|
1835
1865
|
}
|
|
1836
1866
|
else {
|
|
1837
|
-
result[
|
|
1867
|
+
result[path] = __spreadArray(__spreadArray([], __read(result[path]), false), __read(branch), false);
|
|
1838
1868
|
}
|
|
1839
1869
|
});
|
|
1840
1870
|
});
|
|
@@ -1992,18 +2022,18 @@ var treeItem = {
|
|
|
1992
2022
|
}); },
|
|
1993
2023
|
};
|
|
1994
2024
|
|
|
1995
|
-
var _a$
|
|
1996
|
-
var primitives$
|
|
1997
|
-
_a$
|
|
1998
|
-
_a$
|
|
1999
|
-
_a$
|
|
2000
|
-
_a$
|
|
2001
|
-
_a$
|
|
2002
|
-
_a$
|
|
2003
|
-
_a$
|
|
2004
|
-
_a$
|
|
2005
|
-
_a$
|
|
2006
|
-
_a$
|
|
2025
|
+
var _a$5;
|
|
2026
|
+
var primitives$5 = (_a$5 = {},
|
|
2027
|
+
_a$5[splitGroup.name] = splitGroup,
|
|
2028
|
+
_a$5[mergeGroup.name] = mergeGroup,
|
|
2029
|
+
_a$5[groupAll.name] = groupAll,
|
|
2030
|
+
_a$5[filterTree.name] = filterTree,
|
|
2031
|
+
_a$5[treeItem.name] = treeItem,
|
|
2032
|
+
_a$5[simplifyTree.name] = simplifyTree,
|
|
2033
|
+
_a$5[normalizeTree.name] = normalizeTree,
|
|
2034
|
+
_a$5[cartesianGroups.name] = cartesianGroups,
|
|
2035
|
+
_a$5[mergeTree.name] = mergeTree,
|
|
2036
|
+
_a$5);
|
|
2007
2037
|
|
|
2008
2038
|
var series = {
|
|
2009
2039
|
name: "series",
|
|
@@ -2040,10 +2070,10 @@ var series = {
|
|
|
2040
2070
|
}); },
|
|
2041
2071
|
};
|
|
2042
2072
|
|
|
2043
|
-
var _a$
|
|
2044
|
-
var primitives$
|
|
2045
|
-
_a$
|
|
2046
|
-
_a$
|
|
2073
|
+
var _a$4;
|
|
2074
|
+
var primitives$4 = (_a$4 = {},
|
|
2075
|
+
_a$4[series.name] = series,
|
|
2076
|
+
_a$4);
|
|
2047
2077
|
|
|
2048
2078
|
var groupAnd = {
|
|
2049
2079
|
name: "groupAnd",
|
|
@@ -2141,12 +2171,12 @@ var groupStats = {
|
|
|
2141
2171
|
}); },
|
|
2142
2172
|
};
|
|
2143
2173
|
|
|
2144
|
-
var _a$
|
|
2145
|
-
var primitives$
|
|
2146
|
-
_a$
|
|
2147
|
-
_a$
|
|
2148
|
-
_a$
|
|
2149
|
-
_a$
|
|
2174
|
+
var _a$3;
|
|
2175
|
+
var primitives$3 = (_a$3 = {},
|
|
2176
|
+
_a$3[groupAnd.name] = groupAnd,
|
|
2177
|
+
_a$3[groupOr.name] = groupOr,
|
|
2178
|
+
_a$3[groupStats.name] = groupStats,
|
|
2179
|
+
_a$3);
|
|
2150
2180
|
|
|
2151
2181
|
var inputs = {
|
|
2152
2182
|
name: "inputs",
|
|
@@ -2176,14 +2206,108 @@ var output = {
|
|
|
2176
2206
|
}); },
|
|
2177
2207
|
};
|
|
2178
2208
|
|
|
2209
|
+
var _a$2;
|
|
2210
|
+
var primitives$2 = (_a$2 = {},
|
|
2211
|
+
_a$2[inputs.name] = inputs,
|
|
2212
|
+
_a$2[output.name] = output,
|
|
2213
|
+
_a$2);
|
|
2214
|
+
|
|
2215
|
+
var mergeObject = {
|
|
2216
|
+
name: "mergeObject",
|
|
2217
|
+
label: "Merge Object",
|
|
2218
|
+
description: "Merges objects in groups",
|
|
2219
|
+
nodeType: "Merge",
|
|
2220
|
+
inputs: {},
|
|
2221
|
+
outputs: {
|
|
2222
|
+
object: "any",
|
|
2223
|
+
},
|
|
2224
|
+
impl: function (inputs) { return __awaiter(void 0, void 0, void 0, function () {
|
|
2225
|
+
var object;
|
|
2226
|
+
return __generator(this, function (_a) {
|
|
2227
|
+
object = {};
|
|
2228
|
+
Object.values(inputs).forEach(function (tree) {
|
|
2229
|
+
forEachBranch(tree, function (branch, path) {
|
|
2230
|
+
if (!object[path]) {
|
|
2231
|
+
object[path] = [{}];
|
|
2232
|
+
}
|
|
2233
|
+
object[path] = [Object.assign.apply(Object, __spreadArray([object[path][0]], __read(branch), false))];
|
|
2234
|
+
});
|
|
2235
|
+
});
|
|
2236
|
+
return [2 /*return*/, {
|
|
2237
|
+
object: object,
|
|
2238
|
+
}];
|
|
2239
|
+
});
|
|
2240
|
+
}); },
|
|
2241
|
+
};
|
|
2242
|
+
|
|
2243
|
+
var object = {
|
|
2244
|
+
name: "object",
|
|
2245
|
+
label: "Object",
|
|
2246
|
+
description: "Creates an object",
|
|
2247
|
+
inputs: {
|
|
2248
|
+
key: "string",
|
|
2249
|
+
value: "string",
|
|
2250
|
+
},
|
|
2251
|
+
outputs: {
|
|
2252
|
+
object: "any",
|
|
2253
|
+
},
|
|
2254
|
+
impl: function (_a) { return __awaiter(void 0, [_a], void 0, function (_b) {
|
|
2255
|
+
var pairs;
|
|
2256
|
+
var _c = _b.key, key = _c === void 0 ? {} : _c, _d = _b.value, value = _d === void 0 ? {} : _d;
|
|
2257
|
+
return __generator(this, function (_e) {
|
|
2258
|
+
pairs = binaryOnTree(key, value, function (k, v) {
|
|
2259
|
+
return [[k, v]];
|
|
2260
|
+
}, true);
|
|
2261
|
+
return [2 /*return*/, {
|
|
2262
|
+
object: mapTreeBranch(pairs, function (pairs) {
|
|
2263
|
+
return [Object.fromEntries(pairs)];
|
|
2264
|
+
}),
|
|
2265
|
+
}];
|
|
2266
|
+
});
|
|
2267
|
+
}); },
|
|
2268
|
+
};
|
|
2269
|
+
|
|
2270
|
+
var listToArray = {
|
|
2271
|
+
name: "listToArray",
|
|
2272
|
+
label: "To Array",
|
|
2273
|
+
description: "Converts each branch to an array",
|
|
2274
|
+
inputs: {
|
|
2275
|
+
items: "any",
|
|
2276
|
+
},
|
|
2277
|
+
outputs: {
|
|
2278
|
+
arrays: "any",
|
|
2279
|
+
},
|
|
2280
|
+
impl: function (_a) { return __awaiter(void 0, [_a], void 0, function (_b) {
|
|
2281
|
+
var _c = _b.items, items = _c === void 0 ? {} : _c;
|
|
2282
|
+
return __generator(this, function (_d) {
|
|
2283
|
+
return [2 /*return*/, {
|
|
2284
|
+
arrays: mapTreeBranch(items, function (items) {
|
|
2285
|
+
return [items];
|
|
2286
|
+
}),
|
|
2287
|
+
}];
|
|
2288
|
+
});
|
|
2289
|
+
}); },
|
|
2290
|
+
};
|
|
2291
|
+
|
|
2179
2292
|
var _a$1;
|
|
2180
2293
|
var primitives$1 = (_a$1 = {},
|
|
2181
|
-
_a$1[
|
|
2182
|
-
_a$1[
|
|
2294
|
+
_a$1[object.name] = object,
|
|
2295
|
+
_a$1[listToArray.name] = listToArray,
|
|
2296
|
+
_a$1[mergeObject.name] = mergeObject,
|
|
2183
2297
|
_a$1);
|
|
2184
2298
|
|
|
2185
|
-
var Lib = {
|
|
2186
|
-
|
|
2299
|
+
var Lib = {
|
|
2300
|
+
Util: primitives$9,
|
|
2301
|
+
Math: primitives$8,
|
|
2302
|
+
String: primitives$7,
|
|
2303
|
+
List: primitives$6,
|
|
2304
|
+
Group: primitives$5,
|
|
2305
|
+
Sequence: primitives$4,
|
|
2306
|
+
Logic: primitives$3,
|
|
2307
|
+
IO: primitives$2,
|
|
2308
|
+
Json: primitives$1,
|
|
2309
|
+
};
|
|
2310
|
+
var primitives = __assign(__assign(__assign(__assign(__assign(__assign(__assign(__assign(__assign({}, primitives$2), primitives$9), primitives$8), primitives$7), primitives$6), primitives$5), primitives$4), primitives$3), primitives$1);
|
|
2187
2311
|
|
|
2188
2312
|
function isPrimitive(node) {
|
|
2189
2313
|
return node.impl !== undefined;
|