binary-decision-diagram 3.0.1 → 3.0.2

package/dist/cjs/src/minimal-string/bdd-to-minimal-string.js

@@ -0,0 +1,60 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nodeToString = exports.bddToMinimalString = void 0;
+const string_format_js_1 = require("./string-format.js");
+const string_format_js_2 = require("./string-format.js");
+function bddToMinimalString(bdd) {
+    let ret = '';
+    let currentCharCode = string_format_js_2.FIRST_CHAR_CODE_FOR_ID;
+    // add leaf node count
+    const leafNodeAmount = bdd.getLeafNodes().length;
+    if (leafNodeAmount > 99) {
+        throw new Error('cannot build string with too many leaf nodes');
+    }
+    ret += leafNodeAmount.toString().padStart(2, '0');
+    const levelsHighestFirst = bdd.levels.slice().reverse();
+    const idByNode = new Map();
+    levelsHighestFirst.forEach(level => {
+        const nodes = bdd.getNodesOfLevel(level);
+        nodes.forEach(node => {
+            const stringRep = nodeToString(node, idByNode, currentCharCode);
+            currentCharCode = stringRep.nextCode;
+            idByNode.set(node, stringRep.id);
+            ret += stringRep.str;
+        });
+    });
+    return ret;
+}
+exports.bddToMinimalString = bddToMinimalString;
+function nodeToString(node, idByNode, lastCode) {
+    const nextId = (0, string_format_js_1.getNextCharId)(lastCode);
+    switch (node.type) {
+        case 'LeafNode':
+            const valueChar = (0, string_format_js_1.getCharOfValue)(node.asLeafNode().value);
+            return {
+                id: nextId.char,
+                nextCode: nextId.nextCode,
+                str: nextId.char + valueChar
+            };
+        case 'InternalNode':
+            const branch0Id = idByNode.get(node.asInternalNode().branches.getBranch('0'));
+            const branch1Id = idByNode.get(node.asInternalNode().branches.getBranch('1'));
+            return {
+                id: nextId.char,
+                nextCode: nextId.nextCode,
+                str: nextId.char + branch0Id + branch1Id + (0, string_format_js_1.getCharOfLevel)(node.level)
+            };
+        case 'RootNode':
+            const branch0IdRoot = idByNode.get(node.asRootNode().branches.getBranch('0'));
+            const branch1IdRoot = idByNode.get(node.asRootNode().branches.getBranch('1'));
+            return {
+                id: nextId.char,
+                nextCode: nextId.nextCode,
+                str: '' + branch0IdRoot + branch1IdRoot + (0, string_format_js_1.getCharOfLevel)(node.level)
+            };
+        default:
+            throw new Error('unknown node type');
+    }
+}
+exports.nodeToString = nodeToString;
+//# sourceMappingURL=bdd-to-minimal-string.js.map

