@rkmodules/rules 0.0.76 → 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.esm.js
CHANGED
|
@@ -1290,39 +1290,6 @@ var mergeGroup = {
|
|
|
1290
1290
|
}); },
|
|
1291
1291
|
};
|
|
1292
1292
|
|
|
1293
|
-
var shiftList = {
|
|
1294
|
-
name: "shiftList",
|
|
1295
|
-
label: "Shift List",
|
|
1296
|
-
description: "Shifts the list to the left, removing the first element and adding it at the end if wrap is enabled",
|
|
1297
|
-
inputs: {
|
|
1298
|
-
list: "any",
|
|
1299
|
-
step: { type: "number", default: 1, step: 1 },
|
|
1300
|
-
wrap: "boolean",
|
|
1301
|
-
},
|
|
1302
|
-
outputs: {
|
|
1303
|
-
list: "any",
|
|
1304
|
-
},
|
|
1305
|
-
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1306
|
-
return __generator(this, function (_a) {
|
|
1307
|
-
return [2 /*return*/, {
|
|
1308
|
-
list: nAryOnTreeBranch([inputs.list || {}, inputs.step || {}, inputs.wrap || {}], function (_a) {
|
|
1309
|
-
var _b;
|
|
1310
|
-
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;
|
|
1311
|
-
var n = (_b = step[0]) !== null && _b !== void 0 ? _b : 1;
|
|
1312
|
-
if (wrap[0]) {
|
|
1313
|
-
n = n % (list.length || 1);
|
|
1314
|
-
}
|
|
1315
|
-
var shifted = list.slice(n);
|
|
1316
|
-
if (wrap[0]) {
|
|
1317
|
-
shifted.push.apply(shifted, __spreadArray([], __read(list.slice(0, n)), false));
|
|
1318
|
-
}
|
|
1319
|
-
return shifted;
|
|
1320
|
-
}),
|
|
1321
|
-
}];
|
|
1322
|
-
});
|
|
1323
|
-
}); },
|
|
1324
|
-
};
|
|
1325
|
-
|
|
1326
1293
|
var cartesianGroups = {
|
|
1327
1294
|
name: "cartesianGroups",
|
|
1328
1295
|
label: "Cartesian Groups",
|
|
@@ -1388,6 +1355,83 @@ var concat = {
|
|
|
1388
1355
|
}); },
|
|
1389
1356
|
};
|
|
1390
1357
|
|
|
1358
|
+
var relativeItem = {
|
|
1359
|
+
name: "relativeItem",
|
|
1360
|
+
label: "Relative Item",
|
|
1361
|
+
description: "Pairs each item in the tree with its next item",
|
|
1362
|
+
inputs: {
|
|
1363
|
+
tree: { type: "any" },
|
|
1364
|
+
offset: { type: "number", default: 1, step: 1 },
|
|
1365
|
+
},
|
|
1366
|
+
params: {
|
|
1367
|
+
wrap: { type: "boolean", default: true },
|
|
1368
|
+
},
|
|
1369
|
+
outputs: {
|
|
1370
|
+
itemA: "any",
|
|
1371
|
+
itemB: "any",
|
|
1372
|
+
},
|
|
1373
|
+
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1374
|
+
return __generator(this, function (_a) {
|
|
1375
|
+
return [2 /*return*/, {
|
|
1376
|
+
itemA: inputs.tree || {},
|
|
1377
|
+
itemB: binaryOnTreeBranch(inputs.tree || {}, inputs.offset || {}, function (branch, offsets) {
|
|
1378
|
+
var mapped = branch.map(function (_, i) {
|
|
1379
|
+
var _a, _b;
|
|
1380
|
+
var offset = (_a = offsets[0]) !== null && _a !== void 0 ? _a : 1;
|
|
1381
|
+
var index = i + offset;
|
|
1382
|
+
if (params.wrap) {
|
|
1383
|
+
index = index % branch.length;
|
|
1384
|
+
if (index < 0)
|
|
1385
|
+
index += branch.length;
|
|
1386
|
+
}
|
|
1387
|
+
return (_b = branch[index]) !== null && _b !== void 0 ? _b : DISCARD;
|
|
1388
|
+
});
|
|
1389
|
+
return mapped.filter(function (v) { return v !== DISCARD; });
|
|
1390
|
+
}),
|
|
1391
|
+
}];
|
|
1392
|
+
});
|
|
1393
|
+
}); },
|
|
1394
|
+
};
|
|
1395
|
+
|
|
1396
|
+
var relativeItems = {
|
|
1397
|
+
name: "relativeItems",
|
|
1398
|
+
label: "Relative Items",
|
|
1399
|
+
description: "Pairs each item in the tree with an item in another tree at a specified offset",
|
|
1400
|
+
inputs: {
|
|
1401
|
+
treeA: { type: "any" },
|
|
1402
|
+
treeB: { type: "any" },
|
|
1403
|
+
offset: { type: "number", default: 1, step: 1 },
|
|
1404
|
+
},
|
|
1405
|
+
params: {
|
|
1406
|
+
wrap: { type: "boolean", default: true },
|
|
1407
|
+
},
|
|
1408
|
+
outputs: {
|
|
1409
|
+
itemA: "any",
|
|
1410
|
+
itemB: "any",
|
|
1411
|
+
},
|
|
1412
|
+
impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
|
|
1413
|
+
return __generator(this, function (_a) {
|
|
1414
|
+
return [2 /*return*/, {
|
|
1415
|
+
itemA: inputs.treeA || {},
|
|
1416
|
+
itemB: binaryOnTreeBranch(inputs.treeB || {}, inputs.offset || {}, function (branch, offsets) {
|
|
1417
|
+
var mapped = branch.map(function (_, i) {
|
|
1418
|
+
var _a, _b;
|
|
1419
|
+
var offset = (_a = offsets[0]) !== null && _a !== void 0 ? _a : 1;
|
|
1420
|
+
var index = i + offset;
|
|
1421
|
+
if (params.wrap) {
|
|
1422
|
+
index = index % branch.length;
|
|
1423
|
+
if (index < 0)
|
|
1424
|
+
index += branch.length;
|
|
1425
|
+
}
|
|
1426
|
+
return (_b = branch[index]) !== null && _b !== void 0 ? _b : DISCARD;
|
|
1427
|
+
});
|
|
1428
|
+
return mapped.filter(function (v) { return v !== DISCARD; });
|
|
1429
|
+
}),
|
|
1430
|
+
}];
|
|
1431
|
+
});
|
|
1432
|
+
}); },
|
|
1433
|
+
};
|
|
1434
|
+
|
|
1391
1435
|
var _a$5;
|
|
1392
1436
|
var primitives$5 = (_a$5 = {},
|
|
1393
1437
|
_a$5[splitGroup.name] = splitGroup,
|
|
@@ -1395,7 +1439,9 @@ var primitives$5 = (_a$5 = {},
|
|
|
1395
1439
|
_a$5[listItem.name] = listItem,
|
|
1396
1440
|
_a$5[listLength.name] = listLength,
|
|
1397
1441
|
_a$5[filterList.name] = filterList,
|
|
1398
|
-
|
|
1442
|
+
// [shiftList.name]: shiftList,
|
|
1443
|
+
_a$5[relativeItem.name] = relativeItem,
|
|
1444
|
+
_a$5[relativeItems.name] = relativeItems,
|
|
1399
1445
|
_a$5[cartesianGroups.name] = cartesianGroups,
|
|
1400
1446
|
_a$5[concat.name] = concat,
|
|
1401
1447
|
_a$5);
|