binary-decision-diagram 3.2.0 → 5.0.0

package/dist/cjs/src/internal-node.js

@@ -24,9 +24,12 @@ class InternalNode extends abstract_node_js_1.AbstractNode {
             // move own parents to keepBranch
             const ownParents = this.parents.getAll();
             ownParents.forEach(parent => {
-                // console.log('ownParent: ' + parent.id);
-                const branchKey = parent.branches.getKeyOfNode(this);
-                parent.branches.setBranch(branchKey, keepBranch);
+                // a parent (the root node) can have this node in both branches
+                branches_js_1.BRANCH_KEYS.forEach(branchKey => {
+                    if (parent.branches.getBranch(branchKey) === this) {
+                        parent.branches.setBranch(branchKey, keepBranch);
+                    }
+                });
                 // remove parents from own list
                 // this will auto-remove the connection to the other '1'-branch
                 this.parents.remove(parent);

package/dist/cjs/src/internal-node.js.map

@@ -1 +1 @@
-{"version":3,"file":"internal-node.js","sourceRoot":"","sources":["../../../src/internal-node.ts"],"names":[],"mappings":";;;AAAA,+CAAyC;AACzC,6CAAuC;AAEvC,yDAAkD;AAGlD,MAAa,YAAa,SAAQ,+BAAY;IACnC,QAAQ,GAAa,IAAI,sBAAQ,CAAC,IAAI,CAAC,CAAC;IACxC,OAAO,GAAG,IAAI,oBAAO,CAAC,IAAI,CAAC,CAAC;IAEnC,YACI,KAAa,EACb,QAAkB,EAClB,MAAmB;QAEnB,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAID;;;;OAIG;IACH,kBAAkB;QAEd,kDAAkD;QAElD,IAAI,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAgB,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAE7D,iCAAiC;YACjC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACzC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBACxB,0CAA0C;gBAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;gBACrD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAEjD,+BAA+B;gBAC/B,+DAA+D;gBAC/D,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAE5B,wCAAwC;gBACxC,uCAAuC;gBACvC,oCAAoC;gBACpC,IAAI,MAAM,CAAC,QAAQ,CAAC,sBAAsB,EAAE,IAAI,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC;oBACrE,MAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAClD,CAAC;YACL,CAAC,CAAC,CAAC;YAEH,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;CAEJ;AApDD,oCAoDC"}
+{"version":3,"file":"internal-node.js","sourceRoot":"","sources":["../../../src/internal-node.ts"],"names":[],"mappings":";;;AAAA,+CAAsD;AACtD,6CAAuC;AAEvC,yDAAkD;AAGlD,MAAa,YAAa,SAAQ,+BAAY;IACnC,QAAQ,GAAa,IAAI,sBAAQ,CAAC,IAAI,CAAC,CAAC;IACxC,OAAO,GAAG,IAAI,oBAAO,CAAC,IAAI,CAAC,CAAC;IAEnC,YACI,KAAa,EACb,QAAkB,EAClB,MAAmB;QAEnB,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAID;;;;OAIG;IACH,kBAAkB;QAEd,kDAAkD;QAElD,IAAI,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAgB,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAE7D,iCAAiC;YACjC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACzC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBACxB,+DAA+D;gBAC/D,yBAAW,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;oBAC5B,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,CAAC;wBAChD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;oBACrD,CAAC;gBACL,CAAC,CAAC,CAAC;gBAEH,+BAA+B;gBAC/B,+DAA+D;gBAC/D,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAE5B,wCAAwC;gBACxC,uCAAuC;gBACvC,oCAAoC;gBACpC,IAAI,MAAM,CAAC,QAAQ,CAAC,sBAAsB,EAAE,IAAI,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC;oBACrE,MAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAClD,CAAC;YACL,CAAC,CAAC,CAAC;YAEH,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;CAEJ;AAvDD,oCAuDC"}

package/dist/cjs/src/optimize-brute-force.js

@@ -1,6 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getArrayWithIndexes = exports.changeKeyOrder = exports.shuffleBooleanOrdering = exports.optimizeBruteForce = exports.defaultCompareResults = void 0;
+exports.defaultCompareResults = void 0;
+exports.optimizeBruteForce = optimizeBruteForce;
+exports.shuffleBooleanOrdering = shuffleBooleanOrdering;
+exports.changeKeyOrder = changeKeyOrder;
+exports.getArrayWithIndexes = getArrayWithIndexes;
 const create_bdd_from_truth_table_js_1 = require("./create-bdd-from-truth-table.js");
 const util_js_1 = require("./util.js");
 /**
@@ -89,7 +93,6 @@ async function optimizeBruteForce({ truthTable, iterations = Infinity, onBetterB
     }
     return currentBestResult;
 }
-exports.optimizeBruteForce = optimizeBruteForce;
 function shuffleBooleanOrdering(truthTable) {
     const firstKey = (0, util_js_1.firstKeyOfMap)(truthTable);
     const arrayWithIndexes = getArrayWithIndexes(firstKey.length);
@@ -111,23 +114,19 @@ function shuffleBooleanOrdering(truthTable) {
         mappingBeforeToAfter
     };
 }
-exports.shuffleBooleanOrdering = shuffleBooleanOrdering;
 function changeKeyOrder(oldKey, mappingBeforeToAfter) {
     const chars = oldKey
         .split('')
-        .map((char, indexBefore) => {
-        return {
-            char,
-            indexBefore,
-            indexAfter: mappingBeforeToAfter[indexBefore]
-        };
-    })
+        .map((char, indexBefore) => ({
+        char,
+        indexBefore,
+        indexAfter: mappingBeforeToAfter[indexBefore]
+    }))
         .sort((a, b) => a.indexAfter - b.indexAfter)
         .map(charObj => charObj.char)
         .join('');
     return chars;
 }
-exports.changeKeyOrder = changeKeyOrder;
 function getArrayWithIndexes(size) {
     const ret = [];
     let last = 0;
@@ -137,5 +136,4 @@ function getArrayWithIndexes(size) {
     }
     return ret;
 }
-exports.getArrayWithIndexes = getArrayWithIndexes;
 //# sourceMappingURL=optimize-brute-force.js.map

package/dist/cjs/src/optimize-brute-force.js.map

@@ -1 +1 @@
-{"version":3,"file":"optimize-brute-force.js","sourceRoot":"","sources":["../../../src/optimize-brute-force.ts"],"names":[],"mappings":";;;AAEA,qFAA2E;AAC3E,uCAAqE;AAgBrE;;GAEG;AACI,MAAM,qBAAqB,GAA2B,UACzD,CAAW,EACX,CAAW;IAEX,IAAI,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC;QACnC,OAAO,CAAC,CAAC;IACb,CAAC;SAAM,CAAC;QACJ,OAAO,CAAC,CAAC;IACb,CAAC;AACL,CAAC,CAAC;AATW,QAAA,qBAAqB,yBAShC;AAaF;;;;GAIG;AACI,KAAK,UAAU,kBAAkB,CAAC,EACrC,UAAU,EACV,UAAU,GAAG,QAAQ,EACrB,WAAW,GAAG,GAAG,EAAE,CAAC,IAAI,EACxB,cAAc,GAAG,6BAAqB,EACtC,gBAAgB,GAAG,GAAG,EAAE,CAAC,IAAI,EAC7B,UAAU,EACV,GAAG,GAAG,KAAK,EACW;IACtB,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,IAAA,wDAAuB,EAAC,UAAU,CAAC,CAAC;IACjF,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC7B,UAAU,CAAC,QAAQ,EAAE,CAAC;IACtB,IAAI,iBAAiB,GAAuB;QACxC,UAAU;QACV,GAAG,EAAE,UAAU;KAClB,CAAC;IACF,WAAW,CAAC,iBAAiB,CAAC,CAAC;IAE/B,IAAI,GAAG,EAAE,CAAC;QACN,UAAU,CAAC,GAAG,EAAE,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,wBAAwB,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,UAAU,EAAE,CAAC;QACpB,CAAC,EAAE,CAAC;QAEJ,IAAI,GAAG,EAAE,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,gBAAgB,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,IAAA,wDAAuB,EAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEnE,iCAAiC;QACjC,MAAM,eAAe,GAAmC,IAAI,GAAG,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,IAAA,qBAAW,EAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QACnD,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,OAAO,CAAC,SAAS,EAAE;aACd,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC;aACpC,OAAO,CAAC,KAAK,CAAC,EAAE;YACb,MAAM,QAAQ,GAAG,gBAAgB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/B,MAAM,QAAQ,GAAsB,IAAI,GAAG,EAAE,CAAC;YAC9C,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACxC,OAAO,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC1C,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;gBACtB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QACP,MAAM,YAAY,GAAsB,IAAI,GAAG,EAAE,CAAC;QAClD,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC7C,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChC,OAAO,CAAC,YAAY,GAAG,eAAe,CAAC;QACvC,OAAO,CAAC,MAAM,GAAG,eAAe,CAAC;QAEjC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC1B,OAAO,CAAC,QAAQ,EAAE,CAAC;QAEnB,IAAI,GAAG,EAAE,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,mCAAmC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YACxE,4BAA4B;YAC5B,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,SAAS,GAAG,MAAM,cAAc,CAClC,iBAAiB,CAAC,GAAG,EACrB,OAAO,CACV,CAAC;QACF,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAC3D,CAAC;QAED,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;YACxB,IAAI,GAAG,EAAE,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,OAAO,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YAC5D,CAAC;YAED,iBAAiB,GAAG;gBAChB,GAAG,EAAE,OAAO;gBACZ,UAAU,EAAE,gBAAgB,CAAC,QAAQ;aACxC,CAAC;YACF,WAAW,CAAC,iBAAiB,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;IAGD,OAAO,iBAAiB,CAAC;AAC7B,CAAC;AA1FD,gDA0FC;AAWD,SAAgB,sBAAsB,CAClC,UAAsB;IAMtB,MAAM,QAAQ,GAAG,IAAA,uBAAa,EAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,IAAA,sBAAY,EAAC,gBAAgB,CAAC,CAAC;IAEhD,MAAM,OAAO,GAAkC,EAAE,CAAC;IAClD,MAAM,oBAAoB,GAAyC,EAAE,CAAC;IACtE,QAAQ,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,UAAU,EAAE,EAAE;QACzC,OAAO,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;QAClC,oBAAoB,CAAC,WAAW,CAAC,GAAG,UAAU,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAe,IAAI,GAAG,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,cAAc,CACzB,GAAG,EACH,OAAO,CACV,CAAC;QACF,QAAQ,CAAC,GAAG,CACR,MAAM,EACN,KAAK,CACR,CAAC;IACN,CAAC;IAED,OAAO;QACH,QAAQ;QACR,OAAO;QACP,oBAAoB;KACvB,CAAC;AACN,CAAC;AAnCD,wDAmCC;AAED,SAAgB,cAAc,CAC1B,MAAc,EACd,oBAAmD;IAEnD,MAAM,KAAK,GAAG,MAAM;SACf,KAAK,CAAC,EAAE,CAAC;SACT,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE;QACvB,OAAO;YACH,IAAI;YACJ,WAAW;YACX,UAAU,EAAE,oBAAoB,CAAC,WAAW,CAAC;SAChD,CAAC;IACN,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;SAC5B,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,OAAO,KAAK,CAAC;AACjB,CAAC;AAjBD,wCAiBC;AAED,SAAgB,mBAAmB,CAAC,IAAY;IAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;QACjB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AARD,kDAQC"}
+{"version":3,"file":"optimize-brute-force.js","sourceRoot":"","sources":["../../../src/optimize-brute-force.ts"],"names":[],"mappings":";;;AAiDA,gDA0FC;AAWD,wDAmCC;AAED,wCAeC;AAED,kDAQC;AAlND,qFAA2E;AAC3E,uCAAqE;AAgBrE;;GAEG;AACI,MAAM,qBAAqB,GAA2B,UACzD,CAAW,EACX,CAAW;IAEX,IAAI,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC;QACnC,OAAO,CAAC,CAAC;IACb,CAAC;SAAM,CAAC;QACJ,OAAO,CAAC,CAAC;IACb,CAAC;AACL,CAAC,CAAC;AATW,QAAA,qBAAqB,yBAShC;AAaF;;;;GAIG;AACI,KAAK,UAAU,kBAAkB,CAAC,EACrC,UAAU,EACV,UAAU,GAAG,QAAQ,EACrB,WAAW,GAAG,GAAG,EAAE,CAAC,IAAI,EACxB,cAAc,GAAG,6BAAqB,EACtC,gBAAgB,GAAG,GAAG,EAAE,CAAC,IAAI,EAC7B,UAAU,EACV,GAAG,GAAG,KAAK,EACW;IACtB,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,IAAA,wDAAuB,EAAC,UAAU,CAAC,CAAC;IACjF,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC7B,UAAU,CAAC,QAAQ,EAAE,CAAC;IACtB,IAAI,iBAAiB,GAAuB;QACxC,UAAU;QACV,GAAG,EAAE,UAAU;KAClB,CAAC;IACF,WAAW,CAAC,iBAAiB,CAAC,CAAC;IAE/B,IAAI,GAAG,EAAE,CAAC;QACN,UAAU,CAAC,GAAG,EAAE,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,wBAAwB,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,UAAU,EAAE,CAAC;QACpB,CAAC,EAAE,CAAC;QAEJ,IAAI,GAAG,EAAE,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,gBAAgB,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,IAAA,wDAAuB,EAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEnE,iCAAiC;QACjC,MAAM,eAAe,GAAmC,IAAI,GAAG,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,IAAA,qBAAW,EAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QACnD,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,OAAO,CAAC,SAAS,EAAE;aACd,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC;aACpC,OAAO,CAAC,KAAK,CAAC,EAAE;YACb,MAAM,QAAQ,GAAG,gBAAgB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/B,MAAM,QAAQ,GAAsB,IAAI,GAAG,EAAE,CAAC;YAC9C,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACxC,OAAO,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC1C,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;gBACtB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QACP,MAAM,YAAY,GAAsB,IAAI,GAAG,EAAE,CAAC;QAClD,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC7C,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChC,OAAO,CAAC,YAAY,GAAG,eAAe,CAAC;QACvC,OAAO,CAAC,MAAM,GAAG,eAAe,CAAC;QAEjC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC1B,OAAO,CAAC,QAAQ,EAAE,CAAC;QAEnB,IAAI,GAAG,EAAE,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,mCAAmC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YACxE,4BAA4B;YAC5B,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,SAAS,GAAG,MAAM,cAAc,CAClC,iBAAiB,CAAC,GAAG,EACrB,OAAO,CACV,CAAC;QACF,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAC3D,CAAC;QAED,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;YACxB,IAAI,GAAG,EAAE,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,OAAO,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YAC5D,CAAC;YAED,iBAAiB,GAAG;gBAChB,GAAG,EAAE,OAAO;gBACZ,UAAU,EAAE,gBAAgB,CAAC,QAAQ;aACxC,CAAC;YACF,WAAW,CAAC,iBAAiB,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;IAGD,OAAO,iBAAiB,CAAC;AAC7B,CAAC;AAWD,SAAgB,sBAAsB,CAClC,UAAsB;IAMtB,MAAM,QAAQ,GAAG,IAAA,uBAAa,EAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,IAAA,sBAAY,EAAC,gBAAgB,CAAC,CAAC;IAEhD,MAAM,OAAO,GAAkC,EAAE,CAAC;IAClD,MAAM,oBAAoB,GAAyC,EAAE,CAAC;IACtE,QAAQ,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,UAAU,EAAE,EAAE;QACzC,OAAO,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;QAClC,oBAAoB,CAAC,WAAW,CAAC,GAAG,UAAU,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAe,IAAI,GAAG,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,cAAc,CACzB,GAAG,EACH,OAAO,CACV,CAAC;QACF,QAAQ,CAAC,GAAG,CACR,MAAM,EACN,KAAK,CACR,CAAC;IACN,CAAC;IAED,OAAO;QACH,QAAQ;QACR,OAAO;QACP,oBAAoB;KACvB,CAAC;AACN,CAAC;AAED,SAAgB,cAAc,CAC1B,MAAc,EACd,oBAAmD;IAEnD,MAAM,KAAK,GAAG,MAAM;SACf,KAAK,CAAC,EAAE,CAAC;SACT,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC;QACzB,IAAI;QACJ,WAAW;QACX,UAAU,EAAE,oBAAoB,CAAC,WAAW,CAAC;KAChD,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;SAC5B,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,SAAgB,mBAAmB,CAAC,IAAY;IAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;QACjB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC"}

package/dist/cjs/src/ordering/build-bdd.d.ts

@@ -0,0 +1,13 @@
+import { RootNode } from '../root-node.js';
+import type { DenseTruthTable } from './dense-truth-table.js';
+import type { ReducedDiagram } from './ordering-evaluator.js';
+/**
+ * Creates the RootNode based BDD out of a reduced diagram.
+ * The result is already minimal, so no minimize() call is needed.
+ *
+ * Like the BDDs returned by optimizeBruteForce(), the level of each node
+ * is the index of the boolean function it tests (so resolve() works
+ * with the original resolver functions) and RootNode.levels lists the
+ * levels from top to bottom, followed by the leaf level.
+ */
+export declare function buildBddFromDiagram(diagram: ReducedDiagram, table: DenseTruthTable): RootNode;

package/dist/cjs/src/ordering/build-bdd.js

@@ -0,0 +1,64 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildBddFromDiagram = buildBddFromDiagram;
+const root_node_js_1 = require("../root-node.js");
+const internal_node_js_1 = require("../internal-node.js");
+const leaf_node_js_1 = require("../leaf-node.js");
+/**
+ * Creates the RootNode based BDD out of a reduced diagram.
+ * The result is already minimal, so no minimize() call is needed.
+ *
+ * Like the BDDs returned by optimizeBruteForce(), the level of each node
+ * is the index of the boolean function it tests (so resolve() works
+ * with the original resolver functions) and RootNode.levels lists the
+ * levels from top to bottom, followed by the leaf level.
+ */
+function buildBddFromDiagram(diagram, table) {
+    const n = diagram.variableCount;
+    const ordering = diagram.ordering;
+    const terminalCount = diagram.terminalCount;
+    const leafLevel = n;
+    const root = new root_node_js_1.RootNode();
+    root.level = ordering[0];
+    root.levels = ordering.slice();
+    root.levels.push(leafLevel);
+    root.nodesByLevel = new Map();
+    root.levels.forEach(level => root.nodesByLevel.set(level, new Set()));
+    root.nodesByLevel.get(root.level).add(root);
+    const internalById = new Map();
+    const leafById = new Map();
+    const attach = (parent, branch, id) => {
+        if (id < terminalCount) {
+            let leaf = leafById.get(id);
+            if (!leaf) {
+                leaf = new leaf_node_js_1.LeafNode(leafLevel, root, table.terminalValues[id], parent);
+                leafById.set(id, leaf);
+            }
+            parent.branches.setBranch(branch, leaf);
+            return;
+        }
+        const existing = internalById.get(id);
+        if (existing) {
+            parent.branches.setBranch(branch, existing);
+            return;
+        }
+        const index = id - terminalCount;
+        const node = new internal_node_js_1.InternalNode(ordering[diagram.nodeLevel[index]], root, parent);
+        internalById.set(id, node);
+        parent.branches.setBranch(branch, node);
+        attach(node, '0', diagram.nodeLo[index]);
+        attach(node, '1', diagram.nodeHi[index]);
+    };
+    const rootId = diagram.root;
+    if (rootId >= terminalCount && diagram.nodeLevel[rootId - terminalCount] === 0) {
+        attach(root, '0', diagram.nodeLo[rootId - terminalCount]);
+        attach(root, '1', diagram.nodeHi[rootId - terminalCount]);
+    }
+    else {
+        // the top level variable is irrelevant, the root node points to the same node twice
+        attach(root, '0', rootId);
+        attach(root, '1', rootId);
+    }
+    return root;
+}
+//# sourceMappingURL=build-bdd.js.map

package/dist/cjs/src/ordering/build-bdd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-bdd.js","sourceRoot":"","sources":["../../../../src/ordering/build-bdd.ts"],"names":[],"mappings":";;AAgBA,kDAqDC;AArED,kDAA2C;AAC3C,0DAAmD;AACnD,kDAA2C;AAK3C;;;;;;;;GAQG;AACH,SAAgB,mBAAmB,CAC/B,OAAuB,EACvB,KAAsB;IAEtB,MAAM,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC;IAChC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IAClC,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;IAC5C,MAAM,SAAS,GAAG,CAAC,CAAC;IAEpB,MAAM,IAAI,GAAG,IAAI,uBAAQ,EAAE,CAAC;IAC5B,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC5B,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;IAC9B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;IACrE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAE/D,MAAM,YAAY,GAA8B,IAAI,GAAG,EAAE,CAAC;IAC1D,MAAM,QAAQ,GAA0B,IAAI,GAAG,EAAE,CAAC;IAElD,MAAM,MAAM,GAAG,CAAC,MAAmB,EAAE,MAAqB,EAAE,EAAU,EAAE,EAAE;QACtE,IAAI,EAAE,GAAG,aAAa,EAAE,CAAC;YACrB,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACR,IAAI,GAAG,IAAI,uBAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;gBACvE,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxC,OAAO;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,QAAQ,EAAE,CAAC;YACX,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC5C,OAAO;QACX,CAAC;QACD,MAAM,KAAK,GAAG,EAAE,GAAG,aAAa,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,+BAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAChF,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAC5B,IAAI,MAAM,IAAI,aAAa,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7E,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC;QAC1D,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC;IAC9D,CAAC;SAAM,CAAC;QACJ,oFAAoF;QACpF,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QAC1B,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/cjs/src/ordering/dense-truth-table.d.ts

@@ -0,0 +1,42 @@
+import type { TruthTable } from '../types.js';
+/**
+ * A truth table stored as a flat array of terminal ids.
+ *
+ * Row index: parseInt(key, 2). The first character of a key
+ * (= boolean function 0) is the most significant bit of the row index,
+ * so variable v corresponds to bit (variableCount - 1 - v).
+ *
+ * Values are mapped to small consecutive "terminal ids" so that the
+ * hot loops only ever compare 32-bit integers.
+ */
+export interface DenseTruthTable {
+    /** amount of boolean functions, equals the key length of the truth table */
+    variableCount: number;
+    /** 2^variableCount */
+    rowCount: number;
+    /** terminal id of each row */
+    terminalIds: Int32Array;
+    /** terminal id -> value of the truth table */
+    terminalValues: number[];
+    /** terminal id of the don't-care value, -1 when there is none */
+    dontCareTerminal: number;
+    /** amount of leaf nodes the final BDD will have */
+    leafCount: number;
+}
+/**
+ * The hard limit of variables. Row indexes are handled with 32 bit integer
+ * operations and a table with 2^30 rows would need gigabytes of memory anyway.
+ */
+export declare const MAX_VARIABLE_COUNT = 30;
+export declare function parseTruthTable(truthTable: TruthTable, dontCareValue?: number): DenseTruthTable;
+/**
+ * Creates a dense table with the same terminal values
+ * but other row contents, for example after don't-care rows have been resolved.
+ */
+export declare function withTerminalIds(table: DenseTruthTable, terminalIds: Int32Array, dontCareTerminal: number): DenseTruthTable;
+/**
+ * Converts the dense table back into a Map with keys in the original order.
+ */
+export declare function denseTruthTableToMap(table: DenseTruthTable): TruthTable;
+export declare function naturalOrdering(variableCount: number): number[];
+export declare function ensureValidOrdering(ordering: ArrayLike<number>, variableCount: number): void;

package/dist/cjs/src/ordering/dense-truth-table.js

@@ -0,0 +1,125 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MAX_VARIABLE_COUNT = void 0;
+exports.parseTruthTable = parseTruthTable;
+exports.withTerminalIds = withTerminalIds;
+exports.denseTruthTableToMap = denseTruthTableToMap;
+exports.naturalOrdering = naturalOrdering;
+exports.ensureValidOrdering = ensureValidOrdering;
+/**
+ * The hard limit of variables. Row indexes are handled with 32 bit integer
+ * operations and a table with 2^30 rows would need gigabytes of memory anyway.
+ */
+exports.MAX_VARIABLE_COUNT = 30;
+function parseTruthTable(truthTable, dontCareValue) {
+    if (truthTable.size === 0) {
+        throw new Error('truth table is empty');
+    }
+    const firstKey = truthTable.keys().next().value;
+    const variableCount = firstKey.length;
+    if (variableCount < 1 || variableCount > exports.MAX_VARIABLE_COUNT) {
+        throw new Error('truth table keys must have between 1 and ' + exports.MAX_VARIABLE_COUNT + ' characters');
+    }
+    const rowCount = Math.pow(2, variableCount);
+    if (truthTable.size !== rowCount) {
+        throw new Error('truth table has missing entries');
+    }
+    const terminalIds = new Int32Array(rowCount).fill(-1);
+    const terminalValues = [];
+    const idByValue = new Map();
+    for (const [key, value] of truthTable) {
+        if (key.length !== variableCount || !/^[01]+$/.test(key)) {
+            throw new Error('invalid truth table key ' + key);
+        }
+        const row = parseInt(key, 2);
+        if (terminalIds[row] !== -1) {
+            throw new Error('duplicate truth table key ' + key);
+        }
+        let id = idByValue.get(value);
+        if (id === undefined) {
+            id = terminalValues.length;
+            terminalValues.push(value);
+            idByValue.set(value, id);
+        }
+        terminalIds[row] = id;
+    }
+    let dontCareTerminal = -1;
+    if (dontCareValue !== undefined) {
+        const dcId = idByValue.get(dontCareValue);
+        if (dcId !== undefined) {
+            dontCareTerminal = dcId;
+        }
+    }
+    const leafCount = terminalValues.length - (dontCareTerminal >= 0 ? 1 : 0);
+    if (leafCount === 0) {
+        throw new Error('truth table only consists of don\'t-care rows');
+    }
+    return {
+        variableCount,
+        rowCount,
+        terminalIds,
+        terminalValues,
+        dontCareTerminal,
+        leafCount
+    };
+}
+/**
+ * Creates a dense table with the same terminal values
+ * but other row contents, for example after don't-care rows have been resolved.
+ */
+function withTerminalIds(table, terminalIds, dontCareTerminal) {
+    let leafCount = 0;
+    const seen = new Uint8Array(table.terminalValues.length);
+    for (let i = 0; i < terminalIds.length; i++) {
+        const id = terminalIds[i];
+        if (seen[id] === 0) {
+            seen[id] = 1;
+            if (id !== dontCareTerminal) {
+                leafCount++;
+            }
+        }
+    }
+    if (leafCount === 0) {
+        leafCount = 1;
+    }
+    return {
+        variableCount: table.variableCount,
+        rowCount: table.rowCount,
+        terminalIds,
+        terminalValues: table.terminalValues,
+        dontCareTerminal,
+        leafCount
+    };
+}
+/**
+ * Converts the dense table back into a Map with keys in the original order.
+ */
+function denseTruthTableToMap(table) {
+    const ret = new Map();
+    const n = table.variableCount;
+    for (let row = 0; row < table.rowCount; row++) {
+        ret.set(row.toString(2).padStart(n, '0'), table.terminalValues[table.terminalIds[row]]);
+    }
+    return ret;
+}
+function naturalOrdering(variableCount) {
+    const ret = [];
+    for (let i = 0; i < variableCount; i++) {
+        ret.push(i);
+    }
+    return ret;
+}
+function ensureValidOrdering(ordering, variableCount) {
+    if (ordering.length !== variableCount) {
+        throw new Error('ordering must contain each of the ' + variableCount + ' boolean functions exactly once');
+    }
+    const seen = new Uint8Array(variableCount);
+    for (let i = 0; i < ordering.length; i++) {
+        const v = ordering[i];
+        if (!Number.isInteger(v) || v < 0 || v >= variableCount || seen[v] === 1) {
+            throw new Error('ordering must contain each of the ' + variableCount + ' boolean functions exactly once');
+        }
+        seen[v] = 1;
+    }
+}
+//# sourceMappingURL=dense-truth-table.js.map

package/dist/cjs/src/ordering/dense-truth-table.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dense-truth-table.js","sourceRoot":"","sources":["../../../../src/ordering/dense-truth-table.ts"],"names":[],"mappings":";;;AAiCA,0CAyDC;AAMD,0CA2BC;AAKD,oDAUC;AAED,0CAMC;AAED,kDAYC;AArID;;;GAGG;AACU,QAAA,kBAAkB,GAAG,EAAE,CAAC;AAErC,SAAgB,eAAe,CAC3B,UAAsB,EACtB,aAAsB;IAEtB,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;IAC5C,CAAC;IACD,MAAM,QAAQ,GAAW,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;IAClE,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC;IACtC,IAAI,aAAa,GAAG,CAAC,IAAI,aAAa,GAAG,0BAAkB,EAAE,CAAC;QAC1D,MAAM,IAAI,KAAK,CAAC,2CAA2C,GAAG,0BAAkB,GAAG,aAAa,CAAC,CAAC;IACtG,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IAC5C,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,SAAS,GAAwB,IAAI,GAAG,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,MAAM,KAAK,aAAa,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,KAAK,CAAC,0BAA0B,GAAG,GAAG,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACnB,EAAE,GAAG,cAAc,CAAC,MAAM,CAAC;YAC3B,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IAC1B,CAAC;IAED,IAAI,gBAAgB,GAAG,CAAC,CAAC,CAAC;IAC1B,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,gBAAgB,GAAG,IAAI,CAAC;QAC5B,CAAC;IACL,CAAC;IACD,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,gBAAgB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;IACrE,CAAC;IAED,OAAO;QACH,aAAa;QACb,QAAQ;QACR,WAAW;QACX,cAAc;QACd,gBAAgB;QAChB,SAAS;KACZ,CAAC;AACN,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAC3B,KAAsB,EACtB,WAAuB,EACvB,gBAAwB;IAExB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACb,IAAI,EAAE,KAAK,gBAAgB,EAAE,CAAC;gBAC1B,SAAS,EAAE,CAAC;YAChB,CAAC;QACL,CAAC;IACL,CAAC;IACD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QAClB,SAAS,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,OAAO;QACH,aAAa,EAAE,KAAK,CAAC,aAAa;QAClC,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,WAAW;QACX,cAAc,EAAE,KAAK,CAAC,cAAc;QACpC,gBAAgB;QAChB,SAAS;KACZ,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAgB,oBAAoB,CAAC,KAAsB;IACvD,MAAM,GAAG,GAAe,IAAI,GAAG,EAAE,CAAC;IAClC,MAAM,CAAC,GAAG,KAAK,CAAC,aAAa,CAAC;IAC9B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC;QAC5C,GAAG,CAAC,GAAG,CACH,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAChC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAC/C,CAAC;IACN,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED,SAAgB,eAAe,CAAC,aAAqB;IACjD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED,SAAgB,mBAAmB,CAAC,QAA2B,EAAE,aAAqB;IAClF,IAAI,QAAQ,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CAAC,oCAAoC,GAAG,aAAa,GAAG,iCAAiC,CAAC,CAAC;IAC9G,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,aAAa,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvE,MAAM,IAAI,KAAK,CAAC,oCAAoC,GAAG,aAAa,GAAG,iCAAiC,CAAC,CAAC;QAC9G,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;AACL,CAAC"}

package/dist/cjs/src/ordering/exact-cost-ordering.d.ts

@@ -0,0 +1,91 @@
+import type { DenseTruthTable } from './dense-truth-table.js';
+import { CostModel } from './ordering-evaluator.js';
+export interface ExactCostOrderingOptions {
+    /**
+     * The search stops without a proof when more states were expanded.
+     * Default: 200000
+     */
+    maxExpansions?: number;
+    /**
+     * The search stops without a proof when the stored states reference
+     * more rows in total (memory protection).
+     * Default: 2^25
+     */
+    maxStoredRows?: number;
+    /**
+     * A known good ordering. Its expected cost is used as upper bound to prune the search.
+     */
+    upperBoundOrdering?: ArrayLike<number>;
+    /**
+     * Only orderings with a lower expected cost than this are searched for.
+     */
+    upperBound?: number;
+    log?: (message: string) => void;
+}
+export interface ExactCostOrderingResult {
+    /**
+     * true when it is proven that no ordering has a lower expected cost
+     * than the returned one (or than the upper bound, when ordering is null)
+     */
+    solved: boolean;
+    /**
+     * The best ordering that was found. Irrelevant boolean functions
+     * are always at the bottom. null when no ordering below the numeric
+     * upper bound exists and the upperBoundOrdering (if given) is not
+     * below it either.
+     */
+    ordering: number[] | null;
+    /** expected cost of one resolve() call with `ordering`, -1 when ordering is null */
+    expectedCost: number;
+    expansions: number;
+    generated: number;
+}
+/**
+ * Exact minimization of the expected cost of a resolve() call.
+ *
+ * A row pays the cost of a boolean function when its path through the BDD
+ * visits a node of that function, which happens exactly when the cofactor of
+ * the row with respect to the functions above still depends on that function.
+ * So like the amount of nodes, the expected cost decomposes over the lattice of
+ * variable subsets: the edge S -> S + {x} costs cost(x) times the weight of the
+ * rows whose cofactor with respect to S depends on x (the root level always
+ * pays, because the root node always calls its function).
+ *
+ * A state keeps the rows with positive weight grouped by their cofactor.
+ * Rows whose cofactor became constant never pay anything again and are dropped.
+ * The admissible estimate for the remaining cost sums, for every function x
+ * not yet placed, cost(x) times the weight of the rows that are sensitive to x
+ * (the value changes when only x is flipped), because such rows pay for x in
+ * every ordering.
+ */
+export declare class ExactCostOrderingSearch {
+    private readonly table;
+    private readonly costModel;
+    private readonly diagram;
+    private readonly n;
+    /** natural indexes of the rows with positive weight, ascending */
+    private readonly activeRows;
+    private readonly activeWeights;
+    private readonly totalWeight;
+    /** sensitiveWeight[v] = weight of the active rows whose value changes when only v is flipped */
+    private readonly sensitiveWeight;
+    private readonly costs;
+    constructor(table: DenseTruthTable, costModel: CostModel, options?: {
+        maxDiagramNodes?: number;
+    });
+    normalizeOrdering(ordering: ArrayLike<number>): number[];
+    run(options?: ExactCostOrderingOptions): ExactCostOrderingResult;
+    /**
+     * lower bound for the remaining (unnormalized) cost below the subset
+     */
+    private estimate;
+    /**
+     * the weight of the rows that pay for `variable` when it is fixed next
+     */
+    private payingWeight;
+    /**
+     * fixes `variable` additionally: returns the new grouping of the rows
+     * that still have a non-constant cofactor
+     */
+    private transition;
+}