binary-decision-diagram 4.0.0 → 5.0.0

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

@@ -1,2 +0,0 @@
-import { SimpleBdd } from '../types.js';
-export declare function minimalStringToSimpleBdd(str: string): SimpleBdd;

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

@@ -1,57 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.minimalStringToSimpleBdd = minimalStringToSimpleBdd;
-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, // level is first for prettier json output
-            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;
-}
-//# sourceMappingURL=minimal-string-to-simple-bdd.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"minimal-string-to-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/minimal-string-to-simple-bdd.ts"],"names":[],"mappings":";;AAOA,4DA2DC;AA9DD,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,CAAC;QAC7C,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;IAC7B,CAAC;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,CAAC;QACjD,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,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,WAAW,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,WAAW,CAAC,CAAC;QAC3D,CAAC;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,EAAE,0CAA0C;YACpD,CAAC,EAAE,KAAK;YACR,CAAC,EAAE,KAAK;SACX,CAAC;QACF,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;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"}

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

@@ -1,2 +0,0 @@
-import { SimpleBdd, ResolverFunctions } from '../types.js';
-export declare function resolveWithSimpleBdd(simpleBdd: SimpleBdd, fns: ResolverFunctions, input: any): number;

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"resolve-with-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/resolve-with-simple-bdd.ts"],"names":[],"mappings":";;AAMA,oDAgBC;AAhBD,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,CAAC;QACV,MAAM,aAAa,GAAY,GAAG,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC;QACxD,WAAW,GAAG,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;YACrE,OAAO,WAAkB,CAAC;QAC9B,CAAC;aAAM,CAAC;YACJ,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;AACL,CAAC"}

package/dist/cjs/src/minimal-string/string-format.d.ts

@@ -1,9 +0,0 @@
-export declare const CHAR_CODE_OFFSET = 40;
-export declare function getCharOfLevel(level: number): string;
-export declare function getNumberOfChar(char: string): number;
-export declare function getCharOfValue(value: number): string;
-export declare const FIRST_CHAR_CODE_FOR_ID = 97;
-export declare function getNextCharId(lastCode: number): {
-    char: string;
-    nextCode: number;
-};

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

@@ -1,61 +0,0 @@
-"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.FIRST_CHAR_CODE_FOR_ID = exports.CHAR_CODE_OFFSET = void 0;
-exports.getCharOfLevel = getCharOfLevel;
-exports.getNumberOfChar = getNumberOfChar;
-exports.getCharOfValue = getCharOfValue;
-exports.getNextCharId = getNextCharId;
-/*
-
-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);
-}
-function getNumberOfChar(char) {
-    const charCode = char.charCodeAt(0);
-    return charCode - exports.CHAR_CODE_OFFSET;
-}
-function getCharOfValue(value) {
-    const charCode = exports.CHAR_CODE_OFFSET + value;
-    return String.fromCharCode(charCode);
-}
-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
-    };
-}
-//# sourceMappingURL=string-format.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"string-format.js","sourceRoot":"","sources":["../../../../src/minimal-string/string-format.ts"],"names":[],"mappings":";AAAA;;;;;;;EAOE;;;AA0BF,wCAGC;AAED,0CAGC;AAED,wCAGC;AAKD,sCAeC;AAzDD;;;;;;;;;;;;;;;;;;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;AAED,SAAgB,eAAe,CAAC,IAAY;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,QAAQ,GAAG,wBAAgB,CAAC;AACvC,CAAC;AAED,SAAgB,cAAc,CAAC,KAAa;IACxC,MAAM,QAAQ,GAAG,wBAAgB,GAAG,KAAK,CAAC;IAC1C,OAAO,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;AACzC,CAAC;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,CAAC;QACrC,QAAQ,GAAG,GAAG,CAAC;IACnB,CAAC;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"}

package/dist/esm/src/minimal-string/bdd-to-minimal-string.d.ts

@@ -1,8 +0,0 @@
-import { RootNode } from '../root-node.js';
-import { AbstractNode } from '../abstract-node.js';
-export declare function bddToMinimalString(bdd: RootNode): string;
-export declare function nodeToString(node: AbstractNode, idByNode: Map<AbstractNode, string>, lastCode: number): {
-    id: string;
-    str: string;
-    nextCode: number;
-};

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

@@ -1,55 +0,0 @@
-import { getCharOfLevel, getCharOfValue, getNextCharId } from './string-format.js';
-import { FIRST_CHAR_CODE_FOR_ID } from './string-format.js';
-export function bddToMinimalString(bdd) {
-    let ret = '';
-    let currentCharCode = 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;
-}
-export function nodeToString(node, idByNode, lastCode) {
-    const nextId = getNextCharId(lastCode);
-    switch (node.type) {
-        case 'LeafNode':
-            const valueChar = 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 + 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 + getCharOfLevel(node.level)
-            };
-        default:
-            throw new Error('unknown node type');
-    }
-}
-//# sourceMappingURL=bdd-to-minimal-string.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"bdd-to-minimal-string.js","sourceRoot":"","sources":["../../../../src/minimal-string/bdd-to-minimal-string.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnF,OAAO,EACH,sBAAsB,EACzB,MAAM,oBAAoB,CAAC;AAG5B,MAAM,UAAU,kBAAkB,CAAC,GAAa;IAC5C,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,eAAe,GAAG,sBAAsB,CAAC;IAE7C,sBAAsB;IACtB,MAAM,cAAc,GAAG,GAAG,CAAC,YAAY,EAAE,CAAC,MAAM,CAAC;IACjD,IAAI,cAAc,GAAG,EAAE,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IACpE,CAAC;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;AAED,MAAM,UAAU,YAAY,CACxB,IAAkB,EAClB,QAAmC,EACnC,QAAgB;IAMhB,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,UAAU;YACX,MAAM,SAAS,GAAG,cAAc,CAAC,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,cAAc,CAAC,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,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC;aACvE,CAAC;QACN;YACI,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;IAC7C,CAAC;AACL,CAAC"}

package/dist/esm/src/minimal-string/bdd-to-simple-bdd.d.ts

@@ -1,11 +0,0 @@
-import { RootNode } from '../root-node.js';
-import { SimpleBdd } from '../types.js';
-import { AbstractNode } from '../abstract-node.js';
-/**
- * @recursive
- */
-export declare function bddToSimpleBdd(bdd: RootNode): SimpleBdd;
-/**
- * @recursive
- */
-export declare function nodeToSimpleBddNode(node: AbstractNode): SimpleBdd;

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

