@rkmodules/rules 0.0.59 → 0.0.61

package/dist/index.cjs.js

@@ -259,14 +259,14 @@ function getBranch(tree, path) {
  * @returns
  */
 function mapTree(tree, fn) {
-    return nAryOnTree([tree], function (_a, _b, index) {
+    return nAryOnTree([tree], function mapTreeCallback(_a, _b, index) {
         var _c = __read(_a, 1), item = _c[0];
         var _d = __read(_b, 1), path = _d[0];
         return fn(item, path, index);
     });
 }
 function mapTreeBranch(tree, fn) {
-    return nAryOnTreeBranch([tree], function (_a, _b) {
+    return nAryOnTreeBranch([tree], function mapTreeBranchCallback(_a, _b) {
         var _c = __read(_a, 1), branch = _c[0];
         var _d = __read(_b, 1), path = _d[0];
         return fn(branch, path);
@@ -319,7 +319,7 @@ function nAryOnTreeBranch(trees, fn) {
  * @returns
  */
 function nAryOnTree(trees, fn, fill) {
-    return nAryOnTreeBranch(trees, function (branches, paths) {
+    return nAryOnTreeBranch(trees, function nAryOnTreeCallback(branches, paths) {
         var maxLength = Math.max.apply(Math, __spreadArray([], __read(branches.map(function (b) { return b.length; })), false));
         if (maxLength === 0)
             return; // Skip empty branches
@@ -356,7 +356,7 @@ function nAryOnTree(trees, fn, fill) {
  * @returns
  */
 function binaryOnTreeBranch(treeA, treeB, fn) {
-    return nAryOnTreeBranch([treeA, treeB], function (_a, _b) {
+    return nAryOnTreeBranch([treeA, treeB], function binaryOnTreeBranchCallback(_a, _b) {
         var _c = __read(_a, 2), branchA = _c[0], branchB = _c[1];
         var _d = __read(_b, 2), pathA = _d[0], pathB = _d[1];
         return fn(branchA, branchB, pathA, pathB);
@@ -375,7 +375,7 @@ function binaryOnTreeBranch(treeA, treeB, fn) {
  * @returns
  */
 function binaryOnTree(treeA, treeB, fn, fill) {
-    return nAryOnTree([treeA, treeB], function (_a, _b, index) {
+    return nAryOnTree([treeA, treeB], function binaryOnTreeCallback(_a, _b, index) {
         var _c = __read(_a, 2), itemA = _c[0], itemB = _c[1];
         var _d = __read(_b, 2), pathA = _d[0], pathB = _d[1];
         return fn(itemA, itemB, pathA, pathB, index);
@@ -1547,15 +1547,24 @@ var Engine = /** @class */ (function () {
         return newFn;
     };
     Engine.prototype.applyEdgeDelete = function (oldFn, fromNode, toNode, fromField, toField) {
+        var _a;
         var newFn = __assign(__assign({}, oldFn), { body: __assign({}, oldFn.body) });
         var from = newFn.body[fromNode];
         var to = newFn.body[toNode];
+        var fn = this.fnIndex[to === null || to === void 0 ? void 0 : to.name];
         if (!from || !to) {
             console.warn("Invalid nodes for edge deletion");
             return newFn;
         }
         if (to.inputs && to.inputs[toField] === "<".concat(fromNode, ".").concat(fromField, ">")) {
+            // revert to default value if exists
             delete to.inputs[toField];
+            if ((_a = fn.inputs) === null || _a === void 0 ? void 0 : _a[toField]) {
+                var normDef = normalizeVarDef(fn.inputs[toField]);
+                if (normDef.default !== undefined) {
+                    to.inputs[toField] = normDef.default;
+                }
+            }
         }
         else {
             console.warn("No matching edge found to delete");