binary-decision-diagram 2.0.0 → 3.0.0

package/src/abstract-node.ts

@@ -1,10 +1,10 @@
-import { nextNodeId } from './util';
-import type { NonRootNode, NonLeafNode, NodeType } from './types';
-import { Branches } from './branches';
-import { RootNode } from './root-node';
-import { InternalNode } from './internal-node';
-import { LeafNode } from './leaf-node';
-import { findSimilarNode } from './find-similar-node';
+import { nextNodeId } from './util.js';
+import type { NonRootNode, NonLeafNode, NodeType } from './types.js';
+import { Branches } from './branches.js';
+import { RootNode } from './root-node.js';
+import { InternalNode } from './internal-node.js';
+import { LeafNode } from './leaf-node.js';
+import { findSimilarNode } from './find-similar-node.js';
 
 export class AbstractNode {
     readonly id: string = nextNodeId();

package/src/branches.ts

@@ -1,5 +1,5 @@
-import type { BooleanString, NonRootNode, NonLeafNode } from './types';
-import { AbstractNode } from './abstract-node';
+import type { BooleanString, NonRootNode, NonLeafNode } from './types.js';
+import { AbstractNode } from './abstract-node.js';
 
 /**
  * represents the branches of a single node

package/src/create-bdd-from-truth-table.ts

@@ -1,8 +1,8 @@
-import { RootNode } from './root-node';
-import { lastChar } from './util';
-import { InternalNode } from './internal-node';
-import { LeafNode } from './leaf-node';
-import type { TruthTable, NonLeafNode, BooleanString } from './types';
+import { RootNode } from './root-node.js';
+import { lastChar } from './util.js';
+import { InternalNode } from './internal-node.js';
+import { LeafNode } from './leaf-node.js';
+import type { TruthTable, NonLeafNode, BooleanString } from './types.js';
 
 export function createBddFromTruthTable(
     truthTable: TruthTable

package/src/ensure-correct-bdd.ts

@@ -1,7 +1,7 @@
-import { RootNode } from './root-node';
-import { AbstractNode } from './abstract-node';
-import type { NonRootNode, NonLeafNode } from './types';
-import { InternalNode } from './internal-node';
+import { RootNode } from './root-node.js';
+import { AbstractNode } from './abstract-node.js';
+import type { NonRootNode, NonLeafNode } from './types.js';
+import { InternalNode } from './internal-node.js';
 
 /**
  * run some tests on the bdd

package/src/fill-truth-table.ts

@@ -2,8 +2,8 @@ import {
     minBinaryWithLength,
     maxBinaryWithLength,
     getNextStateSet
-} from './util';
-import type { TruthTable } from './types';
+} from './util.js';
+import type { TruthTable } from './types.js';
 
 /**
  * fills each missing row of a table

package/src/find-similar-node.ts

@@ -1,4 +1,4 @@
-import { AbstractNode } from './abstract-node';
+import { AbstractNode } from './abstract-node.js';
 
 /**
  * find an simliar node in a list of nodes

package/src/index.ts

@@ -1,32 +1,14 @@
-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';
+export * from './minimal-string/index.js';
+export * from './abstract-node.js';
+export * from './branches.js';
+export * from './create-bdd-from-truth-table.js';
+export * from './ensure-correct-bdd.js';
+export * from './fill-truth-table.js';
+export * from './find-similar-node.js';
+export * from './internal-node.js';
+export * from './leaf-node.js';
+export * from './optimize-brute-force.js';
+export * from './parents.js';
+export * from './root-node.js';
+export * from './util.js';
+export type * from './types.js';

package/src/internal-node.ts

@@ -1,8 +1,8 @@
-import { Branches } from './branches';
-import { Parents } from './parents';
-import { RootNode } from './root-node';
-import { AbstractNode } from './abstract-node';
-import type { NonLeafNode, NonRootNode } from './types';
+import { Branches } from './branches.js';
+import { Parents } from './parents.js';
+import { RootNode } from './root-node.js';
+import { AbstractNode } from './abstract-node.js';
+import type { NonLeafNode, NonRootNode } from './types.js';
 
 export class InternalNode extends AbstractNode {
     public branches: Branches = new Branches(this);

package/src/leaf-node.ts

@@ -1,9 +1,9 @@
-import { Parents } from './parents';
-import { AbstractNode } from './abstract-node';
-import { RootNode } from './root-node';
-import type { NonLeafNode } from './types';
-import { oppositeBoolean } from './util';
-import { InternalNode } from './internal-node';
+import { Parents } from './parents.js';
+import { AbstractNode } from './abstract-node.js';
+import { RootNode } from './root-node.js';
+import type { NonLeafNode } from './types.js';
+import { oppositeBoolean } from './util.js';
+import { InternalNode } from './internal-node.js';
 
 export class LeafNode extends AbstractNode {
     public parents = new Parents(this);

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

@@ -1,9 +1,9 @@
-import { RootNode } from '../root-node';
-import { AbstractNode } from '../abstract-node';
-import { getCharOfLevel, getCharOfValue, getNextCharId } from './string-format';
+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';
+} from './string-format.js';
 
 
 export function bddToMinimalString(bdd: RootNode): string {

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

@@ -1,9 +1,9 @@
-import { RootNode } from '../root-node';
+import { RootNode } from '../root-node.js';
 import {
     SimpleBdd
-} from '../types';
-import { AbstractNode } from '../abstract-node';
-import { InternalNode } from '../internal-node';
+} from '../types.js';
+import { AbstractNode } from '../abstract-node.js';
+import { InternalNode } from '../internal-node.js';
 
 /**
  * @recursive

package/src/minimal-string/index.ts

@@ -1,5 +1,5 @@
-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';
+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,9 +1,9 @@
 import {
     SimpleBdd,
     SimpleBddLeafNode
-} from '../types';
-import { splitStringToChunks } from '../util';
-import { getNumberOfChar } from './string-format';
+} from '../types.js';
+import { splitStringToChunks } from '../util.js';
+import { getNumberOfChar } from './string-format.js';
 
 export function minimalStringToSimpleBdd(
     str: string

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

@@ -2,8 +2,8 @@ import {
     SimpleBdd,
     ResolverFunctions,
     SimpleBddLeafNode
-} from '../types';
-import { booleanToBooleanString } from '../util';
+} from '../types.js';
+import { booleanToBooleanString } from '../util.js';
 
 export function resolveWithSimpleBdd(
     simpleBdd: SimpleBdd,

package/src/optimize-brute-force.ts

@@ -1,8 +1,8 @@
-import type { TruthTable } from './types';
-import { RootNode } from './root-node';
-import { createBddFromTruthTable } from './create-bdd-from-truth-table';
-import { firstKeyOfMap, shuffleArray, lastOfArray } from './util';
-import { AbstractNode } from './abstract-node';
+import type { TruthTable } from './types.js';
+import { RootNode } from './root-node.js';
+import { createBddFromTruthTable } from './create-bdd-from-truth-table.js';
+import { firstKeyOfMap, shuffleArray, lastOfArray } from './util.js';
+import { AbstractNode } from './abstract-node.js';
 
 /**
  * a function that is called each time

package/src/parents.ts

@@ -1,7 +1,7 @@
 import type {
     NonLeafNode,
     NonRootNode
-} from './types';
+} from './types.js';
 
 /**
  * represents the parents of a single node

package/src/root-node.ts

@@ -1,18 +1,18 @@
-import { AbstractNode } from './abstract-node';
-import { Branches } from './branches';
+import { AbstractNode } from './abstract-node.js';
+import { Branches } from './branches.js';
 import type {
     NonRootNode,
     ResolverFunctions,
     NonLeafNode,
     SimpleBdd
-} from './types';
+} from './types.js';
 import {
     lastOfArray,
     booleanToBooleanString
-} from './util';
-import { InternalNode } from './internal-node';
-import { LeafNode } from './leaf-node';
-import { bddToSimpleBdd } from './minimal-string';
+} from './util.js';
+import { InternalNode } from './internal-node.js';
+import { LeafNode } from './leaf-node.js';
+import { bddToSimpleBdd } from './minimal-string/index.js';
 
 export class RootNode extends AbstractNode {
     public branches: Branches = new Branches(this);

package/src/types.ts

@@ -1,6 +1,6 @@
-import { LeafNode } from './leaf-node';
-import { InternalNode } from './internal-node';
-import { RootNode } from './root-node';
+import type { LeafNode } from './leaf-node.js';
+import type { InternalNode } from './internal-node.js';
+import type { RootNode } from './root-node.js';
 
 export type NodeType = 'LeafNode' | 'InternalNode' | 'RootNode';
 

package/src/util.ts

@@ -1,4 +1,4 @@
-import type { BooleanString } from './types';
+import type { BooleanString } from './types.ts';
 
 export function booleanStringToBoolean(str: BooleanString): boolean {
     if (str === '1') {

package/.github/workflows/main.yml

@@ -1,22 +0,0 @@
-name: CI
-on:
-  push:
-    branches: [ master ]
-  pull_request:
-    branches: [ master ]
-
-  workflow_dispatch:
-
-jobs:
-  build:
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v3
-      - name: Use Node.js
-        uses: actions/setup-node@v3
-        with:
-          node-version: 16.10.0
-      - run: npm install
-      - run: npm run build
-      - run: npm run test
-      - run: npm run lint

package/dist/es/abstract-node.js

@@ -1,166 +0,0 @@
-import { nextNodeId } from './util';
-import { findSimilarNode } from './find-similar-node';
-export class AbstractNode {
-    constructor(level, rootNode, type) {
-        this.level = level;
-        this.id = 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 = 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;
-        }
-    }
-}
-//# sourceMappingURL=abstract-node.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"abstract-node.js","sourceRoot":"","sources":["../../src/abstract-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAMpC,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAEtD,MAAM,OAAO,YAAY;IAMrB,YACW,KAAa,EACpB,QAAyB,EACzB,IAAc;QAFP,UAAK,GAAL,KAAK,CAAQ;QANf,OAAE,GAAW,UAAU,EAAE,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,eAAe,CACzB,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"}

package/dist/es/branches.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"branches.js","sourceRoot":"","sources":["../../src/branches.ts"],"names":[],"mappings":"AAGA;;GAEG;AACH,MAAM,OAAO,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;AAED,MAAM,UAAU,yBAAyB,CACrC,KAAkB,EAClB,KAAkB;IAElB,IAAI,KAAK,KAAK,KAAK,EAAE;QACjB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;KAC5D;AACL,CAAC"}

package/dist/es/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/es/create-bdd-from-truth-table.js

@@ -1,34 +0,0 @@
-import { RootNode } from './root-node';
-import { lastChar } from './util';
-import { InternalNode } from './internal-node';
-import { LeafNode } from './leaf-node';
-export function createBddFromTruthTable(truthTable) {
-    const root = new 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 InternalNode(level, root, lastNode));
-            }
-            lastNode = lastNode.branches.getBranch(state);
-        }
-        // last node is leaf-node
-        const lastState = lastChar(stateSet);
-        if (lastNode.branches.getBranch(lastState)) {
-            throw new Error('leafNode already exists, this should not happen');
-        }
-        lastNode.branches.setBranch(lastState, new LeafNode(stateSet.length, root, value, lastNode));
-    }
-    return root;
-}
-//# sourceMappingURL=create-bdd-from-truth-table.js.map

package/dist/es/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,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAClC,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,MAAM,UAAU,uBAAuB,CACnC,UAAsB;IAEtB,MAAM,IAAI,GAAG,IAAI,QAAQ,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,YAAY,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,QAAQ,CAAC,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,QAAQ,CACR,QAAQ,CAAC,MAAM,EACf,IAAI,EACJ,KAAK,EACL,QAAQ,CACX,CACJ,CAAC;KACL;IAED,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/es/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,MAAM,UAAU,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;AAED,MAAM,UAAU,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"}

package/dist/es/fill-truth-table.d.ts

@@ -1,6 +0,0 @@
-import type { TruthTable } from './types';
-/**
- * fills each missing row of a table
- * with the given value
- */
-export declare function fillTruthTable(truthTable: TruthTable, inputLength: number, value: number): void;

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

@@ -1,22 +0,0 @@
-import { minBinaryWithLength, maxBinaryWithLength, getNextStateSet } from './util';
-/**
- * fills each missing row of a table
- * with the given value
- */
-export function fillTruthTable(truthTable, inputLength, value) {
-    const endInput = maxBinaryWithLength(inputLength);
-    let currentInput = minBinaryWithLength(inputLength);
-    let done = false;
-    while (!done) {
-        if (!truthTable.has(currentInput)) {
-            truthTable.set(currentInput, value);
-        }
-        if (currentInput === endInput) {
-            done = true;
-        }
-        else {
-            currentInput = getNextStateSet(currentInput);
-        }
-    }
-}
-//# sourceMappingURL=fill-truth-table.js.map

package/dist/es/find-similar-node.d.ts

@@ -1,7 +0,0 @@
-import { AbstractNode } from './abstract-node';
-/**
- * find an simliar node in a list of nodes
- * which is not exactly the same node
- * @hotpath
- */
-export declare function findSimilarNode<T extends AbstractNode>(own: T, others: T[]): T | null;

package/dist/es/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/es/index.js

@@ -1,14 +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';
-//# sourceMappingURL=index.js.map

package/dist/es/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,iBAAiB,CAAC;AAChC,cAAc,YAAY,CAAC;AAC3B,cAAc,+BAA+B,CAAC;AAC9C,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC;AACnC,cAAc,qBAAqB,CAAC;AACpC,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,wBAAwB,CAAC;AACvC,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,QAAQ,CAAC"}