package/dist/cjs/src/minimal-string/bdd-to-minimal-string.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bdd-to-minimal-string.js","sourceRoot":"","sources":["../../../../src/minimal-string/bdd-to-minimal-string.ts"],"names":[],"mappings":";;;AAEA,yDAAmF;AACnF,yDAE4B;AAG5B,SAAgB,kBAAkB,CAAC,GAAa;IAC5C,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,eAAe,GAAG,yCAAsB,CAAC;IAE7C,sBAAsB;IACtB,MAAM,cAAc,GAAG,GAAG,CAAC,YAAY,EAAE,CAAC,MAAM,CAAC;IACjD,IAAI,cAAc,GAAG,EAAE,EAAE;QACrB,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;KACnE;IAED,GAAG,IAAI,cAAc,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAElD,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;IACxD,MAAM,QAAQ,GAA8B,IAAI,GAAG,EAAE,CAAC;IACtD,kBAAkB,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QAC/B,MAAM,KAAK,GAAG,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QACzC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACjB,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;YAChE,eAAe,GAAG,SAAS,CAAC,QAAQ,CAAC;YACrC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YACjC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC;QACzB,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACf,CAAC;AAxBD,gDAwBC;AAED,SAAgB,YAAY,CACxB,IAAkB,EAClB,QAAmC,EACnC,QAAgB;IAMhB,MAAM,MAAM,GAAG,IAAA,gCAAa,EAAC,QAAQ,CAAC,CAAC;IACvC,QAAQ,IAAI,CAAC,IAAI,EAAE;QACf,KAAK,UAAU;YACX,MAAM,SAAS,GAAG,IAAA,iCAAc,EAAC,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC;YAC1D,OAAO;gBACH,EAAE,EAAE,MAAM,CAAC,IAAI;gBACf,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,GAAG,EAAE,MAAM,CAAC,IAAI,GAAG,SAAS;aAC/B,CAAC;QACN,KAAK,cAAc;YACf,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,OAAO;gBACH,EAAE,EAAE,MAAM,CAAC,IAAI;gBACf,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,GAAG,EAAE,MAAM,CAAC,IAAI,GAAG,SAAS,GAAG,SAAS,GAAG,IAAA,iCAAc,EAAC,IAAI,CAAC,KAAK,CAAC;aACxE,CAAC;QACN,KAAK,UAAU;YACX,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,OAAO;gBACH,EAAE,EAAE,MAAM,CAAC,IAAI;gBACf,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,GAAG,EAAE,EAAE,GAAG,aAAa,GAAG,aAAa,GAAG,IAAA,iCAAc,EAAC,IAAI,CAAC,KAAK,CAAC;aACvE,CAAC;QACN;YACI,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;KAC5C;AACL,CAAC;AArCD,oCAqCC"}

package/dist/cjs/src/minimal-string/bdd-to-simple-bdd.js

@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nodeToSimpleBddNode = exports.bddToSimpleBdd = void 0;
+/**
+ * @recursive
+ */
+function bddToSimpleBdd(bdd) {
+    return nodeToSimpleBddNode(bdd);
+}
+exports.bddToSimpleBdd = bddToSimpleBdd;
+/**
+ * @recursive
+ */
+function nodeToSimpleBddNode(node) {
+    const branch0 = node.branches.getBranch('0');
+    const branch1 = node.branches.getBranch('1');
+    return {
+        l: node.level,
+        0: branch0.isLeafNode() ? branch0.asLeafNode().value : nodeToSimpleBddNode(branch0),
+        1: branch1.isLeafNode() ? branch1.asLeafNode().value : nodeToSimpleBddNode(branch1),
+    };
+}
+exports.nodeToSimpleBddNode = nodeToSimpleBddNode;
+//# sourceMappingURL=bdd-to-simple-bdd.js.map

package/dist/cjs/src/minimal-string/bdd-to-simple-bdd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bdd-to-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/bdd-to-simple-bdd.ts"],"names":[],"mappings":";;;AAOA;;GAEG;AACH,SAAgB,cAAc,CAAC,GAAa;IACxC,OAAO,mBAAmB,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC;AAFD,wCAEC;AAGD;;GAEG;AACH,SAAgB,mBAAmB,CAC/B,IAAkB;IAGlB,MAAM,OAAO,GAAkB,IAAqB,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC7E,MAAM,OAAO,GAAkB,IAAqB,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAE7E,OAAO;QACH,CAAC,EAAE,IAAI,CAAC,KAAK;QACb,CAAC,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC;QACnF,CAAC,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC;KACtF,CAAC;AACN,CAAC;AAZD,kDAYC"}

package/dist/cjs/src/minimal-string/index.js

@@ -0,0 +1,22 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./bdd-to-minimal-string.js"), exports);
+__exportStar(require("./minimal-string-to-simple-bdd.js"), exports);
+__exportStar(require("./resolve-with-simple-bdd.js"), exports);
+__exportStar(require("./string-format.js"), exports);
+__exportStar(require("./bdd-to-simple-bdd.js"), exports);
+//# sourceMappingURL=index.js.map

package/dist/cjs/src/minimal-string/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/minimal-string/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,6DAA2C;AAC3C,oEAAkD;AAClD,+DAA6C;AAC7C,qDAAmC;AACnC,yDAAuC"}

