@rkmodules/rules 0.0.100 → 0.0.102

package/dist/index.esm.js

@@ -267,6 +267,74 @@ function getItem(tree, path, index) {
         return branch[index];
     }
 }
+/**
+ * gets number of dimensions (max depth of the tree) and their sizes (group sizes at each level)
+ * @param tree
+ * @returns
+ */
+function treeStats(tree) {
+    var paths = getPaths(tree);
+    var dimensions = 0;
+    var branchSizes = {};
+    paths.forEach(function (path) {
+        var _a;
+        var segments = path.split(";").map(function (seg) { return parseInt(seg, 10); });
+        // find max depth, which is the number of dimensions
+        dimensions = Math.max(dimensions, segments.length);
+        segments.forEach(function (seg, index) {
+            if (!index)
+                return;
+            var prefix = segments.slice(0, index).join(";");
+            if (!branchSizes[prefix]) {
+                branchSizes[prefix] = 1;
+            }
+            else {
+                branchSizes[prefix] += 1;
+            }
+        });
+        branchSizes[path] = ((_a = getBranch(tree, path)) === null || _a === void 0 ? void 0 : _a.length) || 0;
+    });
+    return { dimensions: dimensions, branchSizes: branchSizes };
+}
+function normalizePaths(tree) {
+    var paths = getPaths(tree);
+    var spaths = paths.map(function (p) { return p.split(";").map(function (seg) { return parseInt(seg, 10); }); });
+    var maxLength = Math.max.apply(Math, __spreadArray([], __read(spaths.map(function (p) { return p.length; })), false));
+    var lastSPath;
+    var lastNPath;
+    var npaths = [];
+    spaths.forEach(function (p, index) {
+        if (index === 0) {
+            // start with a full zero path
+            lastNPath = Array(maxLength).fill(0);
+            npaths.push(lastNPath.join(";"));
+        }
+        else {
+            // start with all zeros
+            var n = Array(maxLength).fill(0);
+            for (var i = 0; i < maxLength; i++) {
+                if (p[i] > lastSPath[i]) {
+                    // increment the segment, all the rest are zeros, so we can stop
+                    n[i] = lastNPath[i] + 1;
+                    break;
+                }
+                else {
+                    // same segment, copy over
+                    n[i] = lastNPath[i];
+                }
+            }
+            lastNPath = n;
+            npaths.push(lastNPath.join(";"));
+        }
+        lastSPath = p;
+    });
+    var normalized = {};
+    paths.forEach(function (path, index) {
+        var branch = getBranch(tree, path);
+        normalized[npaths[index]] = branch || [];
+    });
+    return normalized;
+}
 function forEachBranch(tree, fn) {
     var paths = getPaths(tree);
     paths.forEach(function (path, i) {
@@ -2238,14 +2306,14 @@ var Engine = /** @class */ (function () {
             var _this = this;
             if (inputs === void 0) { inputs = {}; }
             return __generator(this, function (_a) {
-                return [2 /*return*/, new Promise(function (resolve) {
+                return [2 /*return*/, new Promise(function (resolve, reject) {
                         var unsub = _this.subscribe("result", function (event) {
                             if (event.name === node.name) {
                                 resolve(event);
                                 unsub();
                             }
                         });
-                        _this.run(node, inputs);
+                        _this.run(node, inputs).catch(reject);
                     })];
             });
         });
@@ -7270,5 +7338,5 @@ function DDContext(_a) {
     return React.createElement(DndProvider, { backend: HTML5Backend }, children);
 }
 
-export { DDContext, DISCARD, Engine, Flow, Lib, binaryOnTree, binaryOnTreeBranch, broadCast, expandTree, forEachBranch, forEachItem, getBranch, getBranches, getItem, getPaths, getPositions, getReferences, getValue$1 as getValue, getVariable, graftTree, hasReference, interpolate, isReference, isSingleTon, isTree, mapTree, mapTreeBranch, nAryOnTree, nAryOnTreeBranch, normalizeVarDef, parseReference, primitives, pushItem, sameShape, simplifyTree$1 as simplifyTree, toArray, topSort, treeSize, trimTree, uid$1 as uid, useDraggableNode, useFlow, useFunction, usePositions, useUpdatePositions, useVariable, variableStore };
+export { DDContext, DISCARD, Engine, Flow, Lib, binaryOnTree, binaryOnTreeBranch, broadCast, expandTree, forEachBranch, forEachItem, getBranch, getBranches, getItem, getPaths, getPositions, getReferences, getValue$1 as getValue, getVariable, graftTree, hasReference, interpolate, 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