@rkmodules/rules 0.0.136 → 0.0.138

package/dist/index.esm.js

@@ -1772,15 +1772,53 @@ var uniqueItems = {
     inputs: {
         items: "any",
     },
+    params: {
+        excludeEmpty: {
+            type: "boolean",
+            default: false,
+            label: "remove empty",
+        },
+    },
     outputs: {
         unique: "any",
     },
-    impl: function (_a) { return __awaiter(void 0, [_a], void 0, function (_b) {
+    impl: function (_a, params_1) { return __awaiter(void 0, [_a, params_1], void 0, function (_b, params) {
+        var noEmpty;
         var _c = _b.items, items = _c === void 0 ? {} : _c;
         return __generator(this, function (_d) {
+            noEmpty = params.excludeEmpty;
             return [2 /*return*/, {
                     unique: mapTreeBranch(items, function (items) {
-                        return Array.from(new Set(items));
+                        var unique = new Set(items);
+                        if (noEmpty) {
+                            unique.delete(undefined);
+                            unique.delete(null);
+                        }
+                        return Array.from(unique);
+                    }),
+                }];
+        });
+    }); },
+};
+
+var coalesce = {
+    name: "coalesce",
+    label: "Coalesce Items",
+    description: "Outputs the first item if it's not empty, otherwise the second item",
+    inputs: {
+        treeA: { type: "any" },
+        treeB: { type: "any" },
+    },
+    outputs: {
+        tree: "any",
+    },
+    impl: function (_a, params_1) { return __awaiter(void 0, [_a, params_1], void 0, function (_b, params) {
+        var _c = _b.treeA, treeA = _c === void 0 ? {} : _c, _d = _b.treeB, treeB = _d === void 0 ? {} : _d;
+        return __generator(this, function (_e) {
+            return [2 /*return*/, {
+                    tree: nAryOnTree([treeA, treeB], function (_a) {
+                        var _b = __read(_a, 2), itemA = _b[0], itemB = _b[1];
+                        return itemA !== undefined && itemA !== null ? itemA : itemB;
                     }),
                 }];
         });
@@ -1796,6 +1834,7 @@ var primitives$6 = (_a$6 = {},
     _a$6[relativeItem.name] = relativeItem,
     _a$6[relativeItems.name] = relativeItems,
     _a$6[concat.name] = concat,
+    _a$6[coalesce.name] = coalesce,
     _a$6[uniqueItems.name] = uniqueItems,
     _a$6);
 
@@ -6654,9 +6693,13 @@ var OutputNode = React.memo(function (_a) {
                     newName = _b.sent();
                     if (newName !== null && newName !== oldName) {
                         (_a = data.onIOChange) === null || _a === void 0 ? void 0 : _a.call(data, function (fn) {
+                            var keys = Object.keys(fn.outputs || {});
+                            var newKeys = keys.map(function (key) {
+                                return key === oldName ? newName : key;
+                            });
                             var outputs = __assign({}, fn.outputs);
                             outputs[newName] = outputs[oldName];
-                            delete outputs[oldName];
+                            outputs = Object.fromEntries(newKeys.map(function (key) { return [key, outputs[key]]; }));
                             return { outputs: outputs };
                         });
                     }