package/dist/cjs/src/minimal-string/minimal-string-to-simple-bdd.js

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.minimalStringToSimpleBdd = void 0;
+const util_js_1 = require("../util.js");
+const string_format_js_1 = require("./string-format.js");
+function minimalStringToSimpleBdd(str) {
+    const nodesById = new Map();
+    // parse leaf nodes
+    const leafNodeAmount = parseInt(str.charAt(0) + str.charAt(1), 10);
+    const lastLeafNodeChar = (2 + leafNodeAmount * 2);
+    const leafNodeChars = str.substring(2, lastLeafNodeChar);
+    const leafNodeChunks = (0, util_js_1.splitStringToChunks)(leafNodeChars, 2);
+    for (let i = 0; i < leafNodeChunks.length; i++) {
+        const chunk = leafNodeChunks[i];
+        const id = chunk.charAt(0);
+        const value = (0, string_format_js_1.getNumberOfChar)(chunk.charAt(1));
+        nodesById.set(id, value);
+    }
+    // parse internal nodes
+    const internalNodeChars = str.substring(lastLeafNodeChar, str.length - 3);
+    const internalNodeChunks = (0, util_js_1.splitStringToChunks)(internalNodeChars, 4);
+    for (let i = 0; i < internalNodeChunks.length; i++) {
+        const chunk = internalNodeChunks[i];
+        const id = chunk.charAt(0);
+        const idOf0Branch = chunk.charAt(1);
+        const idOf1Branch = chunk.charAt(2);
+        const level = (0, string_format_js_1.getNumberOfChar)(chunk.charAt(3));
+        if (!nodesById.has(idOf0Branch)) {
+            throw new Error('missing node with id ' + idOf0Branch);
+        }
+        if (!nodesById.has(idOf1Branch)) {
+            throw new Error('missing node with id ' + idOf1Branch);
+        }
+        const node0 = nodesById.get(idOf0Branch);
+        const node1 = nodesById.get(idOf1Branch);
+        const node = {
+            l: level,
+            0: node0,
+            1: node1
+        };
+        nodesById.set(id, node);
+    }
+    // parse root node
+    const last3 = str.slice(-3);
+    const idOf0 = last3.charAt(0);
+    const idOf1 = last3.charAt(1);
+    const levelOfRoot = (0, string_format_js_1.getNumberOfChar)(last3.charAt(2));
+    const nodeOf0 = nodesById.get(idOf0);
+    const nodeOf1 = nodesById.get(idOf1);
+    const rootNode = {
+        l: levelOfRoot,
+        0: nodeOf0,
+        1: nodeOf1,
+    };
+    return rootNode;
+}
+exports.minimalStringToSimpleBdd = minimalStringToSimpleBdd;
+//# sourceMappingURL=minimal-string-to-simple-bdd.js.map

package/dist/cjs/src/minimal-string/minimal-string-to-simple-bdd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimal-string-to-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/minimal-string-to-simple-bdd.ts"],"names":[],"mappings":";;;AAIA,wCAAiD;AACjD,yDAAqD;AAErD,SAAgB,wBAAwB,CACpC,GAAW;IAEX,MAAM,SAAS,GAA+C,IAAI,GAAG,EAAE,CAAC;IAExE,mBAAmB;IACnB,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACnE,MAAM,gBAAgB,GAAG,CAAC,CAAC,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,aAAa,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACzD,MAAM,cAAc,GAAG,IAAA,6BAAmB,EAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC5C,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAsB,IAAA,kCAAe,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;KAC5B;IAED,uBAAuB;IACvB,MAAM,iBAAiB,GAAG,GAAG,CAAC,SAAS,CAAC,gBAAgB,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1E,MAAM,kBAAkB,GAAG,IAAA,6BAAmB,EAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAChD,MAAM,KAAK,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAA,kCAAe,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAG/C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;YAC7B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,WAAW,CAAC,CAAC;SAC1D;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;YAC7B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,WAAW,CAAC,CAAC;SAC1D;QAED,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAc,CAAC;QACtD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAc,CAAC;QACtD,MAAM,IAAI,GAAc;YACpB,CAAC,EAAE,KAAK;YACR,CAAC,EAAE,KAAK;YACR,CAAC,EAAE,KAAK;SACX,CAAC;QACF,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;KAC3B;IAED,kBAAkB;IAClB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,WAAW,GAAG,IAAA,kCAAe,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAc,CAAC;IAClD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAc,CAAC;IAClD,MAAM,QAAQ,GAAc;QACxB,CAAC,EAAE,WAAW;QACd,CAAC,EAAE,OAAO;QACV,CAAC,EAAE,OAAO;KACb,CAAC;IAEF,OAAO,QAAQ,CAAC;AACpB,CAAC;AA3DD,4DA2DC"}

