binary-decision-diagram 2.0.0 → 3.0.0

package/dist/es/internal-node.js

@@ -1,42 +0,0 @@
-import { Branches } from './branches';
-import { Parents } from './parents';
-import { AbstractNode } from './abstract-node';
-export class InternalNode extends AbstractNode {
-    constructor(level, rootNode, parent) {
-        super(level, rootNode, 'InternalNode');
-        this.branches = new Branches(this);
-        this.parents = new 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;
-    }
-}
-//# sourceMappingURL=internal-node.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"leaf-node.js","sourceRoot":"","sources":["../../src/leaf-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG/C,OAAO,EAAE,eAAe,EAAE,MAAM,QAAQ,CAAC;AAGzC,MAAM,OAAO,QAAS,SAAQ,YAAY;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,OAAO,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,eAAe,CAAC,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"}

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

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

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

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

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

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

package/dist/es/optimize-brute-force.d.ts

@@ -1,43 +0,0 @@
-import type { TruthTable } from './types';
-import { RootNode } from './root-node';
-/**
- * a function that is called each time
- * a 'better' bdd was found
- */
-export type OptmisiationCallback = (bdd: OptimisationResult) => void;
-export interface OptimisationResult {
-    bdd: RootNode;
-    truthTable: TruthTable;
-}
-export type CompareResultsFunction = (a: RootNode, b: RootNode) => RootNode | Promise<RootNode>;
-/**
- * returns the bdd with less nodes
- */
-export declare const defaultCompareResults: CompareResultsFunction;
-export interface OptimizeBruteForceInput {
-    truthTable: TruthTable;
-    iterations?: number;
-    onBetterBdd?: OptmisiationCallback;
-    compareResults?: CompareResultsFunction;
-    afterBddCreation?: (bdd: RootNode) => void;
-    log?: boolean;
-}
-/**
- * optimises the ordering of the boolean functions
- * by randomly sorting the array
- * and checking the resulting bdd
- */
-export declare function optimizeBruteForce({ truthTable, iterations, onBetterBdd, compareResults, afterBddCreation, log }: OptimizeBruteForceInput): Promise<OptimisationResult>;
-export type BooleanFunctionReorderMapping = {
-    [indexAfter: number]: number;
-};
-export type BooleanFunctionReorderMappingReverse = {
-    [indexBefore: number]: number;
-};
-export declare function shuffleBooleanOrdering(truthTable: TruthTable): {
-    newTable: TruthTable;
-    mapping: BooleanFunctionReorderMapping;
-    mappingBeforeToAfter: BooleanFunctionReorderMappingReverse;
-};
-export declare function changeKeyOrder(oldKey: string, mappingBeforeToAfter: BooleanFunctionReorderMapping): string;
-export declare function getArrayWithIndexes(size: number): number[];

package/dist/es/optimize-brute-force.js

@@ -1,132 +0,0 @@
-import { createBddFromTruthTable } from './create-bdd-from-truth-table';
-import { firstKeyOfMap, shuffleArray, lastOfArray } from './util';
-/**
- * returns the bdd with less nodes
- */
-export const defaultCompareResults = function (a, b) {
-    if (a.countNodes() <= b.countNodes()) {
-        return a;
-    }
-    else {
-        return b;
-    }
-};
-/**
- * optimises the ordering of the boolean functions
- * by randomly sorting the array
- * and checking the resulting bdd
- */
-export async function optimizeBruteForce({ truthTable, iterations = Infinity, onBetterBdd = () => null, compareResults = defaultCompareResults, afterBddCreation = () => null, log = false }) {
-    const initialBdd = 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 = createBddFromTruthTable(shuffledOrdering.newTable);
-        // change the levels of each node
-        const newNodesByLevel = new Map();
-        const lastLevel = 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;
-}
-export function shuffleBooleanOrdering(truthTable) {
-    const firstKey = firstKeyOfMap(truthTable);
-    const arrayWithIndexes = getArrayWithIndexes(firstKey.length);
-    const shuffled = 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
-    };
-}
-export 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;
-}
-export function getArrayWithIndexes(size) {
-    const ret = [];
-    let last = 0;
-    while (last < size) {
-        ret.push(last);
-        last++;
-    }
-    return ret;
-}
-//# sourceMappingURL=optimize-brute-force.js.map

