@rkmodules/rules 0.0.149 → 0.0.151

package/dist/index.esm.js

@@ -701,9 +701,6 @@ function interpolate(inputs, scope) {
     }));
 }
 
-/**
- * TODO: need rank polymorhism on the tree item sizes
- */
 var getValue = {
     name: "getValue",
     label: "Get Value",
@@ -712,20 +709,24 @@ var getValue = {
         tree: "any",
         path: "string",
     },
+    params: {
+        removeEmpty: { type: "boolean", default: false, label: "remove empty" },
+    },
     outputs: {
         tree: "any",
     },
-    // TODO: may want to do something with other values of path
-    impl: function (inputs, params) { return __awaiter(void 0, void 0, void 0, function () {
-        var paths, tree;
-        return __generator(this, function (_a) {
-            paths = toArray(inputs.path || {});
-            tree = mapTree(inputs.tree || {}, function (value) {
-                // get the property from the object
-                var val = getValue$1(value, paths[0]);
+    impl: function (_a, params_1) { return __awaiter(void 0, [_a, params_1], void 0, function (_b, params) {
+        var result;
+        var _c = _b.tree, tree = _c === void 0 ? {} : _c, _d = _b.path, path = _d === void 0 ? {} : _d;
+        return __generator(this, function (_e) {
+            result = binaryOnTree(tree, path, function (value, path) {
+                var val = getValue$1(value, path);
+                if ((val === undefined || val === null) && params.removeEmpty) {
+                    return DISCARD;
+                }
                 return val;
-            });
-            return [2 /*return*/, { tree: tree }];
+            }, true);
+            return [2 /*return*/, { tree: result }];
         });
     }); },
 };
@@ -1552,7 +1553,7 @@ var filterList = {
         keep: "boolean",
     },
     params: {
-        removeEmpty: { type: "boolean", default: false },
+        removeEmpty: { type: "boolean", default: false, label: "remove empty" },
     },
     outputs: {
         list: "any",
@@ -1964,7 +1965,7 @@ var mergeTree = {
     name: "mergeTree",
     label: "Merge Tree",
     description: "Merge groups with the same index into a single tree.",
-    nodeType: "NamedInput",
+    nodeType: "DynamicInput",
     inputs: {},
     outputs: {
         result: "any",
@@ -8484,5 +8485,5 @@ function DDContext(_a) {
     return React.createElement(DndProvider, { backend: HTML5Backend }, children);
 }
 
-export { DDContext, DISCARD, Engine, Flow, FlowContext, GenericNode, Input, Lib, Output, Param, binaryOnTree, binaryOnTreeBranch, broadCast, deRefEdgeHandle, 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, safeName, sameShape, simplifyTree$1 as simplifyTree, toArray, topSort, treeSize, treeStats, trimTree, uid$1 as uid, useControls, useDraggableNode, useEngine, useFlow, useFunction, useGraphedFunction, usePositions, usePrompts, useUpdatePositions, useVariable, variableStore };
+export { Control, DDContext, DISCARD, Engine, Flow, FlowContext, GenericNode, Input, Lib, Output, Param, binaryOnTree, binaryOnTreeBranch, broadCast, deRefEdgeHandle, 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, safeName, sameShape, simplifyTree$1 as simplifyTree, toArray, topSort, treeSize, treeStats, trimTree, uid$1 as uid, useControls, useDraggableNode, useEngine, useFlow, useFunction, useGraphedFunction, usePositions, usePrompts, useUpdatePositions, useVariable, variableStore };
 //# sourceMappingURL=index.esm.js.map