package/dist/cjs/src/minimal-string/resolve-with-simple-bdd.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.resolveWithSimpleBdd = void 0;
+const util_js_1 = require("../util.js");
+function resolveWithSimpleBdd(simpleBdd, fns, input) {
+    let currentNode = simpleBdd;
+    let currentLevel = simpleBdd.l;
+    while (true) {
+        const booleanResult = fns[currentLevel](input);
+        const branchKey = (0, util_js_1.booleanToBooleanString)(booleanResult);
+        currentNode = currentNode[branchKey];
+        if (typeof currentNode === 'number' || typeof currentNode === 'string') {
+            return currentNode;
+        }
+        else {
+            currentLevel = currentNode.l;
+        }
+    }
+}
+exports.resolveWithSimpleBdd = resolveWithSimpleBdd;
+//# sourceMappingURL=resolve-with-simple-bdd.js.map

package/dist/cjs/src/minimal-string/resolve-with-simple-bdd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-with-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/resolve-with-simple-bdd.ts"],"names":[],"mappings":";;;AAKA,wCAAoD;AAEpD,SAAgB,oBAAoB,CAChC,SAAoB,EACpB,GAAsB,EACtB,KAAU;IAEV,IAAI,WAAW,GAAkC,SAAS,CAAC;IAC3D,IAAI,YAAY,GAAW,SAAS,CAAC,CAAC,CAAC;IACvC,OAAO,IAAI,EAAE;QACT,MAAM,aAAa,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAA,gCAAsB,EAAC,aAAa,CAAC,CAAC;QACxD,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE;YACpE,OAAO,WAAkB,CAAC;SAC7B;aAAM;YACH,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC;SAChC;KACJ;AACL,CAAC;AAjBD,oDAiBC"}

package/dist/cjs/src/minimal-string/string-format.js

@@ -0,0 +1,61 @@
+"use strict";
+/*
+let t = 0;
+while (t < 10000) {
+    const char = String.fromCharCode(t);
+    console.log(t + ' : ' + char);
+    t++;
+}
+*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getNextCharId = exports.FIRST_CHAR_CODE_FOR_ID = exports.getCharOfValue = exports.getNumberOfChar = exports.getCharOfLevel = exports.CHAR_CODE_OFFSET = void 0;
+/*
+
+To have a really small string representation, we have to hack some stuff
+which makes is complicated but effective.
+
+Rules for the string:
+- The string starts with a number like '23' that defines how many leaf-nodes we have
+- leaf nodes consist of two chars like 'ab'
+    - the first char is the id
+    - the second the value is a number you can get via String.charCodeAt()
+- Internal nodes have four chars like 'abcd'
+    - the first char is the id
+    - the second char is the id of the 0-branch
+    - the third char is the id of the 1-branch
+    - the last char is the id of the boolean-function (= level)
+- The last 3 chars of the string is the root node like 'abc'
+    - it looks like the internal-node but without the id (first char)
+
+*/
+// we use this because 39 is the quotes which causes problems
+exports.CHAR_CODE_OFFSET = 40; // String.fromCharCode(33) === ')'
+function getCharOfLevel(level) {
+    const charCode = exports.CHAR_CODE_OFFSET + level;
+    return String.fromCharCode(charCode);
+}
+exports.getCharOfLevel = getCharOfLevel;
+function getNumberOfChar(char) {
+    const charCode = char.charCodeAt(0);
+    return charCode - exports.CHAR_CODE_OFFSET;
+}
+exports.getNumberOfChar = getNumberOfChar;
+function getCharOfValue(value) {
+    const charCode = exports.CHAR_CODE_OFFSET + value;
+    return String.fromCharCode(charCode);
+}
+exports.getCharOfValue = getCharOfValue;
+exports.FIRST_CHAR_CODE_FOR_ID = 97; // String.fromCharCode(97) === 'a'
+function getNextCharId(lastCode) {
+    // jump these codes because they look strange
+    if (lastCode >= 128 && lastCode <= 160) {
+        lastCode = 161;
+    }
+    const char = String.fromCharCode(lastCode);
+    return {
+        char,
+        nextCode: lastCode + 1
+    };
+}
+exports.getNextCharId = getNextCharId;
+//# sourceMappingURL=string-format.js.map