package/dist/es/parents.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parents.js","sourceRoot":"","sources":["../../src/parents.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,MAAM,OAAO,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"}

package/dist/es/root-node.d.ts

@@ -1,28 +0,0 @@
-import { AbstractNode } from './abstract-node';
-import { Branches } from './branches';
-import type { NonRootNode, ResolverFunctions, SimpleBdd } from './types';
-import { LeafNode } from './leaf-node';
-export declare class RootNode extends AbstractNode {
-    branches: Branches;
-    levels: number[];
-    nodesByLevel: Map<number, Set<AbstractNode>>;
-    constructor();
-    addNode(node: NonRootNode): void;
-    removeNode(node: NonRootNode): void;
-    private ensureLevelSetExists;
-    getLevels(): number[];
-    getNodesOfLevel(level: number): NonRootNode[];
-    countNodes(): number;
-    /**
-     * applies the reduction rules to the whole bdd
-     */
-    minimize(logState?: boolean): void;
-    getLeafNodes(): LeafNode[];
-    /**
-     * strips all leaf-nodes
-     * with the given value
-     */
-    removeIrrelevantLeafNodes(leafNodeValue: number): void;
-    resolve(fns: ResolverFunctions, booleanFunctionInput: any): number;
-    toSimpleBdd(): SimpleBdd;
-}

package/dist/es/root-node.js

