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