binary-decision-diagram 2.0.1 → 3.0.1

package/dist/lib/abstract-node.js

@@ -1,170 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AbstractNode = void 0;
-const util_1 = require("./util");
-const find_similar_node_1 = require("./find-similar-node");
-class AbstractNode {
-    constructor(level, rootNode, type) {
-        this.level = level;
-        this.id = (0, util_1.nextNodeId)();
-        this.deleted = false;
-        this.type = type;
-        this.rootNode = rootNode;
-        if (rootNode) {
-            this.rootNode.addNode(this);
-        }
-    }
-    isEqualToOtherNode(otherNode, 
-    // optimisation shortcut, is faster if own string already known
-    ownString = this.toString()) {
-        const ret = ownString === otherNode.toString();
-        return ret;
-    }
-    // deletes the whole node
-    remove() {
-        this.ensureNotDeleted('remove');
-        // console.log('AbstractNode().remove() node: ' + this.id);
-        // console.log(this.toJSON(true));
-        if (this.isInternalNode()) {
-            const useNode = this;
-            if (useNode.parents.size > 0) {
-                throw new Error('cannot remove node with parents ' + this.id);
-            }
-        }
-        if (this.branches) {
-            const useNode = this;
-            if (useNode.branches.areBranchesStrictEqual()) {
-                useNode.branches.getBranch('0').parents.remove(useNode);
-            }
-            else {
-                useNode.branches.getBranch('0').parents.remove(useNode);
-                useNode.branches.getBranch('1').parents.remove(useNode);
-            }
-        }
-        this.deleted = true;
-        this.rootNode.removeNode(this);
-    }
-    toJSON(withId = false) {
-        const ret = {
-            id: withId ? this.id : undefined,
-            deleted: withId ? this.deleted : undefined,
-            type: this.type,
-            level: this.level
-        };
-        if (withId && this.parents) {
-            ret.parents = this.parents.toString();
-        }
-        if (this.isLeafNode()) {
-            ret.value = this.asLeafNode().value;
-        }
-        if (this.branches && !this.branches.deleted) {
-            const branches = this.branches;
-            ret.branches = {
-                '0': branches.getBranch('0').toJSON(withId),
-                '1': branches.getBranch('1').toJSON(withId)
-            };
-        }
-        return ret;
-    }
-    // a strange string-representation
-    // to make an equal check between nodes
-    toString() {
-        let ret = '' +
-            '<' +
-            this.type + ':' + this.level;
-        if (this.branches) {
-            const branches = this.branches;
-            ret += '|0:' + branches.getBranch('0');
-            ret += '|1:' + branches.getBranch('1');
-        }
-        if (this.isLeafNode()) {
-            ret += '|v:' + this.asLeafNode().value;
-        }
-        ret += '>';
-        return ret;
-    }
-    isRootNode() {
-        return this.type === 'RootNode';
-    }
-    isInternalNode() {
-        return this.type === 'InternalNode';
-    }
-    isLeafNode() {
-        return this.type === 'LeafNode';
-    }
-    asRootNode() {
-        if (!this.isRootNode()) {
-            throw new Error('ouch');
-        }
-        return this;
-    }
-    asInternalNode() {
-        if (!this.isInternalNode()) {
-            throw new Error('ouch');
-        }
-        return this;
-    }
-    asLeafNode() {
-        if (!this.isLeafNode()) {
-            throw new Error('ouch');
-        }
-        return this;
-    }
-    ensureNotDeleted(op = 'unknown') {
-        if (this.deleted) {
-            throw new Error('forbidden operation ' + op + ' on deleted node ' + this.id);
-        }
-    }
-    log() {
-        console.log(JSON.stringify(this.toJSON(true), null, 2));
-    }
-    /**
- * by the elimination-rule of bdd,
- * if two branches of the same level are equal,
- * one can be removed
- *
- * See page 21 at:
- * @link https://people.eecs.berkeley.edu/~sseshia/219c/lectures/BinaryDecisionDiagrams.pdf
- */
-    applyEliminationRule(
-    // can be provided for better performance
-    nodesOfSameLevel) {
-        this.ensureNotDeleted('applyEliminationRule');
-        if (!nodesOfSameLevel) {
-            nodesOfSameLevel = this.rootNode.getNodesOfLevel(this.level);
-        }
-        const other = (0, find_similar_node_1.findSimilarNode)(this, nodesOfSameLevel);
-        if (other) {
-            // console.log('applyEliminationRule() remove:' + this.id + '; other: ' + other.id);
-            // keep 'other', remove 'this'
-            // move own parents to other
-            const ownParents = this.parents.getAll();
-            const parentsWithStrictEqualBranches = [];
-            ownParents.forEach((parent) => {
-                // console.log('ownParent: ' + parent.id);
-                const branchKey = parent.branches.getKeyOfNode(this);
-                // console.log('branchKey: ' + branchKey);
-                parent.branches.setBranch(branchKey, other);
-                if (parent.branches.areBranchesStrictEqual()) {
-                    parentsWithStrictEqualBranches.push(parent);
-                }
-                // remove parents from own list
-                // this will auto-remove the connection to the other '1'-branch
-                this.parents.remove(parent);
-            });
-            // parents that now have equal branches, must be removed again
-            parentsWithStrictEqualBranches.forEach(node => {
-                if (node.isInternalNode()) {
-                    // console.log('trigger applyReductionRule from applyEliminationRule');
-                    node.applyReductionRule();
-                }
-            });
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-}
-exports.AbstractNode = AbstractNode;
-//# sourceMappingURL=abstract-node.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"abstract-node.js","sourceRoot":"","sources":["../../src/abstract-node.ts"],"names":[],"mappings":";;;AAAA,iCAAoC;AAMpC,2DAAsD;AAEtD,MAAa,YAAY;IAMrB,YACW,KAAa,EACpB,QAAyB,EACzB,IAAc;QAFP,UAAK,GAAL,KAAK,CAAQ;QANf,OAAE,GAAW,IAAA,iBAAU,GAAE,CAAC;QAC5B,YAAO,GAAY,KAAK,CAAC;QAS5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAEjB,IAAI,CAAC,QAAQ,GAAG,QAAoB,CAAC;QACrC,IAAI,QAAQ,EAAE;YACV,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAW,CAAC,CAAC;SACtC;IACL,CAAC;IAED,kBAAkB,CACd,SAAiC;IACjC,+DAA+D;IAC/D,YAAoB,IAAI,CAAC,QAAQ,EAAE;QAEnC,MAAM,GAAG,GAAG,SAAS,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;QAC/C,OAAO,GAAG,CAAC;IACf,CAAC;IAED,yBAAyB;IAClB,MAAM;QACT,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEhC,2DAA2D;QAC3D,kCAAkC;QAElC,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE;YACvB,MAAM,OAAO,GAAiB,IAAW,CAAC;YAC1C,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE;gBAC1B,MAAM,IAAI,KAAK,CAAC,kCAAkC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;aACjE;SACJ;QAED,IAAK,IAAY,CAAC,QAAQ,EAAE;YACxB,MAAM,OAAO,GAAgB,IAAW,CAAC;YACzC,IAAI,OAAO,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE;gBAC3C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;aAC3D;iBAAM;gBACH,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBACxD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;aAC3D;SACJ;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAW,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,CAAC,SAAkB,KAAK;QAC1B,MAAM,GAAG,GAAQ;YACb,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS;YAChC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;YAC1C,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK;SACpB,CAAC;QAEF,IAAI,MAAM,IAAK,IAAY,CAAC,OAAO,EAAE;YACjC,GAAG,CAAC,OAAO,GAAI,IAAY,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;SAClD;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC;SACvC;QACD,IAAK,IAAY,CAAC,QAAQ,IAAI,CAAE,IAAY,CAAC,QAAQ,CAAC,OAAO,EAAE;YAC3D,MAAM,QAAQ,GAAc,IAAY,CAAC,QAAQ,CAAC;YAClD,GAAG,CAAC,QAAQ,GAAG;gBACX,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;gBAC3C,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;aAC9C,CAAC;SACL;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAGD,kCAAkC;IAClC,uCAAuC;IACvC,QAAQ;QACJ,IAAI,GAAG,GAAG,EAAE;YACR,GAAG;YACH,IAAI,CAAC,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QAEjC,IAAK,IAAY,CAAC,QAAQ,EAAE;YACxB,MAAM,QAAQ,GAAc,IAAY,CAAC,QAAQ,CAAC;YAClD,GAAG,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACvC,GAAG,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;SAC1C;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,GAAG,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC;SAC1C;QACD,GAAG,IAAI,GAAG,CAAC;QACX,OAAO,GAAG,CAAC;IACf,CAAC;IAGD,UAAU;QACN,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;IACpC,CAAC;IACD,cAAc;QACV,OAAO,IAAI,CAAC,IAAI,KAAK,cAAc,CAAC;IACxC,CAAC;IACD,UAAU;QACN,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;IACpC,CAAC;IAED,UAAU;QACN,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;YACpB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;SAC3B;QACD,OAAO,IAAW,CAAC;IACvB,CAAC;IACD,cAAc;QACV,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE;YACxB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;SAC3B;QACD,OAAO,IAAW,CAAC;IACvB,CAAC;IACD,UAAU;QACN,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;YACpB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;SAC3B;QACD,OAAO,IAAW,CAAC;IACvB,CAAC;IAED,gBAAgB,CAAC,KAAa,SAAS;QACnC,IAAI,IAAI,CAAC,OAAO,EAAE;YACd,MAAM,IAAI,KAAK,CAAC,sBAAsB,GAAG,EAAE,GAAG,mBAAmB,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;SAChF;IACL,CAAC;IAEM,GAAG;QACN,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;;;GAOD;IACC,oBAAoB;IAChB,yCAAyC;IACzC,gBAAsB;QAEtB,IAAI,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC;QAC9C,IAAI,CAAC,gBAAgB,EAAE;YACnB,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAU,CAAC;SACzE;QAED,MAAM,KAAK,GAAG,IAAA,mCAAe,EACzB,IAAI,EACJ,gBAAyB,CAC5B,CAAC;QACF,IAAI,KAAK,EAAE;YACP,oFAAoF;YAEpF,8BAA8B;YAE9B,4BAA4B;YAC5B,MAAM,UAAU,GAAI,IAAY,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,8BAA8B,GAAkB,EAAE,CAAC;YACzD,UAAU,CAAC,OAAO,CAAC,CAAC,MAAoB,EAAE,EAAE;gBACxC,0CAA0C;gBAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAW,CAAC,CAAC;gBAC5D,0CAA0C;gBAC1C,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAE5C,IAAI,MAAM,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE;oBAC1C,8BAA8B,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;iBAC/C;gBACD,+BAA+B;gBAC/B,+DAA+D;gBAC9D,IAAY,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;YAEH,8DAA8D;YAC9D,8BAA8B,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC1C,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE;oBACvB,uEAAuE;oBACtE,IAAqB,CAAC,kBAAkB,EAAE,CAAC;iBAC/C;YACL,CAAC,CAAC,CAAC;YAEH,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,KAAK,CAAC;SAChB;IACL,CAAC;CACJ;AArMD,oCAqMC"}

package/dist/lib/branches.d.ts

@@ -1,20 +0,0 @@
-import type { BooleanString, NonRootNode, NonLeafNode } from './types';
-import { AbstractNode } from './abstract-node';
-/**
- * represents the branches of a single node
- */
-export declare class Branches {
-    private node;
-    deleted: boolean;
-    private branches;
-    constructor(node: NonLeafNode);
-    setBranch(which: BooleanString, branchNode: NonRootNode): void;
-    getKeyOfNode(node: NonRootNode): BooleanString;
-    getBranch(which: BooleanString): NonRootNode;
-    getBothBranches(): NonRootNode[];
-    hasBranchAsNode(node: AbstractNode): boolean;
-    hasNodeIdAsBranch(id: string): boolean;
-    areBranchesStrictEqual(): boolean;
-    hasEqualBranches(): boolean;
-}
-export declare function ensureNodesNotStrictEqual(node1: NonRootNode, node2: NonRootNode): void;

package/dist/lib/branches.js

@@ -1,75 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ensureNodesNotStrictEqual = exports.Branches = void 0;
-/**
- * represents the branches of a single node
- */
-class Branches {
-    constructor(node) {
-        this.node = node;
-        this.deleted = false;
-        this.branches = {};
-    }
-    setBranch(which, branchNode) {
-        const previous = this.branches[which];
-        if (previous === branchNode) {
-            return;
-        }
-        // set new branch
-        this.branches[which] = branchNode;
-        branchNode.parents.add(this.node);
-    }
-    getKeyOfNode(node) {
-        if (this.getBranch('0') === node) {
-            return '0';
-        }
-        else if (this.getBranch('1') === node) {
-            return '1';
-        }
-        else {
-            throw new Error('none matched');
-        }
-    }
-    getBranch(which) {
-        return this.branches[which];
-    }
-    getBothBranches() {
-        return [
-            this.getBranch('0'),
-            this.getBranch('1')
-        ];
-    }
-    hasBranchAsNode(node) {
-        if (this.getBranch('0') === node ||
-            this.getBranch('1') === node) {
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-    hasNodeIdAsBranch(id) {
-        if (this.getBranch('0').id === id ||
-            this.getBranch('1').id === id) {
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-    areBranchesStrictEqual() {
-        return this.branches['0'] === this.branches['1'];
-    }
-    hasEqualBranches() {
-        return JSON.stringify(this.branches['0']) ===
-            JSON.stringify(this.branches['1']);
-    }
-}
-exports.Branches = Branches;
-function ensureNodesNotStrictEqual(node1, node2) {
-    if (node1 === node2) {
-        throw new Error('cannot have two strict equal branches');
-    }
-}
-exports.ensureNodesNotStrictEqual = ensureNodesNotStrictEqual;
-//# sourceMappingURL=branches.js.map

package/dist/lib/branches.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"branches.js","sourceRoot":"","sources":["../../src/branches.ts"],"names":[],"mappings":";;;AAGA;;GAEG;AACH,MAAa,QAAQ;IAMjB,YACY,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QANtB,YAAO,GAAY,KAAK,CAAC;QACxB,aAAQ,GAEZ,EAAS,CAAC;IAIV,CAAC;IAEE,SAAS,CAAC,KAAoB,EAAE,UAAuB;QAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,QAAQ,KAAK,UAAU,EAAE;YACzB,OAAO;SACV;QAED,iBAAiB;QACjB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC;QAClC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAEM,YAAY,CAAC,IAAiB;QACjC,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;YAC9B,OAAO,GAAG,CAAC;SACd;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;YACrC,OAAO,GAAG,CAAC;SACd;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACnC;IACL,CAAC;IAEM,SAAS,CAAC,KAAoB;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAEM,eAAe;QAClB,OAAO;YACH,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;YACnB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;SACtB,CAAC;IACN,CAAC;IAEM,eAAe,CAAC,IAAkB;QACrC,IACI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI;YAC5B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,EAC9B;YACE,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,KAAK,CAAC;SAChB;IACL,CAAC;IAEM,iBAAiB,CAAC,EAAU;QAC/B,IACI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE;YAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,EAC/B;YACE,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,KAAK,CAAC;SAChB;IACL,CAAC;IAEM,sBAAsB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAEM,gBAAgB;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACrC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;CACJ;AAxED,4BAwEC;AAED,SAAgB,yBAAyB,CACrC,KAAkB,EAClB,KAAkB;IAElB,IAAI,KAAK,KAAK,KAAK,EAAE;QACjB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;KAC5D;AACL,CAAC;AAPD,8DAOC"}

package/dist/lib/create-bdd-from-truth-table.d.ts

@@ -1,3 +0,0 @@
-import { RootNode } from './root-node';
-import type { TruthTable } from './types';
-export declare function createBddFromTruthTable(truthTable: TruthTable): RootNode;

package/dist/lib/create-bdd-from-truth-table.js

@@ -1,38 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createBddFromTruthTable = void 0;
-const root_node_1 = require("./root-node");
-const util_1 = require("./util");
-const internal_node_1 = require("./internal-node");
-const leaf_node_1 = require("./leaf-node");
-function createBddFromTruthTable(truthTable) {
-    const root = new root_node_1.RootNode();
-    const firstKey = truthTable.keys().next().value;
-    const keyLength = firstKey.length;
-    const mustBeSize = Math.pow(2, keyLength);
-    if (truthTable.size !== mustBeSize) {
-        throw new Error('truth table has missing entries');
-    }
-    for (const [stateSet, value] of truthTable) {
-        let lastNode = root;
-        // itterate over each char of the state
-        for (let i = 0; i < (stateSet.length - 1); i++) {
-            const level = i + 1;
-            const state = stateSet.charAt(i);
-            // if node for this state-char not exists, add new one
-            if (!lastNode.branches.getBranch(state)) {
-                lastNode.branches.setBranch(state, new internal_node_1.InternalNode(level, root, lastNode));
-            }
-            lastNode = lastNode.branches.getBranch(state);
-        }
-        // last node is leaf-node
-        const lastState = (0, util_1.lastChar)(stateSet);
-        if (lastNode.branches.getBranch(lastState)) {
-            throw new Error('leafNode already exists, this should not happen');
-        }
-        lastNode.branches.setBranch(lastState, new leaf_node_1.LeafNode(stateSet.length, root, value, lastNode));
-    }
-    return root;
-}
-exports.createBddFromTruthTable = createBddFromTruthTable;
-//# sourceMappingURL=create-bdd-from-truth-table.js.map

package/dist/lib/create-bdd-from-truth-table.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"create-bdd-from-truth-table.js","sourceRoot":"","sources":["../../src/create-bdd-from-truth-table.ts"],"names":[],"mappings":";;;AAAA,2CAAuC;AACvC,iCAAkC;AAClC,mDAA+C;AAC/C,2CAAuC;AAGvC,SAAgB,uBAAuB,CACnC,UAAsB;IAEtB,MAAM,IAAI,GAAG,IAAI,oBAAQ,EAAE,CAAC;IAE5B,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;IAChD,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC;IAClC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC1C,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE;QAChC,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;KACtD;IAGD,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE;QACxC,IAAI,QAAQ,GAAgB,IAAI,CAAC;QAEjC,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,KAAK,GAAkB,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAkB,CAAC;YAEjE,sDAAsD;YACtD,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;gBACrC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CACvB,KAAK,EACL,IAAI,4BAAY,CACZ,KAAK,EACL,IAAI,EACJ,QAAQ,CACX,CACJ,CAAC;aACL;YACD,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAgB,CAAC;SAChE;QAED,yBAAyB;QACzB,MAAM,SAAS,GAAG,IAAA,eAAQ,EAAC,QAAQ,CAAkB,CAAC;QACtD,IAAI,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;YACxC,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;SACtE;QACD,QAAQ,CAAC,QAAQ,CAAC,SAAS,CACvB,SAAS,EACT,IAAI,oBAAQ,CACR,QAAQ,CAAC,MAAM,EACf,IAAI,EACJ,KAAK,EACL,QAAQ,CACX,CACJ,CAAC;KACL;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AApDD,0DAoDC"}

package/dist/lib/ensure-correct-bdd.d.ts

@@ -1,8 +0,0 @@
-import { RootNode } from './root-node';
-import { AbstractNode } from './abstract-node';
-/**
- * run some tests on the bdd
- * to ensure everything is correct
- */
-export declare function ensureCorrectBdd(bdd: RootNode): void;
-export declare function getNodesRecursive(node: AbstractNode, set?: Set<AbstractNode>): Set<AbstractNode>;

package/dist/lib/ensure-correct-bdd.js

@@ -1,102 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getNodesRecursive = exports.ensureCorrectBdd = void 0;
-/**
- * run some tests on the bdd
- * to ensure everything is correct
- */
-function ensureCorrectBdd(bdd) {
-    const jsonString = JSON.stringify(bdd.toJSON(true));
-    let allNodes = [];
-    const nodesById = new Map();
-    bdd.getLevels().forEach(level => {
-        const levelNodes = bdd.getNodesOfLevel(level);
-        levelNodes.forEach(node => {
-            nodesById.set(node.id, node);
-        });
-        allNodes = allNodes.concat(levelNodes);
-    });
-    const recursiveNodes = getNodesRecursive(bdd);
-    if (allNodes.length !== recursiveNodes.size) {
-        const allNodesIds = allNodes.map(n => n.id).sort();
-        const recursiveNodesIds = Array.from(recursiveNodes).map(n => n.id).sort();
-        const nodesOnlyInRecursive = recursiveNodesIds.filter(id => !allNodesIds.includes(id));
-        //        console.log(JSON.stringify(allNodes.map(n => n.id).sort(), null, 2));
-        //      console.log(JSON.stringify(Array.from(recursiveNodes).map(n => n.id).sort(), null, 2));
-        if (recursiveNodes.size > allNodes.length) {
-            const firstId = nodesOnlyInRecursive[0];
-            const referenceToFirst = allNodes.find(n => {
-                if (n.isInternalNode()) {
-                    return n.branches.hasNodeIdAsBranch(firstId);
-                }
-                return false;
-            });
-            console.log('referenceToFirst:');
-            referenceToFirst === null || referenceToFirst === void 0 ? void 0 : referenceToFirst.log();
-        }
-        throw new Error('ensureCorrectBdd() ' +
-            'nodes in list not equal size to recursive nodes ' +
-            'allNodes: ' + allNodes.length + ' ' +
-            'recursiveNodes: ' + recursiveNodes.size + ' ' +
-            'nodesOnlyInRecursive: ' + nodesOnlyInRecursive.join(', ') + ' ');
-    }
-    allNodes.forEach(node => {
-        if (node.isRootNode()) {
-            return;
-        }
-        const useNode = node;
-        if (node.deleted) {
-            throw new Error('ensureCorrectBdd() ' +
-                'bdd includes a deleted node');
-        }
-        // each node should have a parent
-        if (useNode.parents.size === 0) {
-            throw new Error('ensureCorrectBdd() ' +
-                'node has no parent ' + useNode.id);
-        }
-        if (useNode.isInternalNode()) {
-            const internalNode = useNode;
-            const bothBranches = internalNode.branches.getBothBranches();
-            // a node should not have 2 equal branches
-            if (internalNode.branches.areBranchesStrictEqual()) {
-                throw new Error('ensureCorrectBdd() ' +
-                    'node has two equal branches: ' +
-                    bothBranches.map(n => n.id).join(', '));
-            }
-            // each branch should have the node as parent
-            bothBranches.forEach(branch => {
-                if (!branch.parents.has(internalNode)) {
-                    throw new Error('ensureCorrectBdd() ' +
-                        'branch must have the node as parent');
-                }
-            });
-        }
-        // each parent should have the child as branch
-        useNode.parents.getAll().forEach(parent => {
-            if (!parent.branches.hasBranchAsNode(useNode)) {
-                throw new Error('ensureCorrectBdd() ' +
-                    'parent node does not have child as branch');
-            }
-        });
-    });
-    if (jsonString.includes('"deleted":true')) {
-        throw new Error('ensureCorrectBdd() ' +
-            'bdd includes a deleted node');
-    }
-}
-exports.ensureCorrectBdd = ensureCorrectBdd;
-function getNodesRecursive(node, set = new Set()) {
-    set.add(node);
-    if (!node.isLeafNode()) {
-        const useNode = node;
-        const branch1 = useNode.branches.getBranch('0');
-        set.add(branch1);
-        getNodesRecursive(branch1, set);
-        const branch2 = useNode.branches.getBranch('1');
-        set.add(branch2);
-        getNodesRecursive(branch2, set);
-    }
-    return set;
-}
-exports.getNodesRecursive = getNodesRecursive;
-//# sourceMappingURL=ensure-correct-bdd.js.map

package/dist/lib/ensure-correct-bdd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ensure-correct-bdd.js","sourceRoot":"","sources":["../../src/ensure-correct-bdd.ts"],"names":[],"mappings":";;;AAKA;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,GAAa;IAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAGpD,IAAI,QAAQ,GAAmB,EAAE,CAAC;IAClC,MAAM,SAAS,GAA8B,IAAI,GAAG,EAAE,CAAC;IACvD,GAAG,CAAC,SAAS,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QAC5B,MAAM,UAAU,GAAG,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC9C,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACtB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QACH,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAGH,MAAM,cAAc,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;IAE9C,IAAI,QAAQ,CAAC,MAAM,KAAK,cAAc,CAAC,IAAI,EAAE;QAEzC,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACnD,MAAM,iBAAiB,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3E,MAAM,oBAAoB,GAAa,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAEjG,+EAA+E;QAC/E,+FAA+F;QAE/F,IAAI,cAAc,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE;YACvC,MAAM,OAAO,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,gBAAgB,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;gBACvC,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE;oBACpB,OAAQ,CAAkB,CAAC,QAAQ,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;iBAClE;gBACD,OAAO,KAAK,CAAC;YACjB,CAAC,CAAC,CAAC;YACH,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;YACjC,gBAAgB,aAAhB,gBAAgB,uBAAhB,gBAAgB,CAAE,GAAG,EAAE,CAAC;SAC3B;QAED,MAAM,IAAI,KAAK,CACX,qBAAqB;YACrB,kDAAkD;YAClD,YAAY,GAAG,QAAQ,CAAC,MAAM,GAAG,GAAG;YACpC,kBAAkB,GAAG,cAAc,CAAC,IAAI,GAAG,GAAG;YAC9C,wBAAwB,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CACnE,CAAC;KACL;IAED,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACpB,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,OAAO;SACV;QACD,MAAM,OAAO,GAAG,IAAmB,CAAC;QAEpC,IAAI,IAAI,CAAC,OAAO,EAAE;YACd,MAAM,IAAI,KAAK,CACX,qBAAqB;gBACrB,6BAA6B,CAChC,CAAC;SACL;QAED,iCAAiC;QACjC,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE;YAC5B,MAAM,IAAI,KAAK,CACX,qBAAqB;gBACrB,qBAAqB,GAAG,OAAO,CAAC,EAAE,CACrC,CAAC;SACL;QAED,IAAI,OAAO,CAAC,cAAc,EAAE,EAAE;YAC1B,MAAM,YAAY,GAAiB,OAAc,CAAC;YAClD,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC;YAE7D,0CAA0C;YAC1C,IAAI,YAAY,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE;gBAChD,MAAM,IAAI,KAAK,CACX,qBAAqB;oBACrB,+BAA+B;oBAC/B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACzC,CAAC;aACL;YAED,6CAA6C;YAC7C,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBAC1B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;oBACnC,MAAM,IAAI,KAAK,CACX,qBAAqB;wBACrB,qCAAqC,CACxC,CAAC;iBACL;YACL,CAAC,CAAC,CAAC;SACN;QAED,8CAA8C;QAC9C,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE;gBAC3C,MAAM,IAAI,KAAK,CACX,qBAAqB;oBACrB,2CAA2C,CAC9C,CAAC;aACL;QACL,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAGH,IAAI,UAAU,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE;QACvC,MAAM,IAAI,KAAK,CACX,qBAAqB;YACrB,6BAA6B,CAChC,CAAC;KACL;AACL,CAAC;AA9GD,4CA8GC;AAED,SAAgB,iBAAiB,CAC7B,IAAkB,EAClB,MAAyB,IAAI,GAAG,EAAE;IAElC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACd,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;QACpB,MAAM,OAAO,GAAG,IAAmB,CAAC;QAEpC,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAChD,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjB,iBAAiB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAEhC,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAChD,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjB,iBAAiB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;KACnC;IAED,OAAO,GAAG,CAAC;AACf,CAAC;AAlBD,8CAkBC"}

package/dist/lib/fill-truth-table.js

@@ -1,26 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.fillTruthTable = void 0;
-const util_1 = require("./util");
-/**
- * fills each missing row of a table
- * with the given value
- */
-function fillTruthTable(truthTable, inputLength, value) {
-    const endInput = (0, util_1.maxBinaryWithLength)(inputLength);
-    let currentInput = (0, util_1.minBinaryWithLength)(inputLength);
-    let done = false;
-    while (!done) {
-        if (!truthTable.has(currentInput)) {
-            truthTable.set(currentInput, value);
-        }
-        if (currentInput === endInput) {
-            done = true;
-        }
-        else {
-            currentInput = (0, util_1.getNextStateSet)(currentInput);
-        }
-    }
-}
-exports.fillTruthTable = fillTruthTable;
-//# sourceMappingURL=fill-truth-table.js.map

package/dist/lib/fill-truth-table.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fill-truth-table.js","sourceRoot":"","sources":["../../src/fill-truth-table.ts"],"names":[],"mappings":";;;AAAA,iCAIgB;AAGhB;;;GAGG;AACH,SAAgB,cAAc,CAC1B,UAAsB,EACtB,WAAmB,EACnB,KAAa;IAEb,MAAM,QAAQ,GAAG,IAAA,0BAAmB,EAAC,WAAW,CAAC,CAAC;IAClD,IAAI,YAAY,GAAG,IAAA,0BAAmB,EAAC,WAAW,CAAC,CAAC;IACpD,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,OAAO,CAAC,IAAI,EAAE;QACV,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;YAC/B,UAAU,CAAC,GAAG,CACV,YAAY,EACZ,KAAK,CACR,CAAC;SACL;QACD,IAAI,YAAY,KAAK,QAAQ,EAAE;YAC3B,IAAI,GAAG,IAAI,CAAC;SACf;aAAM;YACH,YAAY,GAAG,IAAA,sBAAe,EAC1B,YAAY,CACf,CAAC;SACL;KACJ;AACL,CAAC;AAvBD,wCAuBC"}

package/dist/lib/find-similar-node.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.findSimilarNode = void 0;
-/**
- * find an simliar node in a list of nodes
- * which is not exactly the same node
- * @hotpath
- */
-function findSimilarNode(own, others) {
-    const ownString = own.toString();
-    for (let i = 0; i < others.length; i++) {
-        const other = others[i];
-        if (own !== other &&
-            !other.deleted &&
-            own.isEqualToOtherNode(other, ownString)) {
-            return other;
-        }
-    }
-    return null;
-}
-exports.findSimilarNode = findSimilarNode;
-//# sourceMappingURL=find-similar-node.js.map

package/dist/lib/find-similar-node.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-similar-node.js","sourceRoot":"","sources":["../../src/find-similar-node.ts"],"names":[],"mappings":";;;AAEA;;;;GAIG;AACH,SAAgB,eAAe,CAC3B,GAAM,EACN,MAAW;IAEX,MAAM,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IACI,GAAG,KAAK,KAAK;YACb,CAAC,KAAK,CAAC,OAAO;YACd,GAAG,CAAC,kBAAkB,CAClB,KAAY,EACZ,SAAS,CACZ,EACH;YACE,OAAO,KAAK,CAAC;SAChB;KACJ;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAnBD,0CAmBC"}

package/dist/lib/index.d.ts

@@ -1,20 +0,0 @@
-export * from './minimal-string/index';
-export * from './abstract-node';
-export * from './branches';
-export * from './create-bdd-from-truth-table';
-export * from './ensure-correct-bdd';
-export * from './fill-truth-table';
-export * from './find-similar-node';
-export * from './internal-node';
-export * from './leaf-node';
-export * from './optimize-brute-force';
-export * from './parents';
-export * from './root-node';
-export * from './util';
-/**
- * There is no "export type * from 'xxx'"
- * So we have to export each type by its own
- * to ensure the types js file is not included
- * into the bundle.
- */
-export type { NodeType, NonLeafNode, NonRootNode, TruthTable, BooleanString, ResolverFunction, ResolverFunctions, SimpleBddLeafNode, SimpleBdd } from './types';

package/dist/lib/index.js

@@ -1,30 +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("./minimal-string/index"), exports);
-__exportStar(require("./abstract-node"), exports);
-__exportStar(require("./branches"), exports);
-__exportStar(require("./create-bdd-from-truth-table"), exports);
-__exportStar(require("./ensure-correct-bdd"), exports);
-__exportStar(require("./fill-truth-table"), exports);
-__exportStar(require("./find-similar-node"), exports);
-__exportStar(require("./internal-node"), exports);
-__exportStar(require("./leaf-node"), exports);
-__exportStar(require("./optimize-brute-force"), exports);
-__exportStar(require("./parents"), exports);
-__exportStar(require("./root-node"), exports);
-__exportStar(require("./util"), exports);
-//# sourceMappingURL=index.js.map

package/dist/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,yDAAuC;AACvC,kDAAgC;AAChC,6CAA2B;AAC3B,gEAA8C;AAC9C,uDAAqC;AACrC,qDAAmC;AACnC,sDAAoC;AACpC,kDAAgC;AAChC,8CAA4B;AAC5B,yDAAuC;AACvC,4CAA0B;AAC1B,8CAA4B;AAC5B,yCAAuB"}

package/dist/lib/internal-node.d.ts

@@ -1,16 +0,0 @@
-import { Branches } from './branches';
-import { Parents } from './parents';
-import { RootNode } from './root-node';
-import { AbstractNode } from './abstract-node';
-import type { NonLeafNode } from './types';
-export declare class InternalNode extends AbstractNode {
-    branches: Branches;
-    parents: Parents;
-    constructor(level: number, rootNode: RootNode, parent: NonLeafNode);
-    /**
-     * by the reduction-rule of bdd,
-     * if both branches are equal,
-     * we can remove this node from the bdd
-     */
-    applyReductionRule(): boolean;
-}

package/dist/lib/internal-node.js

@@ -1,46 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.InternalNode = void 0;
-const branches_1 = require("./branches");
-const parents_1 = require("./parents");
-const abstract_node_1 = require("./abstract-node");
-class InternalNode extends abstract_node_1.AbstractNode {
-    constructor(level, rootNode, parent) {
-        super(level, rootNode, 'InternalNode');
-        this.branches = new branches_1.Branches(this);
-        this.parents = new parents_1.Parents(this);
-        this.parents.add(parent);
-    }
-    /**
-     * by the reduction-rule of bdd,
-     * if both branches are equal,
-     * we can remove this node from the bdd
-     */
-    applyReductionRule() {
-        // console.log('applyReductionRule() ' + this.id);
-        if (this.branches.hasEqualBranches()) {
-            this.ensureNotDeleted('applyReductionRule');
-            const keepBranch = this.branches.getBranch('0');
-            // move own parents to keepBranch
-            const ownParents = this.parents.getAll();
-            ownParents.forEach(parent => {
-                // console.log('ownParent: ' + parent.id);
-                const branchKey = parent.branches.getKeyOfNode(this);
-                parent.branches.setBranch(branchKey, keepBranch);
-                // remove parents from own list
-                // this will auto-remove the connection to the other '1'-branch
-                this.parents.remove(parent);
-                // if parent has now two equal branches,
-                // we have to apply the reduction again
-                // to ensure we end in a valid state
-                if (parent.branches.areBranchesStrictEqual() && parent.isInternalNode()) {
-                    parent.applyReductionRule();
-                }
-            });
-            return true;
-        }
-        return false;
-    }
-}
-exports.InternalNode = InternalNode;
-//# sourceMappingURL=internal-node.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"internal-node.js","sourceRoot":"","sources":["../../src/internal-node.ts"],"names":[],"mappings":";;;AAAA,yCAAsC;AACtC,uCAAoC;AAEpC,mDAA+C;AAG/C,MAAa,YAAa,SAAQ,4BAAY;IAI1C,YACI,KAAa,EACb,QAAkB,EAClB,MAAmB;QAEnB,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QARpC,aAAQ,GAAa,IAAI,mBAAQ,CAAC,IAAI,CAAC,CAAC;QACxC,YAAO,GAAG,IAAI,iBAAO,CAAC,IAAI,CAAC,CAAC;QAQ/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAID;;;;OAIG;IACH,kBAAkB;QAEd,kDAAkD;QAElD,IAAI,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,EAAE;YAClC,IAAI,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAgB,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAE7D,iCAAiC;YACjC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACzC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBACxB,0CAA0C;gBAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;gBACrD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAEjD,+BAA+B;gBAC/B,+DAA+D;gBAC/D,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAE5B,wCAAwC;gBACxC,uCAAuC;gBACvC,oCAAoC;gBACpC,IAAI,MAAM,CAAC,QAAQ,CAAC,sBAAsB,EAAE,IAAI,MAAM,CAAC,cAAc,EAAE,EAAE;oBACpE,MAAuB,CAAC,kBAAkB,EAAE,CAAC;iBACjD;YACL,CAAC,CAAC,CAAC;YAEH,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;CAEJ;AApDD,oCAoDC"}

package/dist/lib/leaf-node.d.ts

@@ -1,10 +0,0 @@
-import { Parents } from './parents';
-import { AbstractNode } from './abstract-node';
-import { RootNode } from './root-node';
-import type { NonLeafNode } from './types';
-export declare class LeafNode extends AbstractNode {
-    value: number;
-    parents: Parents;
-    constructor(level: number, rootNode: RootNode, value: number, parent: NonLeafNode);
-    removeIfValueEquals(value: number): boolean;
-}