@@ -1,154 +0,0 @@
-import { AbstractNode } from './abstract-node';
-import { Branches } from './branches';
-import { lastOfArray, booleanToBooleanString } from './util';
-import { bddToSimpleBdd } from './minimal-string';
-export class RootNode extends AbstractNode {
-    constructor() {
-        super(0, null, 'RootNode');
-        this.branches = new Branches(this);
-        this.levels = [];
-        this.nodesByLevel = new Map();
-        this.levels.push(0);
-        const level0Set = new Set();
-        level0Set.add(this);
-        this.nodesByLevel.set(0, level0Set);
-    }
-    addNode(node) {
-        const level = node.level;
-        if (!this.levels.includes(level)) {
-            this.levels.push(level);
-        }
-        this.ensureLevelSetExists(level);
-        const set = this.nodesByLevel.get(level);
-        set === null || set === void 0 ? void 0 : set.add(node);
-    }
-    removeNode(node) {
-        const set = this.nodesByLevel.get(node.level);
-        if (!set.has(node)) {
-            throw new Error('removed non-existing node ' + node.id);
-        }
-        set.delete(node);
-    }
-    ensureLevelSetExists(level) {
-        if (!this.nodesByLevel.has(level)) {
-            this.nodesByLevel.set(level, new Set());
-        }
-    }
-    getLevels() {
-        return Array.from(this.levels).sort((a, b) => a - b);
-    }
-    getNodesOfLevel(level) {
-        this.ensureLevelSetExists(level);
-        const set = this.nodesByLevel.get(level);
-        return Array.from(set);
-    }
-    countNodes() {
-        let ret = 0;
-        this.getLevels().forEach(level => {
-            const nodesAmount = this.getNodesOfLevel(level).length;
-            ret = ret + nodesAmount;
-        });
-        return ret;
-    }
-    /**
-     * applies the reduction rules to the whole bdd
-     */
-    minimize(logState = false) {
-        // console.log('minimize(): START ###############');
-        let done = false;
-        while (!done) {
-            if (logState) {
-                console.log('minimize() itterate once');
-            }
-            let successCount = 0;
-            let lastLevel = lastOfArray(this.getLevels());
-            while (lastLevel > 0) {
-                const nodes = this.getNodesOfLevel(lastLevel);
-                if (logState) {
-                    console.log('minimize() run for level ' + lastLevel +
-                        ' with ' + nodes.length + ' nodes');
-                    // console.dir(nodes);
-                }
-                let nodeCount = 0;
-                for (const node of nodes) {
-                    nodeCount++;
-                    // do not run that often because it is expensive
-                    if (logState && nodeCount % 4000 === 0) {
-                        console.log('minimize() node #' + node.id);
-                    }
-                    if (node.isLeafNode()) {
-                        // console.log('have leaf node ' + node.id);
-                        const reductionDone = node.asLeafNode().applyEliminationRule();
-                        if (reductionDone) {
-                            successCount++;
-                        }
-                    }
-                    if (!node.deleted && node.isInternalNode()) {
-                        const useNode = node;
-                        const reductionDone = useNode.applyReductionRule();
-                        let eliminationDone = false;
-                        if (!useNode.deleted) {
-                            // not might now be deleted from reduction-rule
-                            eliminationDone = useNode.applyEliminationRule(nodes);
-                        }
-                        if (reductionDone || eliminationDone) {
-                            successCount++;
-                        }
-                    }
-                }
-                lastLevel--;
-            }
-            if (successCount === 0) {
-                // could do no more optimisations
-                done = true;
-            }
-            else {
-                if (logState) {
-                    console.log('minimize() itteration done with ' +
-                        successCount + ' minimisations');
-                }
-            }
-        }
-    }
-    getLeafNodes() {
-        const lastLevel = lastOfArray(this.getLevels());
-        const leafNodes = this.getNodesOfLevel(lastLevel).reverse();
-        return leafNodes;
-    }
-    /**
-     * strips all leaf-nodes
-     * with the given value
-     */
-    removeIrrelevantLeafNodes(leafNodeValue) {
-        let done = false;
-        while (!done) {
-            let countRemoved = 0;
-            const leafNodes = this.getLeafNodes();
-            for (const leafNode of leafNodes) {
-                const removed = leafNode.removeIfValueEquals(leafNodeValue);
-                if (removed) {
-                    countRemoved++;
-                }
-            }
-            this.minimize();
-            if (countRemoved === 0) {
-                done = true;
-            }
-        }
-    }
-    resolve(fns, booleanFunctionInput) {
-        let currentNode = this;
-        while (true) {
-            const booleanResult = fns[currentNode.level](booleanFunctionInput);
-            const branchKey = booleanToBooleanString(booleanResult);
-            currentNode = currentNode.branches.getBranch(branchKey);
-            if (currentNode.isLeafNode()) {
-                return currentNode.asLeafNode().value;
-            }
-        }
-    }
-    toSimpleBdd() {
-        return bddToSimpleBdd(this);
-    }
-}
-//# sourceMappingURL=root-node.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"root-node.js","sourceRoot":"","sources":["../../src/root-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAOtC,OAAO,EACH,WAAW,EACX,sBAAsB,EACzB,MAAM,QAAQ,CAAC;AAGhB,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,MAAM,OAAO,QAAS,SAAQ,YAAY;IAMtC;QACI,KAAK,CACD,CAAC,EACD,IAAI,EACJ,UAAU,CACb,CAAC;QAVC,aAAQ,GAAa,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAExC,WAAM,GAAa,EAAE,CAAC;QACtB,iBAAY,GAAmC,IAAI,GAAG,EAAE,CAAC;QAQ5D,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,SAAS,GAAsB,IAAI,GAAG,EAAE,CAAC;QAC/C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IAEM,OAAO,CAAC,IAAiB;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC3B;QAED,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,UAAU,CAAC,IAAiB;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAqB,CAAC;QAClE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YAChB,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;SAC3D;QACD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAEO,oBAAoB,CAAC,KAAa;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;SAC3C;IACL,CAAC;IAEM,SAAS;QACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC;IAEM,eAAe,CAAC,KAAa;QAChC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAqB,CAAC;QAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAEM,UAAU;QACb,IAAI,GAAG,GAAW,CAAC,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YACvD,GAAG,GAAG,GAAG,GAAG,WAAW,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,WAAoB,KAAK;QAC9B,oDAAoD;QACpD,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,OAAO,CAAC,IAAI,EAAE;YACV,IAAI,QAAQ,EAAE;gBACV,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;aAC3C;YACD,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,IAAI,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;YAC9C,OAAO,SAAS,GAAG,CAAC,EAAE;gBAClB,MAAM,KAAK,GAAmB,IAAI,CAAC,eAAe,CAAC,SAAS,CAAmB,CAAC;gBAChF,IAAI,QAAQ,EAAE;oBACV,OAAO,CAAC,GAAG,CACP,2BAA2B,GAAG,SAAS;wBACvC,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,QAAQ,CACrC,CAAC;oBACF,sBAAsB;iBACzB;gBAED,IAAI,SAAS,GAAG,CAAC,CAAC;gBAClB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;oBACtB,SAAS,EAAE,CAAC;oBAEZ,gDAAgD;oBAChD,IAAI,QAAQ,IAAI,SAAS,GAAG,IAAI,KAAK,CAAC,EAAE;wBACpC,OAAO,CAAC,GAAG,CACP,mBAAmB,GAAG,IAAI,CAAC,EAAE,CAChC,CAAC;qBACL;oBACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;wBACnB,4CAA4C;wBAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,oBAAoB,EAAE,CAAC;wBAC/D,IAAI,aAAa,EAAE;4BACf,YAAY,EAAE,CAAC;yBAClB;qBACJ;oBACD,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE;wBACxC,MAAM,OAAO,GAAG,IAAoB,CAAC;wBACrC,MAAM,aAAa,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;wBACnD,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE;4BAClB,+CAA+C;4BAC/C,eAAe,GAAG,OAAO,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;yBACzD;wBACD,IAAI,aAAa,IAAI,eAAe,EAAE;4BAClC,YAAY,EAAE,CAAC;yBAClB;qBACJ;iBACJ;gBACD,SAAS,EAAE,CAAC;aACf;YACD,IAAI,YAAY,KAAK,CAAC,EAAE;gBACpB,iCAAiC;gBACjC,IAAI,GAAG,IAAI,CAAC;aACf;iBAAM;gBACH,IAAI,QAAQ,EAAE;oBACV,OAAO,CAAC,GAAG,CACP,kCAAkC;wBAClC,YAAY,GAAG,gBAAgB,CAClC,CAAC;iBACL;aACJ;SACJ;IACL,CAAC;IAEM,YAAY;QACf,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,OAAO,EAAgB,CAAC;QAC1E,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,yBAAyB,CAAC,aAAqB;QAC3C,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,OAAO,CAAC,IAAI,EAAE;YACV,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBAC5D,IAAI,OAAO,EAAE;oBACT,YAAY,EAAE,CAAC;iBAClB;aACJ;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAEhB,IAAI,YAAY,KAAK,CAAC,EAAE;gBACpB,IAAI,GAAG,IAAI,CAAC;aACf;SACJ;IACL,CAAC;IAED,OAAO,CACH,GAAsB,EACtB,oBAAyB;QAEzB,IAAI,WAAW,GAAiB,IAAI,CAAC;QACrC,OAAO,IAAI,EAAE;YACT,MAAM,aAAa,GAAG,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,oBAAoB,CAAC,CAAC;YACnE,MAAM,SAAS,GAAG,sBAAsB,CAAC,aAAa,CAAC,CAAC;YACxD,WAAW,GAAI,WAA2B,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACzE,IAAI,WAAW,CAAC,UAAU,EAAE,EAAE;gBAC1B,OAAO,WAAW,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC;aACzC;SACJ;IACL,CAAC;IAEM,WAAW;QACd,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;CACJ"}

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