@@ -1,19 +0,0 @@
-/**
- * @recursive
- */
-export function bddToSimpleBdd(bdd) {
-    return nodeToSimpleBddNode(bdd);
-}
-/**
- * @recursive
- */
-export 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),
-    };
-}
-//# sourceMappingURL=bdd-to-simple-bdd.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"bdd-to-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/bdd-to-simple-bdd.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,GAAa;IACxC,OAAO,mBAAmB,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC;AAGD;;GAEG;AACH,MAAM,UAAU,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"}

package/dist/esm/src/minimal-string/index.d.ts

@@ -1,5 +0,0 @@
-export * from './bdd-to-minimal-string.js';
-export * from './minimal-string-to-simple-bdd.js';
-export * from './resolve-with-simple-bdd.js';
-export * from './string-format.js';
-export * from './bdd-to-simple-bdd.js';

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

@@ -1,6 +0,0 @@
-export * from './bdd-to-minimal-string.js';
-export * from './minimal-string-to-simple-bdd.js';
-export * from './resolve-with-simple-bdd.js';
-export * from './string-format.js';
-export * from './bdd-to-simple-bdd.js';
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/minimal-string/index.ts"],"names":[],"mappings":"AAAA,cAAc,4BAA4B,CAAC;AAC3C,cAAc,mCAAmC,CAAC;AAClD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,oBAAoB,CAAC;AACnC,cAAc,wBAAwB,CAAC"}

package/dist/esm/src/minimal-string/minimal-string-to-simple-bdd.d.ts

@@ -1,2 +0,0 @@
-import { SimpleBdd } from '../types.js';
-export declare function minimalStringToSimpleBdd(str: string): SimpleBdd;

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

