binary-decision-diagram 2.0.1 → 3.0.0

package/dist/lib/leaf-node.js

@@ -1,33 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LeafNode = void 0;
-const parents_1 = require("./parents");
-const abstract_node_1 = require("./abstract-node");
-const util_1 = require("./util");
-class LeafNode extends abstract_node_1.AbstractNode {
-    constructor(level, rootNode, value, parent) {
-        super(level, rootNode, 'LeafNode');
-        this.value = value;
-        this.parents = new parents_1.Parents(this);
-        this.parents.add(parent);
-    }
-    removeIfValueEquals(value) {
-        this.ensureNotDeleted();
-        if (this.value !== value) {
-            return false;
-        }
-        const parents = this.parents.getAll();
-        parents.forEach(parent => {
-            const branchKey = parent.branches.getKeyOfNode(this);
-            const otherBranch = parent.branches.getBranch((0, util_1.oppositeBoolean)(branchKey));
-            this.parents.remove(parent);
-            parent.branches.setBranch(branchKey, otherBranch);
-            if (parent.isInternalNode()) {
-                parent.applyReductionRule();
-            }
-        });
-        return true;
-    }
-}
-exports.LeafNode = LeafNode;
-//# sourceMappingURL=leaf-node.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"leaf-node.js","sourceRoot":"","sources":["../../src/leaf-node.ts"],"names":[],"mappings":";;;AAAA,uCAAoC;AACpC,mDAA+C;AAG/C,iCAAyC;AAGzC,MAAa,QAAS,SAAQ,4BAAY;IAGtC,YACI,KAAa,EACb,QAAkB,EACX,KAAa,EACpB,MAAmB;QAEnB,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAH5B,UAAK,GAAL,KAAK,CAAQ;QALjB,YAAO,GAAG,IAAI,iBAAO,CAAC,IAAI,CAAC,CAAC;QAS/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,mBAAmB,CAAC,KAAa;QAC7B,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAExB,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,EAAE;YACtB,OAAO,KAAK,CAAC;SAChB;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACtC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACrB,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAA,sBAAe,EAAC,SAAS,CAAC,CAAC,CAAC;YAC1E,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5B,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YAClD,IAAI,MAAM,CAAC,cAAc,EAAE,EAAE;gBACxB,MAAuB,CAAC,kBAAkB,EAAE,CAAC;aACjD;QACL,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IAChB,CAAC;CAGJ;AAnCD,4BAmCC"}

package/dist/lib/minimal-string/bdd-to-minimal-string.d.ts

@@ -1,8 +0,0 @@
-import { RootNode } from '../root-node';
-import { AbstractNode } from '../abstract-node';
-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/lib/minimal-string/bdd-to-minimal-string.js

@@ -1,60 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.nodeToString = exports.bddToMinimalString = void 0;
-const string_format_1 = require("./string-format");
-const string_format_2 = require("./string-format");
-function bddToMinimalString(bdd) {
-    let ret = '';
-    let currentCharCode = string_format_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_1.getNextCharId)(lastCode);
-    switch (node.type) {
-        case 'LeafNode':
-            const valueChar = (0, string_format_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_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_1.getCharOfLevel)(node.level)
-            };
-        default:
-            throw new Error('unknown node type');
-    }
-}
-exports.nodeToString = nodeToString;
-//# sourceMappingURL=bdd-to-minimal-string.js.map

package/dist/lib/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,mDAAgF;AAChF,mDAEyB;AAGzB,SAAgB,kBAAkB,CAAC,GAAa;IAC5C,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,eAAe,GAAG,sCAAsB,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,6BAAa,EAAC,QAAQ,CAAC,CAAC;IACvC,QAAQ,IAAI,CAAC,IAAI,EAAE;QACf,KAAK,UAAU;YACX,MAAM,SAAS,GAAG,IAAA,8BAAc,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,8BAAc,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,8BAAc,EAAC,IAAI,CAAC,KAAK,CAAC;aACvE,CAAC;QACN;YACI,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;KAC5C;AACL,CAAC;AArCD,oCAqCC"}

package/dist/lib/minimal-string/bdd-to-simple-bdd.js

