@rkmodules/rules 0.0.75 → 0.0.77
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 +145 -93
- package/dist/index.cjs.js.map +1 -1
- package/dist/index.esm.js +145 -93
- package/dist/index.esm.js.map +1 -1
- package/dist/lib/Primitives/IO/index.d.ts +3 -0
- package/dist/lib/Primitives/IO/input.d.ts +2 -0
- package/dist/lib/Primitives/IO/output.d.ts +2 -0
- package/dist/lib/Primitives/List/relativeItem.d.ts +2 -0
- package/dist/lib/Primitives/List/relativeItems.d.ts +2 -0
- package/dist/lib/Primitives/index.d.ts +1 -0
- package/package.json +1 -1
- package/dist/lib/Primitives/input.d.ts +0 -2
- package/dist/lib/Primitives/output.d.ts +0 -2
package/dist/index.cjs.js
CHANGED
|
@@ -635,12 +635,12 @@ var value = {
|
|
|
635
635
|
}); },
|
|
636
636
|
};
|
|
637
637
|
|
|
638
|
-
var _a$
|
|
639
|
-
var primitives$
|
|
640
|
-
_a$
|
|
641
|
-
_a$
|
|
642
|
-
_a$
|
|
643
|
-
_a$
|
|
638
|
+
var _a$7;
|
|
639
|
+
var primitives$7 = (_a$7 = {},
|
|
640
|
+
_a$7[getValue.name] = getValue,
|
|
641
|
+
_a$7[log.name] = log,
|
|
642
|
+
_a$7[value.name] = value,
|
|
643
|
+
_a$7);
|
|
644
644
|
|
|
645
645
|
var add$1 = {
|
|
646
646
|
name: "add",
|
|
@@ -1131,23 +1131,23 @@ var tanDeg = {
|
|
|
1131
1131
|
}); },
|
|
1132
1132
|
};
|
|
1133
1133
|
|
|
1134
|
-
var _a$
|
|
1135
|
-
var primitives$
|
|
1136
|
-
_a$
|
|
1137
|
-
_a$
|
|
1138
|
-
_a$
|
|
1139
|
-
_a$
|
|
1140
|
-
_a$
|
|
1141
|
-
_a$
|
|
1142
|
-
_a$
|
|
1143
|
-
_a$
|
|
1144
|
-
_a$
|
|
1145
|
-
_a$
|
|
1146
|
-
_a$
|
|
1147
|
-
_a$
|
|
1148
|
-
_a$
|
|
1149
|
-
_a$
|
|
1150
|
-
_a$
|
|
1134
|
+
var _a$6;
|
|
1135
|
+
var primitives$6 = (_a$6 = {},
|
|
1136
|
+
_a$6[calc.name] = calc,
|
|
1137
|
+
_a$6[equalTo.name] = equalTo,
|
|
1138
|
+
_a$6[lessThan.name] = lessThan,
|
|
1139
|
+
_a$6[greaterThan.name] = greaterThan,
|
|
1140
|
+
_a$6[add$1.name] = add$1,
|
|
1141
|
+
_a$6[subtract$1.name] = subtract$1,
|
|
1142
|
+
_a$6[multiply.name] = multiply,
|
|
1143
|
+
_a$6[divide.name] = divide,
|
|
1144
|
+
_a$6[modulo.name] = modulo,
|
|
1145
|
+
_a$6[sinDeg.name] = sinDeg,
|
|
1146
|
+
_a$6[cosDeg.name] = cosDeg,
|
|
1147
|
+
_a$6[tanDeg.name] = tanDeg,
|
|
1148
|
+
_a$6[sqrt.name] = sqrt,
|
|
1149
|
+
_a$6[pow.name] = pow,
|
|
1150
|
+
_a$6);
|
|
1151
1151
|
|
|
1152
1152
|
var filterList = {
|
|
1153
1153
|
name: "filterList",
|
|
@@ -1292,39 +1292,6 @@ var mergeGroup = {
|
|
|
1292
1292
|
}); },
|
|
1293
1293
|
};
|
|
1294
1294
|
|
|
1295
|
-
var shiftList = {
|
|
1296
|
-
name: "shiftList",
|
|
1297
|
-
label: "Shift List",
|
|
1298
|
-
description: "Shifts the list to the left, removing the first element and adding it at the end if wrap is enabled",
|
|
1299
|
-
inputs: {
|
|
1300
|
-
list: "any",
|
|
1301
|
-
step: { type: "number", default: 1, step: 1 },
|
|
1302
|
-
wrap: "boolean",
|
|
1303
|
-
},
|
|
1304
|
-
outputs: {
|
|
1305
|
-
list: "any",
|
|
1306
|
-
},
|
|
1307
|
-
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1308
|
-
return __generator(this, function (_a) {
|
|
1309
|
-
return [2 /*return*/, {
|
|
1310
|
-
list: nAryOnTreeBranch([inputs.list || {}, inputs.step || {}, inputs.wrap || {}], function (_a) {
|
|
1311
|
-
var _b;
|
|
1312
|
-
var _c = __read(_a, 3), _d = _c[0], list = _d === void 0 ? [] : _d, _e = _c[1], step = _e === void 0 ? [] : _e, _f = _c[2], wrap = _f === void 0 ? [] : _f;
|
|
1313
|
-
var n = (_b = step[0]) !== null && _b !== void 0 ? _b : 1;
|
|
1314
|
-
if (wrap[0]) {
|
|
1315
|
-
n = n % (list.length || 1);
|
|
1316
|
-
}
|
|
1317
|
-
var shifted = list.slice(n);
|
|
1318
|
-
if (wrap[0]) {
|
|
1319
|
-
shifted.push.apply(shifted, __spreadArray([], __read(list.slice(0, n)), false));
|
|
1320
|
-
}
|
|
1321
|
-
return shifted;
|
|
1322
|
-
}),
|
|
1323
|
-
}];
|
|
1324
|
-
});
|
|
1325
|
-
}); },
|
|
1326
|
-
};
|
|
1327
|
-
|
|
1328
1295
|
var cartesianGroups = {
|
|
1329
1296
|
name: "cartesianGroups",
|
|
1330
1297
|
label: "Cartesian Groups",
|
|
@@ -1390,17 +1357,96 @@ var concat = {
|
|
|
1390
1357
|
}); },
|
|
1391
1358
|
};
|
|
1392
1359
|
|
|
1393
|
-
var
|
|
1394
|
-
|
|
1395
|
-
|
|
1396
|
-
|
|
1397
|
-
|
|
1398
|
-
|
|
1399
|
-
|
|
1400
|
-
|
|
1401
|
-
|
|
1402
|
-
|
|
1403
|
-
|
|
1360
|
+
var relativeItem = {
|
|
1361
|
+
name: "relativeItem",
|
|
1362
|
+
label: "Relative Item",
|
|
1363
|
+
description: "Pairs each item in the tree with its next item",
|
|
1364
|
+
inputs: {
|
|
1365
|
+
tree: { type: "any" },
|
|
1366
|
+
offset: { type: "number", default: 1, step: 1 },
|
|
1367
|
+
},
|
|
1368
|
+
params: {
|
|
1369
|
+
wrap: { type: "boolean", default: true },
|
|
1370
|
+
},
|
|
1371
|
+
outputs: {
|
|
1372
|
+
itemA: "any",
|
|
1373
|
+
itemB: "any",
|
|
1374
|
+
},
|
|
1375
|
+
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1376
|
+
return __generator(this, function (_a) {
|
|
1377
|
+
return [2 /*return*/, {
|
|
1378
|
+
itemA: inputs.tree || {},
|
|
1379
|
+
itemB: binaryOnTreeBranch(inputs.tree || {}, inputs.offset || {}, function (branch, offsets) {
|
|
1380
|
+
var mapped = branch.map(function (_, i) {
|
|
1381
|
+
var _a, _b;
|
|
1382
|
+
var offset = (_a = offsets[0]) !== null && _a !== void 0 ? _a : 1;
|
|
1383
|
+
var index = i + offset;
|
|
1384
|
+
if (params.wrap) {
|
|
1385
|
+
index = index % branch.length;
|
|
1386
|
+
if (index < 0)
|
|
1387
|
+
index += branch.length;
|
|
1388
|
+
}
|
|
1389
|
+
return (_b = branch[index]) !== null && _b !== void 0 ? _b : DISCARD;
|
|
1390
|
+
});
|
|
1391
|
+
return mapped.filter(function (v) { return v !== DISCARD; });
|
|
1392
|
+
}),
|
|
1393
|
+
}];
|
|
1394
|
+
});
|
|
1395
|
+
}); },
|
|
1396
|
+
};
|
|
1397
|
+
|
|
1398
|
+
var relativeItems = {
|
|
1399
|
+
name: "relativeItems",
|
|
1400
|
+
label: "Relative Items",
|
|
1401
|
+
description: "Pairs each item in the tree with an item in another tree at a specified offset",
|
|
1402
|
+
inputs: {
|
|
1403
|
+
treeA: { type: "any" },
|
|
1404
|
+
treeB: { type: "any" },
|
|
1405
|
+
offset: { type: "number", default: 1, step: 1 },
|
|
1406
|
+
},
|
|
1407
|
+
params: {
|
|
1408
|
+
wrap: { type: "boolean", default: true },
|
|
1409
|
+
},
|
|
1410
|
+
outputs: {
|
|
1411
|
+
itemA: "any",
|
|
1412
|
+
itemB: "any",
|
|
1413
|
+
},
|
|
1414
|
+
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1415
|
+
return __generator(this, function (_a) {
|
|
1416
|
+
return [2 /*return*/, {
|
|
1417
|
+
itemA: inputs.treeA || {},
|
|
1418
|
+
itemB: binaryOnTreeBranch(inputs.treeB || {}, inputs.offset || {}, function (branch, offsets) {
|
|
1419
|
+
var mapped = branch.map(function (_, i) {
|
|
1420
|
+
var _a, _b;
|
|
1421
|
+
var offset = (_a = offsets[0]) !== null && _a !== void 0 ? _a : 1;
|
|
1422
|
+
var index = i + offset;
|
|
1423
|
+
if (params.wrap) {
|
|
1424
|
+
index = index % branch.length;
|
|
1425
|
+
if (index < 0)
|
|
1426
|
+
index += branch.length;
|
|
1427
|
+
}
|
|
1428
|
+
return (_b = branch[index]) !== null && _b !== void 0 ? _b : DISCARD;
|
|
1429
|
+
});
|
|
1430
|
+
return mapped.filter(function (v) { return v !== DISCARD; });
|
|
1431
|
+
}),
|
|
1432
|
+
}];
|
|
1433
|
+
});
|
|
1434
|
+
}); },
|
|
1435
|
+
};
|
|
1436
|
+
|
|
1437
|
+
var _a$5;
|
|
1438
|
+
var primitives$5 = (_a$5 = {},
|
|
1439
|
+
_a$5[splitGroup.name] = splitGroup,
|
|
1440
|
+
_a$5[mergeGroup.name] = mergeGroup,
|
|
1441
|
+
_a$5[listItem.name] = listItem,
|
|
1442
|
+
_a$5[listLength.name] = listLength,
|
|
1443
|
+
_a$5[filterList.name] = filterList,
|
|
1444
|
+
// [shiftList.name]: shiftList,
|
|
1445
|
+
_a$5[relativeItem.name] = relativeItem,
|
|
1446
|
+
_a$5[relativeItems.name] = relativeItems,
|
|
1447
|
+
_a$5[cartesianGroups.name] = cartesianGroups,
|
|
1448
|
+
_a$5[concat.name] = concat,
|
|
1449
|
+
_a$5);
|
|
1404
1450
|
|
|
1405
1451
|
var series = {
|
|
1406
1452
|
name: "series",
|
|
@@ -1437,10 +1483,10 @@ var series = {
|
|
|
1437
1483
|
}); },
|
|
1438
1484
|
};
|
|
1439
1485
|
|
|
1440
|
-
var _a$
|
|
1441
|
-
var primitives$
|
|
1442
|
-
_a$
|
|
1443
|
-
_a$
|
|
1486
|
+
var _a$4;
|
|
1487
|
+
var primitives$4 = (_a$4 = {},
|
|
1488
|
+
_a$4[series.name] = series,
|
|
1489
|
+
_a$4);
|
|
1444
1490
|
|
|
1445
1491
|
var mergeTree = {
|
|
1446
1492
|
name: "mergeTree",
|
|
@@ -1493,11 +1539,11 @@ var simplifyTree = {
|
|
|
1493
1539
|
}); },
|
|
1494
1540
|
};
|
|
1495
1541
|
|
|
1496
|
-
var _a$
|
|
1497
|
-
var primitives$
|
|
1498
|
-
_a$
|
|
1499
|
-
_a$
|
|
1500
|
-
_a$
|
|
1542
|
+
var _a$3;
|
|
1543
|
+
var primitives$3 = (_a$3 = {},
|
|
1544
|
+
_a$3[mergeTree.name] = mergeTree,
|
|
1545
|
+
_a$3[simplifyTree.name] = simplifyTree,
|
|
1546
|
+
_a$3);
|
|
1501
1547
|
|
|
1502
1548
|
var groupAnd = {
|
|
1503
1549
|
name: "groupAnd",
|
|
@@ -1541,17 +1587,17 @@ var groupOr = {
|
|
|
1541
1587
|
}); },
|
|
1542
1588
|
};
|
|
1543
1589
|
|
|
1544
|
-
var _a$
|
|
1545
|
-
var primitives$
|
|
1546
|
-
_a$
|
|
1547
|
-
_a$
|
|
1548
|
-
_a$
|
|
1590
|
+
var _a$2;
|
|
1591
|
+
var primitives$2 = (_a$2 = {},
|
|
1592
|
+
_a$2[groupAnd.name] = groupAnd,
|
|
1593
|
+
_a$2[groupOr.name] = groupOr,
|
|
1594
|
+
_a$2);
|
|
1549
1595
|
|
|
1550
|
-
var
|
|
1551
|
-
name: "
|
|
1552
|
-
label: "
|
|
1553
|
-
description: "Data
|
|
1554
|
-
nodeType: "
|
|
1596
|
+
var inputs = {
|
|
1597
|
+
name: "inputs",
|
|
1598
|
+
label: "Input",
|
|
1599
|
+
description: "Data input.",
|
|
1600
|
+
nodeType: "Input",
|
|
1555
1601
|
inputs: {},
|
|
1556
1602
|
outputs: {},
|
|
1557
1603
|
impl: function () { return __awaiter(void 0, void 0, void 0, function () {
|
|
@@ -1561,11 +1607,11 @@ var output = {
|
|
|
1561
1607
|
}); },
|
|
1562
1608
|
};
|
|
1563
1609
|
|
|
1564
|
-
var
|
|
1565
|
-
name: "
|
|
1566
|
-
label: "
|
|
1567
|
-
description: "Data
|
|
1568
|
-
nodeType: "
|
|
1610
|
+
var output = {
|
|
1611
|
+
name: "output",
|
|
1612
|
+
label: "Output",
|
|
1613
|
+
description: "Data output.",
|
|
1614
|
+
nodeType: "Output",
|
|
1569
1615
|
inputs: {},
|
|
1570
1616
|
outputs: {},
|
|
1571
1617
|
impl: function () { return __awaiter(void 0, void 0, void 0, function () {
|
|
@@ -1575,8 +1621,14 @@ var inputs = {
|
|
|
1575
1621
|
}); },
|
|
1576
1622
|
};
|
|
1577
1623
|
|
|
1578
|
-
var
|
|
1579
|
-
var primitives =
|
|
1624
|
+
var _a$1;
|
|
1625
|
+
var primitives$1 = (_a$1 = {},
|
|
1626
|
+
_a$1[inputs.name] = inputs,
|
|
1627
|
+
_a$1[output.name] = output,
|
|
1628
|
+
_a$1);
|
|
1629
|
+
|
|
1630
|
+
var Lib = { Util: primitives$7, Math: primitives$6, List: primitives$5, Sequence: primitives$4, Tree: primitives$3, Logic: primitives$2, IO: primitives$1 };
|
|
1631
|
+
var primitives = __assign(__assign(__assign(__assign(__assign(__assign(__assign({}, primitives$1), primitives$7), primitives$6), primitives$5), primitives$4), primitives$3), primitives$2);
|
|
1580
1632
|
|
|
1581
1633
|
function isPrimitive(node) {
|
|
1582
1634
|
return node.impl !== undefined;
|