@rkmodules/rules 0.0.96 → 0.0.98

package/dist/index.cjs.js

@@ -257,9 +257,26 @@ function broadCast(value) {
 function getBranch(tree, path) {
     return tree[path];
 }
+function getBranches(tree) {
+    return Object.values(tree);
+}
 function getPaths(tree) {
     return Object.keys(tree);
 }
+function forEachBranch(tree, fn) {
+    var paths = getPaths(tree);
+    paths.forEach(function (path, i) {
+        var branch = tree[path];
+        fn(branch, path, i);
+    });
+}
+function forEachItem(tree, fn) {
+    forEachBranch(tree, function (branch, path, pathIndex) {
+        branch.forEach(function (item, i) {
+            fn(item, path, pathIndex, i);
+        });
+    });
+}
 /**
  * maps a tree, the tree branches are flatmapped, so if an array is returned for each item in the list, a flat list is returned
  * @param tree
@@ -1560,7 +1577,9 @@ var listInput = {
                     tree: mapTreeBranch(inputs.list || {}, function (branch) {
                         if (!branch || branch.length === 0)
                             return DISCARD;
-                        var allLines = branch.flatMap(function (text) { return text.split("\n"); });
+                        var allLines = branch.flatMap(function (text) {
+                            return text.replace(/(^[\n\r]+)|([\n\r]+$)/, "").split("\n");
+                        });
                         if (allLines.every(function (line) { return isBoolStr(line); })) {
                             allLines = allLines.map(function (line) { return line.toLowerCase() === "true"; });
                         }
@@ -7250,7 +7269,10 @@ exports.binaryOnTree = binaryOnTree;
 exports.binaryOnTreeBranch = binaryOnTreeBranch;
 exports.broadCast = broadCast;
 exports.expandTree = expandTree;
+exports.forEachBranch = forEachBranch;
+exports.forEachItem = forEachItem;
 exports.getBranch = getBranch;
+exports.getBranches = getBranches;
 exports.getPaths = getPaths;
 exports.getPositions = getPositions;
 exports.getReferences = getReferences;