@rkmodules/rules 0.0.129 → 0.0.131

package/dist/index.esm.js

@@ -371,10 +371,13 @@ function forEachItem(tree, fn) {
         });
     });
 }
-function pushItem(tree, path, item) {
+function ensureBranch(tree, path) {
     if (!tree[path]) {
         tree[path] = [];
     }
+}
+function pushItem(tree, path, item) {
+    ensureBranch(tree, path);
     tree[path].push(item);
 }
 /**
@@ -2457,6 +2460,7 @@ var explodeObject = {
     },
     params: {
         split: { type: "boolean", default: false, label: "split groups" },
+        removeEmpty: { type: "boolean", default: false, label: "remove empty" },
     },
     outputs: {
     // values: "any",
@@ -2473,6 +2477,10 @@ var explodeObject = {
                 branch.forEach(function (obj, index) {
                     if (!obj)
                         return;
+                    if (typeof obj !== "object")
+                        obj = null;
+                    if (obj === null && params.removeEmpty)
+                        ;
                     var props = obj || {};
                     Object.entries(props).forEach(function (_a) {
                         var _b = __read(_a, 2), key = _b[0], value = _b[1];
@@ -2487,6 +2495,15 @@ var explodeObject = {
                     });
                 });
             });
+            if (!params.removeEmpty) {
+                // ensure the same branches exist in the output even if they are empty, so that the outputs don't change shape when empty branches are added or removed from the input
+                Object.entries(outputs).forEach(function (_a) {
+                    var _b = __read(_a, 2); _b[0]; var tree = _b[1];
+                    forEachBranch(object, function (branch, path) {
+                        ensureBranch(tree, path);
+                    });
+                });
+            }
             return [2 /*return*/, outputs];
         });
     }); },
@@ -8156,5 +8173,5 @@ function DDContext(_a) {
     return React.createElement(DndProvider, { backend: HTML5Backend }, children);
 }
 
-export { DDContext, DISCARD, Engine, Flow, GenericNode, Lib, binaryOnTree, binaryOnTreeBranch, broadCast, expandTree, forEachBranch, forEachItem, getBranch, getBranches, getItem, getPaths, getPositions, getReferences, getValue$1 as getValue, getVariable, graftTree, hasReference, interpolate, isEmpty, isEmptyTree, isReference, isSingleTon, isTree, mapTree, mapTreeBranch, nAryOnTree, nAryOnTreeBranch, normalizePaths, normalizeVarDef, parseReference, primitives, pushItem, sameShape, simplifyTree$1 as simplifyTree, toArray, topSort, treeSize, treeStats, trimTree, uid$1 as uid, useDraggableNode, useFlow, useFunction, usePositions, useUpdatePositions, useVariable, variableStore };
+export { DDContext, DISCARD, Engine, Flow, GenericNode, Lib, binaryOnTree, binaryOnTreeBranch, broadCast, ensureBranch, expandTree, forEachBranch, forEachItem, getBranch, getBranches, getItem, getPaths, getPositions, getReferences, getValue$1 as getValue, getVariable, graftTree, hasReference, interpolate, isEmpty, isEmptyTree, isReference, isSingleTon, isTree, mapTree, mapTreeBranch, nAryOnTree, nAryOnTreeBranch, normalizePaths, normalizeVarDef, parseReference, primitives, pushItem, sameShape, simplifyTree$1 as simplifyTree, toArray, topSort, treeSize, treeStats, trimTree, uid$1 as uid, useDraggableNode, useFlow, useFunction, usePositions, useUpdatePositions, useVariable, variableStore };
 //# sourceMappingURL=index.esm.js.map