@rkmodules/rules 0.0.64 → 0.0.66

package/dist/index.cjs.js

@@ -271,7 +271,7 @@ function mapTreeBranch(tree, fn) {
     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);
+        return fn(branch || [], path);
     });
 }
 /**
@@ -291,12 +291,12 @@ function nAryOnTreeBranch(trees, fn) {
     var maxBranches = Math.max.apply(Math, __spreadArray([], __read(allKeys.map(function (keys) { return keys.length; })), false));
     var _loop_2 = function (i) {
         var paths = allKeys.map(function (keys) { return keys[Math.min(i, keys.length - 1)]; });
-        var branches = trees.map(function (tree) { return tree[paths[trees.indexOf(tree)]] || []; });
+        var branches = trees.map(function (tree) { return tree[paths[trees.indexOf(tree)]]; });
         // get all the paths of which the trees are the longest, use the first
         var maxPaths = paths.filter(function (_, i) { return allKeys[i].length === maxBranches; });
         var path = maxPaths[0];
         var newBranch = fn(branches, paths);
-        if (newBranch === null || newBranch === void 0 ? void 0 : newBranch.length) {
+        if (newBranch !== DISCARD) {
             result[path] = newBranch;
         }
     };
@@ -322,12 +322,14 @@ function nAryOnTreeBranch(trees, fn) {
  */
 function nAryOnTree(trees, fn, fill) {
     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
+        var maxLength = Math.max.apply(Math, __spreadArray([], __read(branches.map(function (b) {
+            if (b === void 0) { b = []; }
+            return b.length;
+        })), false));
         var results = [];
         var _loop_3 = function (i) {
             var items = branches.map(function (b) {
+                if (b === void 0) { b = []; }
                 if (fill) {
                     // repeat last item if index exceeds branch length
                     return b[Math.min(i, b.length - 1)];
@@ -361,7 +363,7 @@ function binaryOnTreeBranch(treeA, treeB, fn) {
     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);
+        return fn(branchA || [], branchB || [], pathA, pathB);
     });
 }
 /**