@rkmodules/rules 0.0.76 → 0.0.77

package/dist/index.cjs.js

@@ -1292,39 +1292,6 @@ var mergeGroup = {
     }); },
 };
 
-var shiftList = {
-    name: "shiftList",
-    label: "Shift List",
-    description: "Shifts the list to the left, removing the first element and adding it at the end if wrap is enabled",
-    inputs: {
-        list: "any",
-        step: { type: "number", default: 1, step: 1 },
-        wrap: "boolean",
-    },
-    outputs: {
-        list: "any",
-    },
-    impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
-        return __generator(this, function (_a) {
-            return [2 /*return*/, {
-                    list: nAryOnTreeBranch([inputs.list || {}, inputs.step || {}, inputs.wrap || {}], function (_a) {
-                        var _b;
-                        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;
-                        var n = (_b = step[0]) !== null && _b !== void 0 ? _b : 1;
-                        if (wrap[0]) {
-                            n = n % (list.length || 1);
-                        }
-                        var shifted = list.slice(n);
-                        if (wrap[0]) {
-                            shifted.push.apply(shifted, __spreadArray([], __read(list.slice(0, n)), false));
-                        }
-                        return shifted;
-                    }),
-                }];
-        });
-    }); },
-};
-
 var cartesianGroups = {
     name: "cartesianGroups",
     label: "Cartesian Groups",
@@ -1390,6 +1357,83 @@ var concat = {
     }); },
 };
 
+var relativeItem = {
+    name: "relativeItem",
+    label: "Relative Item",
+    description: "Pairs each item in the tree with its next item",
+    inputs: {
+        tree: { type: "any" },
+        offset: { type: "number", default: 1, step: 1 },
+    },
+    params: {
+        wrap: { type: "boolean", default: true },
+    },
+    outputs: {
+        itemA: "any",
+        itemB: "any",
+    },
+    impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
+        return __generator(this, function (_a) {
+            return [2 /*return*/, {
+                    itemA: inputs.tree || {},
+                    itemB: binaryOnTreeBranch(inputs.tree || {}, inputs.offset || {}, function (branch, offsets) {
+                        var mapped = branch.map(function (_, i) {
+                            var _a, _b;
+                            var offset = (_a = offsets[0]) !== null && _a !== void 0 ? _a : 1;
+                            var index = i + offset;
+                            if (params.wrap) {
+                                index = index % branch.length;
+                                if (index < 0)
+                                    index += branch.length;
+                            }
+                            return (_b = branch[index]) !== null && _b !== void 0 ? _b : DISCARD;
+                        });
+                        return mapped.filter(function (v) { return v !== DISCARD; });
+                    }),
+                }];
+        });
+    }); },
+};
+
+var relativeItems = {
+    name: "relativeItems",
+    label: "Relative Items",
+    description: "Pairs each item in the tree with an item in another tree at a specified offset",
+    inputs: {
+        treeA: { type: "any" },
+        treeB: { type: "any" },
+        offset: { type: "number", default: 1, step: 1 },
+    },
+    params: {
+        wrap: { type: "boolean", default: true },
+    },
+    outputs: {
+        itemA: "any",
+        itemB: "any",
+    },
+    impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
+        return __generator(this, function (_a) {
+            return [2 /*return*/, {
+                    itemA: inputs.treeA || {},
+                    itemB: binaryOnTreeBranch(inputs.treeB || {}, inputs.offset || {}, function (branch, offsets) {
+                        var mapped = branch.map(function (_, i) {
+                            var _a, _b;
+                            var offset = (_a = offsets[0]) !== null && _a !== void 0 ? _a : 1;
+                            var index = i + offset;
+                            if (params.wrap) {
+                                index = index % branch.length;
+                                if (index < 0)
+                                    index += branch.length;
+                            }
+                            return (_b = branch[index]) !== null && _b !== void 0 ? _b : DISCARD;
+                        });
+                        return mapped.filter(function (v) { return v !== DISCARD; });
+                    }),
+                }];
+        });
+    }); },
+};
+
 var _a$5;
 var primitives$5 = (_a$5 = {},
     _a$5[splitGroup.name] = splitGroup,
@@ -1397,7 +1441,9 @@ var primitives$5 = (_a$5 = {},
     _a$5[listItem.name] = listItem,
     _a$5[listLength.name] = listLength,
     _a$5[filterList.name] = filterList,
-    _a$5[shiftList.name] = shiftList,
+    // [shiftList.name]: shiftList,
+    _a$5[relativeItem.name] = relativeItem,
+    _a$5[relativeItems.name] = relativeItems,
     _a$5[cartesianGroups.name] = cartesianGroups,
     _a$5[concat.name] = concat,
     _a$5);