@@ -1,33 +0,0 @@
-import type { NonRootNode, NodeType } from './types';
-import { RootNode } from './root-node';
-import { InternalNode } from './internal-node';
-import { LeafNode } from './leaf-node';
-export declare class AbstractNode {
-    level: number;
-    readonly id: string;
-    deleted: boolean;
-    type: NodeType;
-    rootNode: RootNode;
-    constructor(level: number, rootNode: RootNode | null, type: NodeType);
-    isEqualToOtherNode(otherNode: NonRootNode | RootNode, ownString?: string): boolean;
-    remove(): void;
-    toJSON(withId?: boolean): any;
-    toString(): string;
-    isRootNode(): boolean;
-    isInternalNode(): boolean;
-    isLeafNode(): boolean;
-    asRootNode(): RootNode;
-    asInternalNode(): InternalNode;
-    asLeafNode(): LeafNode;
-    ensureNotDeleted(op?: string): void;
-    log(): void;
-    /**
- * 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<T extends AbstractNode>(nodesOfSameLevel?: T[]): boolean;
-}

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,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/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,70 +0,0 @@
-/**
- * represents the branches of a single node
- */
-export 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']);
-    }
-}
-export function ensureNodesNotStrictEqual(node1, node2) {
-    if (node1 === node2) {
-        throw new Error('cannot have two strict equal branches');
-    }
-}
-//# 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,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/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.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/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>;