package/dist/cjs/src/minimal-string/string-format.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"string-format.js","sourceRoot":"","sources":["../../../../src/minimal-string/string-format.ts"],"names":[],"mappings":";AAAA;;;;;;;EAOE;;;AAEF;;;;;;;;;;;;;;;;;;EAkBE;AAEF,6DAA6D;AAChD,QAAA,gBAAgB,GAAG,EAAE,CAAC,CAAC,kCAAkC;AAGtE,SAAgB,cAAc,CAAC,KAAa;IACxC,MAAM,QAAQ,GAAG,wBAAgB,GAAG,KAAK,CAAC;IAC1C,OAAO,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;AACzC,CAAC;AAHD,wCAGC;AAED,SAAgB,eAAe,CAAC,IAAY;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,QAAQ,GAAG,wBAAgB,CAAC;AACvC,CAAC;AAHD,0CAGC;AAED,SAAgB,cAAc,CAAC,KAAa;IACxC,MAAM,QAAQ,GAAG,wBAAgB,GAAG,KAAK,CAAC;IAC1C,OAAO,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;AACzC,CAAC;AAHD,wCAGC;AAGY,QAAA,sBAAsB,GAAG,EAAE,CAAC,CAAC,kCAAkC;AAE5E,SAAgB,aAAa,CAAC,QAAgB;IAK1C,6CAA6C;IAC7C,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG,EAAE;QACpC,QAAQ,GAAG,GAAG,CAAC;KAClB;IAED,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC3C,OAAO;QACH,IAAI;QACJ,QAAQ,EAAE,QAAQ,GAAG,CAAC;KACzB,CAAC;AACN,CAAC;AAfD,sCAeC"}

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