@@ -1,54 +0,0 @@
-import { splitStringToChunks } from '../util.js';
-import { getNumberOfChar } from './string-format.js';
-export 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 = splitStringToChunks(leafNodeChars, 2);
-    for (let i = 0; i < leafNodeChunks.length; i++) {
-        const chunk = leafNodeChunks[i];
-        const id = chunk.charAt(0);
-        const value = getNumberOfChar(chunk.charAt(1));
-        nodesById.set(id, value);
-    }
-    // parse internal nodes
-    const internalNodeChars = str.substring(lastLeafNodeChar, str.length - 3);
-    const internalNodeChunks = 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 = 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, // level is first for prettier json output
-            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 = getNumberOfChar(last3.charAt(2));
-    const nodeOf0 = nodesById.get(idOf0);
-    const nodeOf1 = nodesById.get(idOf1);
-    const rootNode = {
-        l: levelOfRoot,
-        0: nodeOf0,
-        1: nodeOf1,
-    };
-    return rootNode;
-}
-//# sourceMappingURL=minimal-string-to-simple-bdd.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"minimal-string-to-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/minimal-string-to-simple-bdd.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAErD,MAAM,UAAU,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,mBAAmB,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAsB,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,uBAAuB;IACvB,MAAM,iBAAiB,GAAG,GAAG,CAAC,SAAS,CAAC,gBAAgB,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1E,MAAM,kBAAkB,GAAG,mBAAmB,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,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,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAG/C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,WAAW,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,WAAW,CAAC,CAAC;QAC3D,CAAC;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,EAAE,0CAA0C;YACpD,CAAC,EAAE,KAAK;YACR,CAAC,EAAE,KAAK;SACX,CAAC;QACF,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;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,eAAe,CAAC,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"}

package/dist/esm/src/minimal-string/resolve-with-simple-bdd.d.ts

@@ -1,2 +0,0 @@
-import { SimpleBdd, ResolverFunctions } from '../types.js';
-export declare function resolveWithSimpleBdd(simpleBdd: SimpleBdd, fns: ResolverFunctions, input: any): number;

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

@@ -1,15 +0,0 @@
-export function resolveWithSimpleBdd(simpleBdd, fns, input) {
-    let currentNode = simpleBdd;
-    let currentLevel = simpleBdd.l;
-    while (true) {
-        const booleanResult = fns[currentLevel](input);
-        currentNode = currentNode[booleanResult ? '1' : '0'];
-        if (typeof currentNode === 'number' || typeof currentNode === 'string') {
-            return currentNode;
-        }
-        else {
-            currentLevel = currentNode.l;
-        }
-    }
-}
-//# sourceMappingURL=resolve-with-simple-bdd.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"resolve-with-simple-bdd.js","sourceRoot":"","sources":["../../../../src/minimal-string/resolve-with-simple-bdd.ts"],"names":[],"mappings":"AAMA,MAAM,UAAU,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,CAAC;QACV,MAAM,aAAa,GAAY,GAAG,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC;QACxD,WAAW,GAAG,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;YACrE,OAAO,WAAkB,CAAC;QAC9B,CAAC;aAAM,CAAC;YACJ,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;AACL,CAAC"}

package/dist/esm/src/minimal-string/string-format.d.ts

@@ -1,9 +0,0 @@
-export declare const CHAR_CODE_OFFSET = 40;
-export declare function getCharOfLevel(level: number): string;
-export declare function getNumberOfChar(char: string): number;
-export declare function getCharOfValue(value: number): string;
-export declare const FIRST_CHAR_CODE_FOR_ID = 97;
-export declare function getNextCharId(lastCode: number): {
-    char: string;
-    nextCode: number;
-};

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

