@rkmodules/rules 0.0.76 → 0.0.78

package/dist/index.cjs.js

@@ -564,11 +564,9 @@ var getValue = {
         var paths, tree;
         return __generator(this, function (_a) {
             paths = toArray(inputs.path || {});
-            tree = mapTree(inputs.tree, function (value) {
+            tree = mapTree(inputs.tree || {}, function (value) {
                 // get the property from the object
                 var val = getValue$1(value, paths[0]);
-                if (val === undefined)
-                    return DISCARD;
                 return val;
             });
             return [2 /*return*/, { tree: tree }];
@@ -1231,11 +1229,24 @@ var listItem = {
         return __generator(this, function (_a) {
             item = binaryOnTreeBranch(inputs.list || {}, inputs.index || {}, function (branch, indices) {
                 if (indices) {
-                    return indices.map(function (i) { return branch[i]; });
+                    var n_1 = branch.length;
+                    return indices.map(function (i) {
+                        i = i % n_1;
+                        if (i < 0)
+                            i += n_1;
+                        return branch[i];
+                    });
                 }
                 return DISCARD;
             });
             others = binaryOnTreeBranch(inputs.list || {}, inputs.index || {}, function (branch, indices) {
+                var n = branch.length;
+                indices = indices.map(function (i) {
+                    i = i % n;
+                    if (i < 0)
+                        i += n;
+                    return i;
+                });
                 return branch.filter(function (_, i) { return !(indices === null || indices === void 0 ? void 0 : indices.includes(i)); });
             });
             return [2 /*return*/, {
@@ -1292,39 +1303,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 +1368,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 +1452,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);
@@ -5269,7 +5326,26 @@ function uid() {
     return Math.random().toString(36).substring(2, 15);
 }
 var Merge = React.memo(function (_a) {
+    var _b;
+    var _c;
     var id = _a.id, data = _a.data, selected = _a.selected;
+    var outputEntries = Object.entries(data.outputDefs || {});
+    var focus = (_c = outputEntries[0]) === null || _c === void 0 ? void 0 : _c[0];
+    var _d = __read(React.useState(false), 2), showPreview = _d[0], setShowPreview = _d[1];
+    var engine = useEngine();
+    var _e = __read(React.useState({}), 2), result = _e[0], setResult = _e[1];
+    var _f = __read(React.useState(null), 2), duration = _f[0], setDuration = _f[1];
+    var previewValue = focus ? result[focus] : Object.values(result)[0];
+    React.useEffect(function () {
+        return engine.subscribe("functionResult", function (event) {
+            var _a;
+            console.log("functionresult", event.name, event);
+            if (event.name === id) {
+                setResult(event.result || {});
+                setDuration((_a = event.duration) !== null && _a !== void 0 ? _a : null);
+            }
+        });
+    }, []);
     var inputs = Object.fromEntries(Object.keys(data.inputs || {}).map(function (name, i) { return [
         name,
         { type: "any", label: "D".concat(i + 1) },
@@ -5287,7 +5363,15 @@ var Merge = React.memo(function (_a) {
             Object.entries(inputs || {}).map(function (_a) {
                 var _b = __read(_a, 2), name = _b[0], varDef = _b[1];
                 return (React.createElement(Input, { key: name, name: name, varDef: varDef, id: id, data: data }));
-            }))));
+            })),
+        React.createElement("div", { className: classNames(styles.PreviewHead, (_b = {},
+                _b[styles.expanded] = showPreview,
+                _b)), onClick: function () { return setShowPreview(!showPreview); } }, "Preview"),
+        showPreview && (React.createElement("div", { className: styles.Preview },
+            React.createElement(TreeView, { value: previewValue }),
+            duration !== null && (React.createElement("div", { className: styles.Duration },
+                duration.toFixed(2),
+                " ms"))))));
 });
 Merge.displayName = "MergeNode";