@@ -0,0 +1,140 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getArrayWithIndexes = exports.changeKeyOrder = exports.shuffleBooleanOrdering = exports.optimizeBruteForce = exports.defaultCompareResults = void 0;
+const create_bdd_from_truth_table_js_1 = require("./create-bdd-from-truth-table.js");
+const util_js_1 = require("./util.js");
+/**
+ * returns the bdd with less nodes
+ */
+const defaultCompareResults = function (a, b) {
+    if (a.countNodes() <= b.countNodes()) {
+        return a;
+    }
+    else {
+        return b;
+    }
+};
+exports.defaultCompareResults = defaultCompareResults;
+/**
+ * optimises the ordering of the boolean functions
+ * by randomly sorting the array
+ * and checking the resulting bdd
+ */
+async function optimizeBruteForce({ truthTable, iterations = Infinity, onBetterBdd = () => null, compareResults = exports.defaultCompareResults, afterBddCreation = () => null, log = false }) {
+    const initialBdd = (0, create_bdd_from_truth_table_js_1.createBddFromTruthTable)(truthTable);
+    afterBddCreation(initialBdd);
+    initialBdd.minimize();
+    let currentBestResult = {
+        truthTable,
+        bdd: initialBdd
+    };
+    if (log) {
+        initialBdd.log();
+        console.log('initial nodes amount: ' + initialBdd.countNodes());
+    }
+    let t = 0;
+    while (t < iterations) {
+        t++;
+        if (log) {
+            console.log('-'.repeat(50));
+            console.log('optimizeBruteForce() itterate once');
+        }
+        const shuffledOrdering = shuffleBooleanOrdering(truthTable);
+        const nextBdd = (0, create_bdd_from_truth_table_js_1.createBddFromTruthTable)(shuffledOrdering.newTable);
+        // change the levels of each node
+        const newNodesByLevel = new Map();
+        const lastLevel = (0, util_js_1.lastOfArray)(nextBdd.getLevels());
+        const newSortedLevels = [];
+        nextBdd.getLevels()
+            .filter(level => level !== lastLevel)
+            .forEach(level => {
+            const newLevel = shuffledOrdering.mappingBeforeToAfter[level];
+            newSortedLevels.push(newLevel);
+            const levelSet = new Set();
+            newNodesByLevel.set(newLevel, levelSet);
+            nextBdd.getNodesOfLevel(level).forEach(node => {
+                node.level = newLevel;
+                levelSet.add(node);
+            });
+        });
+        const lastLevelSet = new Set();
+        nextBdd.getNodesOfLevel(lastLevel).forEach(node => lastLevelSet.add(node));
+        newNodesByLevel.set(lastLevel, lastLevelSet);
+        newSortedLevels.push(lastLevel);
+        nextBdd.nodesByLevel = newNodesByLevel;
+        nextBdd.levels = newSortedLevels;
+        afterBddCreation(nextBdd);
+        nextBdd.minimize();
+        if (log) {
+            console.log('got new bdd with nodes amount of ' + nextBdd.countNodes());
+            //            nextBdd.log();
+            console.dir(shuffledOrdering.mappingBeforeToAfter);
+        }
+        const betterBdd = await compareResults(currentBestResult.bdd, nextBdd);
+        if (betterBdd.type !== 'RootNode') {
+            throw new Error('compareResults did not return a bdd');
+        }
+        if (betterBdd === nextBdd) {
+            if (log) {
+                console.log('#'.repeat(50));
+                console.log('found better bdd ' + nextBdd.countNodes());
+            }
+            currentBestResult = {
+                bdd: nextBdd,
+                truthTable: shuffledOrdering.newTable
+            };
+            onBetterBdd(currentBestResult);
+        }
+    }
+    return currentBestResult;
+}
+exports.optimizeBruteForce = optimizeBruteForce;
+function shuffleBooleanOrdering(truthTable) {
+    const firstKey = (0, util_js_1.firstKeyOfMap)(truthTable);
+    const arrayWithIndexes = getArrayWithIndexes(firstKey.length);
+    const shuffled = (0, util_js_1.shuffleArray)(arrayWithIndexes);
+    const mapping = {};
+    const mappingBeforeToAfter = {};
+    shuffled.forEach((indexBefore, indexAfter) => {
+        mapping[indexAfter] = indexBefore;
+        mappingBeforeToAfter[indexBefore] = indexAfter;
+    });
+    const newTable = new Map();
+    for (const [key, value] of truthTable.entries()) {
+        const newKey = changeKeyOrder(key, mapping);
+        newTable.set(newKey, value);
+    }
+    return {
+        newTable,
+        mapping,
+        mappingBeforeToAfter
+    };
+}
+exports.shuffleBooleanOrdering = shuffleBooleanOrdering;
+function changeKeyOrder(oldKey, mappingBeforeToAfter) {
+    const chars = oldKey
+        .split('')
+        .map((char, indexBefore) => {
+        return {
+            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;
+    while (last < size) {
+        ret.push(last);
+        last++;
+    }
+    return ret;
+}
+exports.getArrayWithIndexes = getArrayWithIndexes;
+//# sourceMappingURL=optimize-brute-force.js.map

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

@@ -0,0 +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;QAClC,OAAO,CAAC,CAAC;KACZ;SAAM;QACH,OAAO,CAAC,CAAC;KACZ;AACL,CAAC,CAAC;AATW,QAAA,qBAAqB,yBAShC;AAYF;;;;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,GAAG,GAAG,KAAK,EACW;IAEtB,MAAM,UAAU,GAAG,IAAA,wDAAuB,EAAC,UAAU,CAAC,CAAC;IACvD,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC7B,UAAU,CAAC,QAAQ,EAAE,CAAC;IACtB,IAAI,iBAAiB,GAAuB;QACxC,UAAU;QACV,GAAG,EAAE,UAAU;KAClB,CAAC;IAEF,IAAI,GAAG,EAAE;QACL,UAAU,CAAC,GAAG,EAAE,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,wBAAwB,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;KACnE;IAED,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,UAAU,EAAE;QACnB,CAAC,EAAE,CAAC;QAEJ,IAAI,GAAG,EAAE;YACL,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;SACrD;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;YACL,OAAO,CAAC,GAAG,CAAC,mCAAmC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YACxE,4BAA4B;YAC5B,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;SACtD;QAED,MAAM,SAAS,GAAG,MAAM,cAAc,CAClC,iBAAiB,CAAC,GAAG,EACrB,OAAO,CACV,CAAC;QACF,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,EAAE;YAC/B,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;SAC1D;QAED,IAAI,SAAS,KAAK,OAAO,EAAE;YAEvB,IAAI,GAAG,EAAE;gBACL,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;aAC3D;YAED,iBAAiB,GAAG;gBAChB,GAAG,EAAE,OAAO;gBACZ,UAAU,EAAE,gBAAgB,CAAC,QAAQ;aACxC,CAAC;YACF,WAAW,CAAC,iBAAiB,CAAC,CAAC;SAClC;KACJ;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;QAC7C,MAAM,MAAM,GAAG,cAAc,CACzB,GAAG,EACH,OAAO,CACV,CAAC;QACF,QAAQ,CAAC,GAAG,CACR,MAAM,EACN,KAAK,CACR,CAAC;KACL;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;QAChB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,EAAE,CAAC;KACV;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AARD,kDAQC"}

package/dist/cjs/src/parents.js

@@ -0,0 +1,43 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Parents = void 0;
+/**
+ * represents the parents of a single node
+ */
+class Parents {
+    node;
+    parents = new Set();
+    constructor(node) {
+        this.node = node;
+    }
+    remove(node) {
+        this.parents.delete(node);
+        if (this.parents.size === 0) {
+            this.node.remove();
+        }
+    }
+    getAll() {
+        return Array.from(this.parents);
+    }
+    add(node) {
+        if (this.node.level === node.level) {
+            throw new Error('a node cannot be parent of a node with the same level');
+        }
+        this.parents.add(node);
+    }
+    has(node) {
+        return this.parents.has(node);
+    }
+    toString() {
+        const ret = [];
+        for (const parent of this.parents) {
+            ret.push(parent.id);
+        }
+        return ret.join(', ');
+    }
+    get size() {
+        return this.parents.size;
+    }
+}
+exports.Parents = Parents;
+//# sourceMappingURL=parents.js.map

package/dist/cjs/src/parents.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parents.js","sourceRoot":"","sources":["../../../src/parents.ts"],"names":[],"mappings":";;;AAKA;;GAEG;AACH,MAAa,OAAO;IAKL;IAHH,OAAO,GAAqB,IAAI,GAAG,EAAE,CAAC;IAE9C,YACW,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;IACxB,CAAC;IAEE,MAAM,CAAC,IAAiB;QAC3B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAE1B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE;YACzB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;SACtB;IACL,CAAC;IAEM,MAAM;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,GAAG,CAAC,IAAiB;QACxB,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE;YAChC,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;SAC5E;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAEM,GAAG,CAAC,IAAiB;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,QAAQ;QACJ,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE;YAC/B,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;SACvB;QACD,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC7B,CAAC;CACJ;AA1CD,0BA0CC"}

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

@@ -0,0 +1,158 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RootNode = void 0;
+const abstract_node_js_1 = require("./abstract-node.js");
+const branches_js_1 = require("./branches.js");
+const util_js_1 = require("./util.js");
+const index_js_1 = require("./minimal-string/index.js");
+class RootNode extends abstract_node_js_1.AbstractNode {
+    branches = new branches_js_1.Branches(this);
+    levels = [];
+    nodesByLevel = new Map();
+    constructor() {
+        super(0, null, 'RootNode');
+        this.levels.push(0);
+        const level0Set = new Set();
+        level0Set.add(this);
+        this.nodesByLevel.set(0, level0Set);
+    }
+    addNode(node) {
+        const level = node.level;
+        if (!this.levels.includes(level)) {
+            this.levels.push(level);
+        }
+        this.ensureLevelSetExists(level);
+        const set = this.nodesByLevel.get(level);
+        set?.add(node);
+    }
+    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);
+    }
+    ensureLevelSetExists(level) {
+        if (!this.nodesByLevel.has(level)) {
+            this.nodesByLevel.set(level, new Set());
+        }
+    }
+    getLevels() {
+        return Array.from(this.levels).sort((a, b) => a - b);
+    }
+    getNodesOfLevel(level) {
+        this.ensureLevelSetExists(level);
+        const set = this.nodesByLevel.get(level);
+        return Array.from(set);
+    }
+    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
+     */
+    minimize(logState = false) {
+        // console.log('minimize(): START ###############');
+        let done = false;
+        while (!done) {
+            if (logState) {
+                console.log('minimize() itterate once');
+            }
+            let successCount = 0;
+            let lastLevel = (0, util_js_1.lastOfArray)(this.getLevels());
+            while (lastLevel > 0) {
+                const nodes = this.getNodesOfLevel(lastLevel);
+                if (logState) {
+                    console.log('minimize() run for level ' + lastLevel +
+                        ' with ' + nodes.length + ' nodes');
+                    // console.dir(nodes);
+                }
+                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.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 (reductionDone || eliminationDone) {
+                            successCount++;
+                        }
+                    }
+                }
+                lastLevel--;
+            }
+            if (successCount === 0) {
+                // could do no more optimisations
+                done = true;
+            }
+            else {
+                if (logState) {
+                    console.log('minimize() itteration done with ' +
+                        successCount + ' minimisations');
+                }
+            }
+        }
+    }
+    getLeafNodes() {
+        const lastLevel = (0, util_js_1.lastOfArray)(this.getLevels());
+        const leafNodes = this.getNodesOfLevel(lastLevel).reverse();
+        return leafNodes;
+    }
+    /**
+     * strips all leaf-nodes
+     * with the given value
+     */
+    removeIrrelevantLeafNodes(leafNodeValue) {
+        let done = false;
+        while (!done) {
+            let countRemoved = 0;
+            const leafNodes = this.getLeafNodes();
+            for (const leafNode of leafNodes) {
+                const removed = leafNode.removeIfValueEquals(leafNodeValue);
+                if (removed) {
+                    countRemoved++;
+                }
+            }
+            this.minimize();
+            if (countRemoved === 0) {
+                done = true;
+            }
+        }
+    }
+    resolve(fns, booleanFunctionInput) {
+        let currentNode = this;
+        while (true) {
+            const booleanResult = fns[currentNode.level](booleanFunctionInput);
+            const branchKey = (0, util_js_1.booleanToBooleanString)(booleanResult);
+            currentNode = currentNode.branches.getBranch(branchKey);
+            if (currentNode.isLeafNode()) {
+                return currentNode.asLeafNode().value;
+            }
+        }
+    }
+    toSimpleBdd() {
+        return (0, index_js_1.bddToSimpleBdd)(this);
+    }
+}
+exports.RootNode = RootNode;
+//# sourceMappingURL=root-node.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"root-node.js","sourceRoot":"","sources":["../../../src/root-node.ts"],"names":[],"mappings":";;;AAAA,yDAAkD;AAClD,+CAAyC;AAOzC,uCAGmB;AAGnB,wDAA2D;AAE3D,MAAa,QAAS,SAAQ,+BAAY;IAC/B,QAAQ,GAAa,IAAI,sBAAQ,CAAC,IAAI,CAAC,CAAC;IAExC,MAAM,GAAa,EAAE,CAAC;IACtB,YAAY,GAAmC,IAAI,GAAG,EAAE,CAAC;IAEhE;QACI,KAAK,CACD,CAAC,EACD,IAAI,EACJ,UAAU,CACb,CAAC;QACF,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,EAAE,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,IAAA,qBAAW,EAAC,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,IAAA,qBAAW,EAAC,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,IAAA,gCAAsB,EAAC,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,IAAA,yBAAc,EAAC,IAAI,CAAC,CAAC;IAChC,CAAC;CACJ;AAlLD,4BAkLC"}

package/dist/cjs/src/types.js

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

package/dist/{src → cjs/src}/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/types.ts"],"names":[],"mappings":""}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/types.ts"],"names":[],"mappings":""}