@@ -1,54 +0,0 @@
-/*
-let t = 0;
-while (t < 10000) {
-    const char = String.fromCharCode(t);
-    console.log(t + ' : ' + char);
-    t++;
-}
-*/
-/*
-
-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
-export const CHAR_CODE_OFFSET = 40; // String.fromCharCode(33) === ')'
-export function getCharOfLevel(level) {
-    const charCode = CHAR_CODE_OFFSET + level;
-    return String.fromCharCode(charCode);
-}
-export function getNumberOfChar(char) {
-    const charCode = char.charCodeAt(0);
-    return charCode - CHAR_CODE_OFFSET;
-}
-export function getCharOfValue(value) {
-    const charCode = CHAR_CODE_OFFSET + value;
-    return String.fromCharCode(charCode);
-}
-export const FIRST_CHAR_CODE_FOR_ID = 97; // String.fromCharCode(97) === 'a'
-export 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
-    };
-}
-//# sourceMappingURL=string-format.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"string-format.js","sourceRoot":"","sources":["../../../../src/minimal-string/string-format.ts"],"names":[],"mappings":"AAAA;;;;;;;EAOE;AAEF;;;;;;;;;;;;;;;;;;EAkBE;AAEF,6DAA6D;AAC7D,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC,CAAC,kCAAkC;AAGtE,MAAM,UAAU,cAAc,CAAC,KAAa;IACxC,MAAM,QAAQ,GAAG,gBAAgB,GAAG,KAAK,CAAC;IAC1C,OAAO,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,IAAY;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,QAAQ,GAAG,gBAAgB,CAAC;AACvC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAa;IACxC,MAAM,QAAQ,GAAG,gBAAgB,GAAG,KAAK,CAAC;IAC1C,OAAO,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;AACzC,CAAC;AAGD,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,CAAC,CAAC,kCAAkC;AAE5E,MAAM,UAAU,aAAa,CAAC,QAAgB;IAK1C,6CAA6C;IAC7C,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG,EAAE,CAAC;QACrC,QAAQ,GAAG,GAAG,CAAC;IACnB,CAAC;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"}

package/src/minimal-string/bdd-to-minimal-string.ts

@@ -1,72 +0,0 @@
-import { RootNode } from '../root-node.js';
-import { AbstractNode } from '../abstract-node.js';
-import { getCharOfLevel, getCharOfValue, getNextCharId } from './string-format.js';
-import {
-    FIRST_CHAR_CODE_FOR_ID
-} from './string-format.js';
-
-
-export function bddToMinimalString(bdd: RootNode): string {
-    let ret = '';
-    let currentCharCode = 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: Map<AbstractNode, string> = 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;
-}
-
-export function nodeToString(
-    node: AbstractNode,
-    idByNode: Map<AbstractNode, string>,
-    lastCode: number
-): {
-    id: string,
-    str: string,
-    nextCode: number
-} {
-    const nextId = getNextCharId(lastCode);
-    switch (node.type) {
-        case 'LeafNode':
-            const valueChar = 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 + 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 + getCharOfLevel(node.level)
-            };
-        default:
-            throw new Error('unknown node type');
-    }
-}

package/src/minimal-string/bdd-to-simple-bdd.ts

@@ -1,31 +0,0 @@
-import { RootNode } from '../root-node.js';
-import {
-    SimpleBdd
-} from '../types.js';
-import { AbstractNode } from '../abstract-node.js';
-import { InternalNode } from '../internal-node.js';
-
-/**
- * @recursive
- */
-export function bddToSimpleBdd(bdd: RootNode): SimpleBdd {
-    return nodeToSimpleBddNode(bdd);
-}
-
-
-/**
- * @recursive
- */
-export function nodeToSimpleBddNode(
-    node: AbstractNode
-): SimpleBdd {
-
-    const branch0: AbstractNode = (node as InternalNode).branches.getBranch('0');
-    const branch1: AbstractNode = (node as InternalNode).branches.getBranch('1');
-
-    return {
-        l: node.level,
-        0: branch0.isLeafNode() ? branch0.asLeafNode().value : nodeToSimpleBddNode(branch0),
-        1: branch1.isLeafNode() ? branch1.asLeafNode().value : nodeToSimpleBddNode(branch1),
-    };
-}

package/src/minimal-string/index.ts

@@ -1,5 +0,0 @@
-export * from './bdd-to-minimal-string.js';
-export * from './minimal-string-to-simple-bdd.js';
-export * from './resolve-with-simple-bdd.js';
-export * from './string-format.js';
-export * from './bdd-to-simple-bdd.js';

package/src/minimal-string/minimal-string-to-simple-bdd.ts

@@ -1,67 +0,0 @@
-import {
-    SimpleBdd,
-    SimpleBddLeafNode
-} from '../types.js';
-import { splitStringToChunks } from '../util.js';
-import { getNumberOfChar } from './string-format.js';
-
-export function minimalStringToSimpleBdd(
-    str: string
-): SimpleBdd {
-    const nodesById: Map<string, SimpleBdd | SimpleBddLeafNode> = 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 = splitStringToChunks(leafNodeChars, 2);
-    for (let i = 0; i < leafNodeChunks.length; i++) {
-        const chunk = leafNodeChunks[i];
-        const id = chunk.charAt(0);
-        const value: SimpleBddLeafNode = getNumberOfChar(chunk.charAt(1));
-        nodesById.set(id, value);
-    }
-
-    // parse internal nodes
-    const internalNodeChars = str.substring(lastLeafNodeChar, str.length - 3);
-    const internalNodeChunks = 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 = 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) as SimpleBdd;
-        const node1 = nodesById.get(idOf1Branch) as SimpleBdd;
-        const node: SimpleBdd = {
-            l: level, // level is first for prettier json output
-            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 = getNumberOfChar(last3.charAt(2));
-    const nodeOf0 = nodesById.get(idOf0) as SimpleBdd;
-    const nodeOf1 = nodesById.get(idOf1) as SimpleBdd;
-    const rootNode: SimpleBdd = {
-        l: levelOfRoot,
-        0: nodeOf0,
-        1: nodeOf1,
-    };
-
-    return rootNode;
-}