binary-decision-diagram 1.3.1 → 2.0.0

package/dist/lib/root-node.js

@@ -1,142 +1,101 @@
-"use strict";
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-var abstract_node_1 = require("./abstract-node");
-var branches_1 = require("./branches");
-var util_1 = require("./util");
-var minimal_string_1 = require("./minimal-string");
-var RootNode = /** @class */ (function (_super) {
-    __extends(RootNode, _super);
-    function RootNode() {
-        var _this = _super.call(this, 0, null, 'RootNode') || this;
-        _this.branches = new branches_1.Branches(_this);
-        _this.levels = [];
-        _this.nodesByLevel = new Map();
-        _this.levels.push(0);
-        var level0Set = new Set();
-        level0Set.add(_this);
-        _this.nodesByLevel.set(0, level0Set);
-        return _this;
+import { AbstractNode } from './abstract-node';
+import { Branches } from './branches';
+import { lastOfArray, booleanToBooleanString } from './util';
+import { bddToSimpleBdd } from './minimal-string';
+export class RootNode extends AbstractNode {
+    constructor() {
+        super(0, null, 'RootNode');
+        this.branches = new Branches(this);
+        this.levels = [];
+        this.nodesByLevel = new Map();
+        this.levels.push(0);
+        const level0Set = new Set();
+        level0Set.add(this);
+        this.nodesByLevel.set(0, level0Set);
     }
-    RootNode.prototype.addNode = function (node) {
-        var level = node.level;
+    addNode(node) {
+        const level = node.level;
         if (!this.levels.includes(level)) {
             this.levels.push(level);
         }
         this.ensureLevelSetExists(level);
-        var set = this.nodesByLevel.get(level);
+        const set = this.nodesByLevel.get(level);
         set === null || set === void 0 ? void 0 : set.add(node);
-    };
-    RootNode.prototype.removeNode = function (node) {
-        var set = this.nodesByLevel.get(node.level);
+    }
+    removeNode(node) {
+        const set = this.nodesByLevel.get(node.level);
         if (!set.has(node)) {
             throw new Error('removed non-existing node ' + node.id);
         }
         set.delete(node);
-    };
-    RootNode.prototype.ensureLevelSetExists = function (level) {
+    }
+    ensureLevelSetExists(level) {
         if (!this.nodesByLevel.has(level)) {
             this.nodesByLevel.set(level, new Set());
         }
-    };
-    RootNode.prototype.getLevels = function () {
-        return Array.from(this.levels).sort(function (a, b) { return a - b; });
-    };
-    RootNode.prototype.getNodesOfLevel = function (level) {
+    }
+    getLevels() {
+        return Array.from(this.levels).sort((a, b) => a - b);
+    }
+    getNodesOfLevel(level) {
         this.ensureLevelSetExists(level);
-        var set = this.nodesByLevel.get(level);
+        const set = this.nodesByLevel.get(level);
         return Array.from(set);
-    };
-    RootNode.prototype.countNodes = function () {
-        var _this = this;
-        var ret = 0;
-        this.getLevels().forEach(function (level) {
-            var nodesAmount = _this.getNodesOfLevel(level).length;
+    }
+    countNodes() {
+        let ret = 0;
+        this.getLevels().forEach(level => {
+            const nodesAmount = this.getNodesOfLevel(level).length;
             ret = ret + nodesAmount;
         });
         return ret;
-    };
+    }
     /**
      * applies the reduction rules to the whole bdd
      */
-    RootNode.prototype.minimize = function (logState) {
-        var e_1, _a;
-        if (logState === void 0) { logState = false; }
+    minimize(logState = false) {
         // console.log('minimize(): START ###############');
-        var done = false;
+        let done = false;
         while (!done) {
             if (logState) {
                 console.log('minimize() itterate once');
             }
-            var successCount = 0;
-            var lastLevel = util_1.lastOfArray(this.getLevels());
+            let successCount = 0;
+            let lastLevel = lastOfArray(this.getLevels());
             while (lastLevel > 0) {
-                var nodes = this.getNodesOfLevel(lastLevel);
+                const nodes = this.getNodesOfLevel(lastLevel);
                 if (logState) {
                     console.log('minimize() run for level ' + lastLevel +
                         ' with ' + nodes.length + ' nodes');
                     // console.dir(nodes);
                 }
-                var nodeCount = 0;
-                try {
-                    for (var nodes_1 = (e_1 = void 0, __values(nodes)), nodes_1_1 = nodes_1.next(); !nodes_1_1.done; nodes_1_1 = nodes_1.next()) {
-                        var node = nodes_1_1.value;
-                        nodeCount++;
-                        // do not run that often because it is expensive
-                        if (logState && nodeCount % 4000 === 0) {
-                            console.log('minimize() node #' + node.id);
+                let nodeCount = 0;
+                for (const node of nodes) {
+                    nodeCount++;
+                    // do not run that often because it is expensive
+                    if (logState && nodeCount % 4000 === 0) {
+                        console.log('minimize() node #' + node.id);
+                    }
+                    if (node.isLeafNode()) {
+                        // console.log('have leaf node ' + node.id);
+                        const reductionDone = node.asLeafNode().applyEliminationRule();
+                        if (reductionDone) {
+                            successCount++;
                         }
-                        if (node.isLeafNode()) {
-                            // console.log('have leaf node ' + node.id);
-                            var reductionDone = node.asLeafNode().applyEliminationRule();
-                            if (reductionDone) {
-                                successCount++;
-                            }
+                    }
+                    if (!node.deleted && node.isInternalNode()) {
+                        const useNode = node;
+                        const reductionDone = useNode.applyReductionRule();
+                        let eliminationDone = false;
+                        if (!useNode.deleted) {
+                            // not might now be deleted from reduction-rule
+                            eliminationDone = useNode.applyEliminationRule(nodes);
                         }
-                        if (!node.deleted && node.isInternalNode()) {
-                            var useNode = node;
-                            var reductionDone = useNode.applyReductionRule();
-                            var eliminationDone = false;
-                            if (!useNode.deleted) {
-                                // not might now be deleted from reduction-rule
-                                eliminationDone = useNode.applyEliminationRule(nodes);
-                            }
-                            if (reductionDone || eliminationDone) {
-                                successCount++;
-                            }
+                        if (reductionDone || eliminationDone) {
+                            successCount++;
                         }
                     }
                 }
-                catch (e_1_1) { e_1 = { error: e_1_1 }; }
-                finally {
-                    try {
-                        if (nodes_1_1 && !nodes_1_1.done && (_a = nodes_1.return)) _a.call(nodes_1);
-                    }
-                    finally { if (e_1) throw e_1.error; }
-                }
                 lastLevel--;
             }
             if (successCount === 0) {
@@ -150,59 +109,46 @@ var RootNode = /** @class */ (function (_super) {
                 }
             }
         }
-    };
-    RootNode.prototype.getLeafNodes = function () {
-        var lastLevel = util_1.lastOfArray(this.getLevels());
-        var leafNodes = this.getNodesOfLevel(lastLevel).reverse();
+    }
+    getLeafNodes() {
+        const lastLevel = lastOfArray(this.getLevels());
+        const leafNodes = this.getNodesOfLevel(lastLevel).reverse();
         return leafNodes;
-    };
+    }
     /**
      * strips all leaf-nodes
      * with the given value
      */
-    RootNode.prototype.removeIrrelevantLeafNodes = function (leafNodeValue) {
-        var e_2, _a;
-        var done = false;
+    removeIrrelevantLeafNodes(leafNodeValue) {
+        let done = false;
         while (!done) {
-            var countRemoved = 0;
-            var leafNodes = this.getLeafNodes();
-            try {
-                for (var leafNodes_1 = (e_2 = void 0, __values(leafNodes)), leafNodes_1_1 = leafNodes_1.next(); !leafNodes_1_1.done; leafNodes_1_1 = leafNodes_1.next()) {
-                    var leafNode = leafNodes_1_1.value;
-                    var removed = leafNode.removeIfValueEquals(leafNodeValue);
-                    if (removed) {
-                        countRemoved++;
-                    }
+            let countRemoved = 0;
+            const leafNodes = this.getLeafNodes();
+            for (const leafNode of leafNodes) {
+                const removed = leafNode.removeIfValueEquals(leafNodeValue);
+                if (removed) {
+                    countRemoved++;
                 }
             }
-            catch (e_2_1) { e_2 = { error: e_2_1 }; }
-            finally {
-                try {
-                    if (leafNodes_1_1 && !leafNodes_1_1.done && (_a = leafNodes_1.return)) _a.call(leafNodes_1);
-                }
-                finally { if (e_2) throw e_2.error; }
-            }
             this.minimize();
             if (countRemoved === 0) {
                 done = true;
             }
         }
-    };
-    RootNode.prototype.resolve = function (fns, booleanFunctionInput) {
-        var currentNode = this;
+    }
+    resolve(fns, booleanFunctionInput) {
+        let currentNode = this;
         while (true) {
-            var booleanResult = fns[currentNode.level](booleanFunctionInput);
-            var branchKey = util_1.booleanToBooleanString(booleanResult);
+            const booleanResult = fns[currentNode.level](booleanFunctionInput);
+            const branchKey = booleanToBooleanString(booleanResult);
             currentNode = currentNode.branches.getBranch(branchKey);
             if (currentNode.isLeafNode()) {
                 return currentNode.asLeafNode().value;
             }
         }
-    };
-    RootNode.prototype.toSimpleBdd = function () {
-        return minimal_string_1.bddToSimpleBdd(this);
-    };
-    return RootNode;
-}(abstract_node_1.AbstractNode));
-exports.RootNode = RootNode;
+    }
+    toSimpleBdd() {
+        return bddToSimpleBdd(this);
+    }
+}
 //# sourceMappingURL=root-node.js.map

package/dist/lib/root-node.js.map

@@ -1 +1 @@
-{"version":3,"file":"root-node.js","sourceRoot":"","sources":["../../src/root-node.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,iDAA+C;AAC/C,uCAAsC;AAOtC,+BAGgB;AAGhB,mDAAkD;AAElD;IAA8B,4BAAY;IAMtC;QAAA,YACI,kBACI,CAAC,EACD,IAAI,EACJ,UAAU,CACb,SAKJ;QAfM,cAAQ,GAAa,IAAI,mBAAQ,CAAC,KAAI,CAAC,CAAC;QAExC,YAAM,GAAa,EAAE,CAAC;QACtB,kBAAY,GAAmC,IAAI,GAAG,EAAE,CAAC;QAQ5D,KAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,IAAM,SAAS,GAAsB,IAAI,GAAG,EAAE,CAAC;QAC/C,SAAS,CAAC,GAAG,CAAC,KAAI,CAAC,CAAC;QACpB,KAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;;IACxC,CAAC;IAEM,0BAAO,GAAd,UAAe,IAAiB;QAC5B,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC3B;QAED,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjC,IAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,GAAG,CAAC,IAAI,EAAE;IACnB,CAAC;IAED,6BAAU,GAAV,UAAW,IAAiB;QACxB,IAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAqB,CAAC;QAClE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YAChB,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;SAC3D;QACD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAEO,uCAAoB,GAA5B,UAA6B,KAAa;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;SAC3C;IACL,CAAC;IAEM,4BAAS,GAAhB;QACI,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,GAAG,CAAC,EAAL,CAAK,CAAC,CAAC;IACzD,CAAC;IAEM,kCAAe,GAAtB,UAAuB,KAAa;QAChC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjC,IAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAqB,CAAC;QAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAEM,6BAAU,GAAjB;QAAA,iBAOC;QANG,IAAI,GAAG,GAAW,CAAC,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC,OAAO,CAAC,UAAA,KAAK;YAC1B,IAAM,WAAW,GAAG,KAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YACvD,GAAG,GAAG,GAAG,GAAG,WAAW,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;OAEG;IACH,2BAAQ,GAAR,UAAS,QAAyB;;QAAzB,yBAAA,EAAA,gBAAyB;QAC9B,oDAAoD;QACpD,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,OAAO,CAAC,IAAI,EAAE;YACV,IAAI,QAAQ,EAAE;gBACV,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;aAC3C;YACD,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,IAAI,SAAS,GAAG,kBAAW,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;YAC9C,OAAO,SAAS,GAAG,CAAC,EAAE;gBAClB,IAAM,KAAK,GAAmB,IAAI,CAAC,eAAe,CAAC,SAAS,CAAmB,CAAC;gBAChF,IAAI,QAAQ,EAAE;oBACV,OAAO,CAAC,GAAG,CACP,2BAA2B,GAAG,SAAS;wBACvC,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,QAAQ,CACrC,CAAC;oBACF,sBAAsB;iBACzB;gBAED,IAAI,SAAS,GAAG,CAAC,CAAC;;oBAClB,KAAmB,IAAA,yBAAA,SAAA,KAAK,CAAA,CAAA,4BAAA,+CAAE;wBAArB,IAAM,IAAI,kBAAA;wBACX,SAAS,EAAE,CAAC;wBAEZ,gDAAgD;wBAChD,IAAI,QAAQ,IAAI,SAAS,GAAG,IAAI,KAAK,CAAC,EAAE;4BACpC,OAAO,CAAC,GAAG,CACP,mBAAmB,GAAG,IAAI,CAAC,EAAE,CAChC,CAAC;yBACL;wBACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;4BACnB,4CAA4C;4BAC5C,IAAM,aAAa,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,oBAAoB,EAAE,CAAC;4BAC/D,IAAI,aAAa,EAAE;gCACf,YAAY,EAAE,CAAC;6BAClB;yBACJ;wBACD,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE;4BACxC,IAAM,OAAO,GAAG,IAAoB,CAAC;4BACrC,IAAM,aAAa,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;4BACnD,IAAI,eAAe,GAAG,KAAK,CAAC;4BAC5B,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE;gCAClB,+CAA+C;gCAC/C,eAAe,GAAG,OAAO,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;6BACzD;4BACD,IAAI,aAAa,IAAI,eAAe,EAAE;gCAClC,YAAY,EAAE,CAAC;6BAClB;yBACJ;qBACJ;;;;;;;;;gBACD,SAAS,EAAE,CAAC;aACf;YACD,IAAI,YAAY,KAAK,CAAC,EAAE;gBACpB,iCAAiC;gBACjC,IAAI,GAAG,IAAI,CAAC;aACf;iBAAM;gBACH,IAAI,QAAQ,EAAE;oBACV,OAAO,CAAC,GAAG,CACP,kCAAkC;wBAClC,YAAY,GAAG,gBAAgB,CAClC,CAAC;iBACL;aACJ;SACJ;IACL,CAAC;IAEM,+BAAY,GAAnB;QACI,IAAM,SAAS,GAAG,kBAAW,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAChD,IAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,OAAO,EAAgB,CAAC;QAC1E,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,4CAAyB,GAAzB,UAA0B,aAAqB;;QAC3C,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,OAAO,CAAC,IAAI,EAAE;YACV,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,IAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;;gBACtC,KAAuB,IAAA,6BAAA,SAAA,SAAS,CAAA,CAAA,oCAAA,2DAAE;oBAA7B,IAAM,QAAQ,sBAAA;oBACf,IAAM,OAAO,GAAG,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;oBAC5D,IAAI,OAAO,EAAE;wBACT,YAAY,EAAE,CAAC;qBAClB;iBACJ;;;;;;;;;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAEhB,IAAI,YAAY,KAAK,CAAC,EAAE;gBACpB,IAAI,GAAG,IAAI,CAAC;aACf;SACJ;IACL,CAAC;IAED,0BAAO,GAAP,UACI,GAAsB,EACtB,oBAAyB;QAEzB,IAAI,WAAW,GAAiB,IAAI,CAAC;QACrC,OAAO,IAAI,EAAE;YACT,IAAM,aAAa,GAAG,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,oBAAoB,CAAC,CAAC;YACnE,IAAM,SAAS,GAAG,6BAAsB,CAAC,aAAa,CAAC,CAAC;YACxD,WAAW,GAAI,WAA2B,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACzE,IAAI,WAAW,CAAC,UAAU,EAAE,EAAE;gBAC1B,OAAO,WAAW,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC;aACzC;SACJ;IACL,CAAC;IAEM,8BAAW,GAAlB;QACI,OAAO,+BAAc,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACL,eAAC;AAAD,CAAC,AAlLD,CAA8B,4BAAY,GAkLzC;AAlLY,4BAAQ"}
+{"version":3,"file":"root-node.js","sourceRoot":"","sources":["../../src/root-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAOtC,OAAO,EACH,WAAW,EACX,sBAAsB,EACzB,MAAM,QAAQ,CAAC;AAGhB,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,MAAM,OAAO,QAAS,SAAQ,YAAY;IAMtC;QACI,KAAK,CACD,CAAC,EACD,IAAI,EACJ,UAAU,CACb,CAAC;QAVC,aAAQ,GAAa,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAExC,WAAM,GAAa,EAAE,CAAC;QACtB,iBAAY,GAAmC,IAAI,GAAG,EAAE,CAAC;QAQ5D,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,SAAS,GAAsB,IAAI,GAAG,EAAE,CAAC;QAC/C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IAEM,OAAO,CAAC,IAAiB;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC3B;QAED,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,UAAU,CAAC,IAAiB;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAqB,CAAC;QAClE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YAChB,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;SAC3D;QACD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAEO,oBAAoB,CAAC,KAAa;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;SAC3C;IACL,CAAC;IAEM,SAAS;QACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC;IAEM,eAAe,CAAC,KAAa;QAChC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAqB,CAAC;QAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAEM,UAAU;QACb,IAAI,GAAG,GAAW,CAAC,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YACvD,GAAG,GAAG,GAAG,GAAG,WAAW,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,WAAoB,KAAK;QAC9B,oDAAoD;QACpD,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,OAAO,CAAC,IAAI,EAAE;YACV,IAAI,QAAQ,EAAE;gBACV,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;aAC3C;YACD,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,IAAI,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;YAC9C,OAAO,SAAS,GAAG,CAAC,EAAE;gBAClB,MAAM,KAAK,GAAmB,IAAI,CAAC,eAAe,CAAC,SAAS,CAAmB,CAAC;gBAChF,IAAI,QAAQ,EAAE;oBACV,OAAO,CAAC,GAAG,CACP,2BAA2B,GAAG,SAAS;wBACvC,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,QAAQ,CACrC,CAAC;oBACF,sBAAsB;iBACzB;gBAED,IAAI,SAAS,GAAG,CAAC,CAAC;gBAClB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;oBACtB,SAAS,EAAE,CAAC;oBAEZ,gDAAgD;oBAChD,IAAI,QAAQ,IAAI,SAAS,GAAG,IAAI,KAAK,CAAC,EAAE;wBACpC,OAAO,CAAC,GAAG,CACP,mBAAmB,GAAG,IAAI,CAAC,EAAE,CAChC,CAAC;qBACL;oBACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;wBACnB,4CAA4C;wBAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,oBAAoB,EAAE,CAAC;wBAC/D,IAAI,aAAa,EAAE;4BACf,YAAY,EAAE,CAAC;yBAClB;qBACJ;oBACD,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE;wBACxC,MAAM,OAAO,GAAG,IAAoB,CAAC;wBACrC,MAAM,aAAa,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;wBACnD,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE;4BAClB,+CAA+C;4BAC/C,eAAe,GAAG,OAAO,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;yBACzD;wBACD,IAAI,aAAa,IAAI,eAAe,EAAE;4BAClC,YAAY,EAAE,CAAC;yBAClB;qBACJ;iBACJ;gBACD,SAAS,EAAE,CAAC;aACf;YACD,IAAI,YAAY,KAAK,CAAC,EAAE;gBACpB,iCAAiC;gBACjC,IAAI,GAAG,IAAI,CAAC;aACf;iBAAM;gBACH,IAAI,QAAQ,EAAE;oBACV,OAAO,CAAC,GAAG,CACP,kCAAkC;wBAClC,YAAY,GAAG,gBAAgB,CAClC,CAAC;iBACL;aACJ;SACJ;IACL,CAAC;IAEM,YAAY;QACf,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,OAAO,EAAgB,CAAC;QAC1E,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,yBAAyB,CAAC,aAAqB;QAC3C,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,OAAO,CAAC,IAAI,EAAE;YACV,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBAC5D,IAAI,OAAO,EAAE;oBACT,YAAY,EAAE,CAAC;iBAClB;aACJ;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAEhB,IAAI,YAAY,KAAK,CAAC,EAAE;gBACpB,IAAI,GAAG,IAAI,CAAC;aACf;SACJ;IACL,CAAC;IAED,OAAO,CACH,GAAsB,EACtB,oBAAyB;QAEzB,IAAI,WAAW,GAAiB,IAAI,CAAC;QACrC,OAAO,IAAI,EAAE;YACT,MAAM,aAAa,GAAG,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,oBAAoB,CAAC,CAAC;YACnE,MAAM,SAAS,GAAG,sBAAsB,CAAC,aAAa,CAAC,CAAC;YACxD,WAAW,GAAI,WAA2B,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACzE,IAAI,WAAW,CAAC,UAAU,EAAE,EAAE;gBAC1B,OAAO,WAAW,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC;aACzC;SACJ;IACL,CAAC;IAEM,WAAW;QACd,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;CACJ"}

package/dist/lib/types.d.ts

@@ -1,23 +1,23 @@
 import { LeafNode } from './leaf-node';
 import { InternalNode } from './internal-node';
 import { RootNode } from './root-node';
-export declare type NodeType = 'LeafNode' | 'InternalNode' | 'RootNode';
-export declare type NonLeafNode = InternalNode | RootNode;
-export declare type NonRootNode = InternalNode | LeafNode;
-export declare type TruthTable = Map<string, number>;
-export declare type BooleanString = '0' | '1';
-export declare type ResolverFunction<T> = (i: T) => boolean;
-export declare type ResolverFunctions<T = any> = {
+export type NodeType = 'LeafNode' | 'InternalNode' | 'RootNode';
+export type NonLeafNode = InternalNode | RootNode;
+export type NonRootNode = InternalNode | LeafNode;
+export type TruthTable = Map<string, number>;
+export type BooleanString = '0' | '1';
+export type ResolverFunction<T> = (i: T) => boolean;
+export type ResolverFunctions<T = any> = {
     [k: number]: ResolverFunction<T>;
 };
-export declare type SimpleBddLeafNode = number;
+export type SimpleBddLeafNode = number;
 /**
  * a simple bdd is a json-representation
  * which could be parsed from the minimal string
  * use this to have great performance
  * when resolving values
  */
-export declare type SimpleBdd = {
+export type SimpleBdd = {
     0: SimpleBdd | SimpleBddLeafNode;
     1: SimpleBdd | SimpleBddLeafNode;
     l: number;

package/dist/lib/types.js

@@ -1,3 +1,2 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
+export {};
 //# sourceMappingURL=types.js.map

package/dist/lib/util.d.ts

@@ -1,4 +1,4 @@
-import { BooleanString } from './types';
+import type { BooleanString } from './types';
 export declare function booleanStringToBoolean(str: BooleanString): boolean;
 export declare function booleanToBooleanString(b: boolean): BooleanString;
 export declare function oppositeBoolean(input: BooleanString): BooleanString;

package/dist/lib/util.js

@@ -1,22 +1,4 @@
-"use strict";
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-function booleanStringToBoolean(str) {
+export function booleanStringToBoolean(str) {
     if (str === '1') {
         return true;
     }
@@ -24,8 +6,7 @@ function booleanStringToBoolean(str) {
         return false;
     }
 }
-exports.booleanStringToBoolean = booleanStringToBoolean;
-function booleanToBooleanString(b) {
+export function booleanToBooleanString(b) {
     if (b) {
         return '1';
     }
@@ -33,8 +14,7 @@ function booleanToBooleanString(b) {
         return '0';
     }
 }
-exports.booleanToBooleanString = booleanToBooleanString;
-function oppositeBoolean(input) {
+export function oppositeBoolean(input) {
     if (input === '1') {
         return '0';
     }
@@ -42,42 +22,37 @@ function oppositeBoolean(input) {
         return '1';
     }
 }
-exports.oppositeBoolean = oppositeBoolean;
-function lastChar(str) {
+export function lastChar(str) {
     return str.slice(-1);
 }
-exports.lastChar = lastChar;
 /**
  * @link https://stackoverflow.com/a/1349426
  */
-function makeid(length) {
-    if (length === void 0) { length = 6; }
-    var result = '';
-    var characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
-    var charactersLength = characters.length;
-    for (var i = 0; i < length; i++) {
+function makeid(length = 6) {
+    let result = '';
+    const characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
+    const charactersLength = characters.length;
+    for (let i = 0; i < length; i++) {
         result += characters.charAt(Math.floor(Math.random() * charactersLength));
     }
     return result;
 }
-var nodeIdPrefix = makeid(4);
-var lastIdGen = 0;
-function nextNodeId() {
-    var ret = 'node_' + nodeIdPrefix + '_' + lastIdGen;
+const nodeIdPrefix = makeid(4);
+let lastIdGen = 0;
+export function nextNodeId() {
+    const ret = 'node_' + nodeIdPrefix + '_' + lastIdGen;
     lastIdGen++;
     return ret;
 }
-exports.nextNodeId = nextNodeId;
 /**
  * @link https://stackoverflow.com/a/16155417
  */
-function decimalToPaddedBinary(decimal, padding) {
-    var binary = (decimal >>> 0).toString(2);
-    var padded = binary.padStart(padding, '0');
+export function decimalToPaddedBinary(decimal, padding) {
+    const binary = (decimal >>> 0).toString(2);
+    const padded = binary.padStart(padding, '0');
     return padded;
 }
-exports.decimalToPaddedBinary = decimalToPaddedBinary;
-function oppositeBinary(i) {
+export function oppositeBinary(i) {
     if (i === '1') {
         return '0';
     }
@@ -88,57 +63,47 @@ function oppositeBinary(i) {
         throw new Error('non-binary given');
     }
 }
-exports.oppositeBinary = oppositeBinary;
-function binaryToDecimal(binary) {
+export function binaryToDecimal(binary) {
     return parseInt(binary, 2);
 }
-exports.binaryToDecimal = binaryToDecimal;
-function minBinaryWithLength(length) {
-    return new Array(length).fill(0).map(function () { return '0'; }).join('');
+export function minBinaryWithLength(length) {
+    return new Array(length).fill(0).map(() => '0').join('');
 }
-exports.minBinaryWithLength = minBinaryWithLength;
-function maxBinaryWithLength(length) {
-    return new Array(length).fill(0).map(function () { return '1'; }).join('');
+export function maxBinaryWithLength(length) {
+    return new Array(length).fill(0).map(() => '1').join('');
 }
-exports.maxBinaryWithLength = maxBinaryWithLength;
-function getNextStateSet(stateSet) {
-    var decimal = binaryToDecimal(stateSet);
-    var increase = decimal + 1;
-    var binary = decimalToPaddedBinary(increase, stateSet.length);
+export function getNextStateSet(stateSet) {
+    const decimal = binaryToDecimal(stateSet);
+    const increase = decimal + 1;
+    const binary = decimalToPaddedBinary(increase, stateSet.length);
     return binary;
 }
-exports.getNextStateSet = getNextStateSet;
-function firstKeyOfMap(map) {
-    var iterator1 = map.keys();
+export function firstKeyOfMap(map) {
+    const iterator1 = map.keys();
     return iterator1.next().value;
 }
-exports.firstKeyOfMap = firstKeyOfMap;
 /**
  * Shuffles array in place. ES6 version
  * @link https://stackoverflow.com/a/6274381
  */
-function shuffleArray(a) {
-    var _a;
-    for (var i = a.length - 1; i > 0; i--) {
-        var j = Math.floor(Math.random() * (i + 1));
-        _a = __read([a[j], a[i]], 2), a[i] = _a[0], a[j] = _a[1];
+export function shuffleArray(a) {
+    for (let i = a.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [a[i], a[j]] = [a[j], a[i]];
     }
     return a;
 }
-exports.shuffleArray = shuffleArray;
-function lastOfArray(ar) {
+export function lastOfArray(ar) {
     return ar[ar.length - 1];
 }
-exports.lastOfArray = lastOfArray;
 /**
  * @link https://stackoverflow.com/a/6259536
  */
-function splitStringToChunks(str, chunkSize) {
-    var chunks = [];
-    for (var i = 0, charsLength = str.length; i < charsLength; i += chunkSize) {
+export function splitStringToChunks(str, chunkSize) {
+    const chunks = [];
+    for (let i = 0, charsLength = str.length; i < charsLength; i += chunkSize) {
         chunks.push(str.substring(i, i + chunkSize));
     }
     return chunks;
 }
-exports.splitStringToChunks = splitStringToChunks;
 //# sourceMappingURL=util.js.map

package/dist/lib/util.js.map

@@ -1 +1 @@
-{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/util.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAEA,SAAgB,sBAAsB,CAAC,GAAkB;IACrD,IAAI,GAAG,KAAK,GAAG,EAAE;QACb,OAAO,IAAI,CAAC;KACf;SAAM;QACH,OAAO,KAAK,CAAC;KAChB;AACL,CAAC;AAND,wDAMC;AAED,SAAgB,sBAAsB,CAAC,CAAU;IAC7C,IAAI,CAAC,EAAE;QACH,OAAO,GAAG,CAAC;KACd;SAAM;QACH,OAAO,GAAG,CAAC;KACd;AACL,CAAC;AAND,wDAMC;AAED,SAAgB,eAAe,CAAC,KAAoB;IAChD,IAAI,KAAK,KAAK,GAAG,EAAE;QACf,OAAO,GAAG,CAAC;KACd;SAAM;QACH,OAAO,GAAG,CAAC;KACd;AACL,CAAC;AAND,0CAMC;AAED,SAAgB,QAAQ,CAAC,GAAW;IAChC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAFD,4BAEC;AAED;;GAEG;AACH,SAAS,MAAM,CAAC,MAAkB;IAAlB,uBAAA,EAAA,UAAkB;IAC9B,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAM,UAAU,GAAG,gEAAgE,CAAC;IACpF,IAAM,gBAAgB,GAAG,UAAU,CAAC,MAAM,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC;KAC7E;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,IAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAC/B,IAAI,SAAS,GAAG,CAAC,CAAC;AAClB,SAAgB,UAAU;IACtB,IAAM,GAAG,GAAG,OAAO,GAAG,YAAY,GAAG,GAAG,GAAG,SAAS,CAAC;IACrD,SAAS,EAAE,CAAC;IACZ,OAAO,GAAG,CAAC;AACf,CAAC;AAJD,gCAIC;AAED;;GAEG;AACH,SAAgB,qBAAqB,CACjC,OAAe,EACf,OAAe;IAEf,IAAM,MAAM,GAAG,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC3C,IAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC7C,OAAO,MAAM,CAAC;AAClB,CAAC;AAPD,sDAOC;AAED,SAAgB,cAAc,CAAC,CAAS;IACpC,IAAI,CAAC,KAAK,GAAG,EAAE;QACX,OAAO,GAAG,CAAC;KACd;SAAM,IAAI,CAAC,KAAK,GAAG,EAAE;QAClB,OAAO,GAAG,CAAC;KACd;SAAM;QACH,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;KACvC;AACL,CAAC;AARD,wCAQC;AAED,SAAgB,eAAe,CAAC,MAAc;IAC1C,OAAO,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC/B,CAAC;AAFD,0CAEC;AAED,SAAgB,mBAAmB,CAAC,MAAc;IAC9C,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,cAAM,OAAA,GAAG,EAAH,CAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7D,CAAC;AAFD,kDAEC;AAED,SAAgB,mBAAmB,CAAC,MAAc;IAC9C,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,cAAM,OAAA,GAAG,EAAH,CAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7D,CAAC;AAFD,kDAEC;AAED,SAAgB,eAAe,CAC3B,QAAgB;IAEhB,IAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC1C,IAAM,QAAQ,GAAG,OAAO,GAAG,CAAC,CAAC;IAC7B,IAAM,MAAM,GAAG,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChE,OAAO,MAAM,CAAC;AAClB,CAAC;AAPD,0CAOC;AAED,SAAgB,aAAa,CAAC,GAAqB;IAC/C,IAAM,SAAS,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;AAClC,CAAC;AAHD,sCAGC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAI,CAAM;;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACnC,IAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,4BAA2B,EAA1B,YAAI,EAAE,YAAI,CAAiB;KAC/B;IACD,OAAO,CAAC,CAAC;AACb,CAAC;AAND,oCAMC;AAED,SAAgB,WAAW,CAAI,EAAO;IAClC,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAFD,kCAEC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAC,GAAW,EAAE,SAAiB;IAC9D,IAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,WAAW,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,SAAS,EAAE;QACvE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;KAChD;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAPD,kDAOC"}
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/util.ts"],"names":[],"mappings":"AAEA,MAAM,UAAU,sBAAsB,CAAC,GAAkB;IACrD,IAAI,GAAG,KAAK,GAAG,EAAE;QACb,OAAO,IAAI,CAAC;KACf;SAAM;QACH,OAAO,KAAK,CAAC;KAChB;AACL,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,CAAU;IAC7C,IAAI,CAAC,EAAE;QACH,OAAO,GAAG,CAAC;KACd;SAAM;QACH,OAAO,GAAG,CAAC;KACd;AACL,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAoB;IAChD,IAAI,KAAK,KAAK,GAAG,EAAE;QACf,OAAO,GAAG,CAAC;KACd;SAAM;QACH,OAAO,GAAG,CAAC;KACd;AACL,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,GAAW;IAChC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,MAAM,CAAC,SAAiB,CAAC;IAC9B,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,MAAM,UAAU,GAAG,gEAAgE,CAAC;IACpF,MAAM,gBAAgB,GAAG,UAAU,CAAC,MAAM,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC;KAC7E;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAC/B,IAAI,SAAS,GAAG,CAAC,CAAC;AAClB,MAAM,UAAU,UAAU;IACtB,MAAM,GAAG,GAAG,OAAO,GAAG,YAAY,GAAG,GAAG,GAAG,SAAS,CAAC;IACrD,SAAS,EAAE,CAAC;IACZ,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACjC,OAAe,EACf,OAAe;IAEf,MAAM,MAAM,GAAG,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC7C,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,CAAS;IACpC,IAAI,CAAC,KAAK,GAAG,EAAE;QACX,OAAO,GAAG,CAAC;KACd;SAAM,IAAI,CAAC,KAAK,GAAG,EAAE;QAClB,OAAO,GAAG,CAAC;KACd;SAAM;QACH,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;KACvC;AACL,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,MAAc;IAC1C,OAAO,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAc;IAC9C,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAc;IAC9C,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,eAAe,CAC3B,QAAgB;IAEhB,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,OAAO,GAAG,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChE,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,GAAqB;IAC/C,MAAM,SAAS,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAI,CAAM;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAC/B;IACD,OAAO,CAAC,CAAC;AACb,CAAC;AAED,MAAM,UAAU,WAAW,CAAI,EAAO;IAClC,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAW,EAAE,SAAiB;IAC9D,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,WAAW,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,SAAS,EAAE;QACvE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;KAChD;IACD,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "binary-decision-diagram",
-  "version": "1.3.1",
+  "version": "2.0.0",
   "description": "A library to create, minimize and optimize binary decision diagrams",
   "keywords": [
     "binary decision diagram",
@@ -18,28 +18,33 @@
     "url": "https://github.com/pubkey/binary-decision-diagram/issues"
   },
   "homepage": "https://github.com/pubkey/binary-decision-diagram#readme",
+  "exports": {
+    ".": {
+      "import": "./dist/es/index.js",
+      "default": "./dist/lib/index.js"
+    }
+  },
   "main": "./dist/lib/index.js",
-  "jsnext:main": "./dist/es/index.js",
   "module": "./dist/es/index.js",
-  "sideEffects": false,
   "types": "./dist/es/index.d.ts",
+  "sideEffects": false,
   "scripts": {
     "lint": "tslint --project .",
     "lint:fix": "tslint --project . --fix",
     "transpile": "tsc -p ./ && echo '# transpile es5 (require) sucess!'",
-    "transpile:es": "tsc -p ./ --target ES5 --module ES6 --outDir ./dist/es && echo '# transpile es (modules) sucess!'",
+    "transpile:es": "tsc -p ./ --module ES6 --outDir ./dist/es && echo '# transpile es (modules) sucess!'",
     "build": "rimraf -r ./dist && npm run transpile && npm run transpile:es",
     "test": "mocha -r ts-node/register test/unit/index.test.ts --timeout 40000 --bail"
   },
   "devDependencies": {
-    "@types/mocha": "7.0.2",
-    "@types/node": "13.13.4",
+    "@types/mocha": "10.0.1",
+    "@types/node": "18.11.18",
     "assert": "2.0.0",
-    "async-test-util": "1.7.3",
-    "mocha": "7.1.2",
+    "async-test-util": "2.0.0",
+    "mocha": "10.2.0",
     "rimraf": "3.0.2",
-    "ts-node": "8.9.1",
-    "tslint": "6.1.2",
-    "typescript": "3.8.3"
+    "ts-node": "10.9.1",
+    "tslint": "6.1.3",
+    "typescript": "4.9.4"
   }
 }

package/renovate.json

@@ -3,5 +3,6 @@
         "config:base"
     ],
     "statusCheckVerify": true,
-    "automerge": true
-}
+    "automerge": true,
+    "dependencyDashboard": false
+}

package/src/abstract-node.ts

@@ -1,5 +1,5 @@
 import { nextNodeId } from './util';
-import { NonRootNode, NonLeafNode, NodeType } from './types';
+import type { NonRootNode, NonLeafNode, NodeType } from './types';
 import { Branches } from './branches';
 import { RootNode } from './root-node';
 import { InternalNode } from './internal-node';

package/src/branches.ts

@@ -1,5 +1,4 @@
-import { BooleanString, NonRootNode, NonLeafNode } from './types';
-import { oppositeBoolean } from './util';
+import type { BooleanString, NonRootNode, NonLeafNode } from './types';
 import { AbstractNode } from './abstract-node';
 
 /**