@@ -1,24 +0,0 @@
-"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/lib/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,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/lib/minimal-string/index.d.ts

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

package/dist/lib/minimal-string/index.js

@@ -1,22 +0,0 @@
-"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"), exports);
-__exportStar(require("./minimal-string-to-simple-bdd"), exports);
-__exportStar(require("./resolve-with-simple-bdd"), exports);
-__exportStar(require("./string-format"), exports);
-__exportStar(require("./bdd-to-simple-bdd"), exports);
-//# sourceMappingURL=index.js.map

package/dist/lib/minimal-string/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/minimal-string/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0DAAwC;AACxC,iEAA+C;AAC/C,4DAA0C;AAC1C,kDAAgC;AAChC,sDAAoC"}

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

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

package/dist/lib/minimal-string/minimal-string-to-simple-bdd.js

@@ -1,58 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.minimalStringToSimpleBdd = void 0;
-const util_1 = require("../util");
-const string_format_1 = require("./string-format");
-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_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_1.getNumberOfChar)(chunk.charAt(1));
-        nodesById.set(id, value);
-    }
-    // parse internal nodes
-    const internalNodeChars = str.substring(lastLeafNodeChar, str.length - 3);
-    const internalNodeChunks = (0, util_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_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_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/lib/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,kCAA8C;AAC9C,mDAAkD;AAElD,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,0BAAmB,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,+BAAe,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,0BAAmB,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,+BAAe,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,+BAAe,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/lib/minimal-string/resolve-with-simple-bdd.d.ts

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

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

@@ -1,21 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.resolveWithSimpleBdd = void 0;
-const util_1 = require("../util");
-function resolveWithSimpleBdd(simpleBdd, fns, input) {
-    let currentNode = simpleBdd;
-    let currentLevel = simpleBdd.l;
-    while (true) {
-        const booleanResult = fns[currentLevel](input);
-        const branchKey = (0, util_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/lib/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":";;;AAKA,kCAAiD;AAEjD,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,6BAAsB,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/lib/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/lib/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.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/lib/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;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/lib/optimize-brute-force.js

@@ -1,140 +0,0 @@
-"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_1 = require("./create-bdd-from-truth-table");
-const util_1 = require("./util");
-/**
- * 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_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_1.createBddFromTruthTable)(shuffledOrdering.newTable);
-        // change the levels of each node
-        const newNodesByLevel = new Map();
-        const lastLevel = (0, util_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_1.firstKeyOfMap)(truthTable);
-    const arrayWithIndexes = getArrayWithIndexes(firstKey.length);
-    const shuffled = (0, util_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/lib/optimize-brute-force.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"optimize-brute-force.js","sourceRoot":"","sources":["../../src/optimize-brute-force.ts"],"names":[],"mappings":";;;AAEA,+EAAwE;AACxE,iCAAkE;AAgBlE;;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,qDAAuB,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,qDAAuB,EAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEnE,iCAAiC;QACjC,MAAM,eAAe,GAAmC,IAAI,GAAG,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,IAAA,kBAAW,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,oBAAa,EAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,IAAA,mBAAY,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/lib/parents.d.ts

@@ -1,15 +0,0 @@
-import type { NonLeafNode, NonRootNode } from './types';
-/**
- * represents the parents of a single node
- */
-export declare class Parents {
-    node: NonRootNode;
-    private parents;
-    constructor(node: NonRootNode);
-    remove(node: NonLeafNode): void;
-    getAll(): NonLeafNode[];
-    add(node: NonLeafNode): void;
-    has(node: NonLeafNode): boolean;
-    toString(): string;
-    get size(): number;
-}

package/dist/lib/parents.js

@@ -1,42 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Parents = void 0;
-/**
- * represents the parents of a single node
- */
-class Parents {
-    constructor(node) {
-        this.node = node;
-        this.parents = new Set();
-    }
-    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/lib/parents.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parents.js","sourceRoot":"","sources":["../../src/parents.ts"],"names":[],"mappings":";;;AAKA;;GAEG;AACH,MAAa,OAAO;IAIhB,YACW,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QAHpB,YAAO,GAAqB,IAAI,GAAG,EAAE,CAAC;IAI1C,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"}