binary-decision-diagram 1.3.1 → 2.0.0

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

@@ -1,72 +1,9 @@
-var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
-    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
-    return new (P || (P = Promise))(function (resolve, reject) {
-        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
-        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
-        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
-        step((generator = generator.apply(thisArg, _arguments || [])).next());
-    });
-};
-var __generator = (this && this.__generator) || function (thisArg, body) {
-    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
-    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
-    function verb(n) { return function (v) { return step([n, v]); }; }
-    function step(op) {
-        if (f) throw new TypeError("Generator is already executing.");
-        while (_) try {
-            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
-            if (y = 0, t) op = [op[0] & 2, t.value];
-            switch (op[0]) {
-                case 0: case 1: t = op; break;
-                case 4: _.label++; return { value: op[1], done: false };
-                case 5: _.label++; y = op[1]; op = [0]; continue;
-                case 7: op = _.ops.pop(); _.trys.pop(); continue;
-                default:
-                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
-                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
-                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
-                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
-                    if (t[2]) _.ops.pop();
-                    _.trys.pop(); continue;
-            }
-            op = body.call(thisArg, _);
-        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
-        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
-    }
-};
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
 import { createBddFromTruthTable } from './create-bdd-from-truth-table';
 import { firstKeyOfMap, shuffleArray, lastOfArray } from './util';
 /**
  * returns the bdd with less nodes
  */
-export var defaultCompareResults = function (a, b) {
+export const defaultCompareResults = function (a, b) {
     if (a.countNodes() <= b.countNodes()) {
         return a;
     }
@@ -79,148 +16,113 @@ export var defaultCompareResults = function (a, b) {
  * by randomly sorting the array
  * and checking the resulting bdd
  */
-export function optimizeBruteForce(_a) {
-    var truthTable = _a.truthTable, _b = _a.iterations, iterations = _b === void 0 ? Infinity : _b, _c = _a.onBetterBdd, onBetterBdd = _c === void 0 ? function () { return null; } : _c, _d = _a.compareResults, compareResults = _d === void 0 ? defaultCompareResults : _d, _e = _a.afterBddCreation, afterBddCreation = _e === void 0 ? function () { return null; } : _e, _f = _a.log, log = _f === void 0 ? false : _f;
-    return __awaiter(this, void 0, void 0, function () {
-        var initialBdd, currentBestResult, t, _loop_1;
-        return __generator(this, function (_g) {
-            switch (_g.label) {
-                case 0:
-                    initialBdd = createBddFromTruthTable(truthTable);
-                    afterBddCreation(initialBdd);
-                    initialBdd.minimize();
-                    currentBestResult = {
-                        truthTable: truthTable,
-                        bdd: initialBdd
-                    };
-                    if (log) {
-                        initialBdd.log();
-                        console.log('initial nodes amount: ' + initialBdd.countNodes());
-                    }
-                    t = 0;
-                    _loop_1 = function () {
-                        var shuffledOrdering, nextBdd, newNodesByLevel, lastLevel, newSortedLevels, lastLevelSet, betterBdd;
-                        return __generator(this, function (_a) {
-                            switch (_a.label) {
-                                case 0:
-                                    t++;
-                                    if (log) {
-                                        console.log('-'.repeat(50));
-                                        console.log('optimizeBruteForce() itterate once');
-                                    }
-                                    shuffledOrdering = shuffleBooleanOrdering(truthTable);
-                                    nextBdd = createBddFromTruthTable(shuffledOrdering.newTable);
-                                    newNodesByLevel = new Map();
-                                    lastLevel = lastOfArray(nextBdd.getLevels());
-                                    newSortedLevels = [];
-                                    nextBdd.getLevels()
-                                        .filter(function (level) { return level !== lastLevel; })
-                                        .forEach(function (level) {
-                                        var newLevel = shuffledOrdering.mappingBeforeToAfter[level];
-                                        newSortedLevels.push(newLevel);
-                                        var levelSet = new Set();
-                                        newNodesByLevel.set(newLevel, levelSet);
-                                        nextBdd.getNodesOfLevel(level).forEach(function (node) {
-                                            node.level = newLevel;
-                                            levelSet.add(node);
-                                        });
-                                    });
-                                    lastLevelSet = new Set();
-                                    nextBdd.getNodesOfLevel(lastLevel).forEach(function (node) { return 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);
-                                    }
-                                    return [4 /*yield*/, compareResults(currentBestResult.bdd, nextBdd)];
-                                case 1:
-                                    betterBdd = _a.sent();
-                                    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 [2 /*return*/];
-                            }
-                        });
-                    };
-                    _g.label = 1;
-                case 1:
-                    if (!(t < iterations)) return [3 /*break*/, 3];
-                    return [5 /*yield**/, _loop_1()];
-                case 2:
-                    _g.sent();
-                    return [3 /*break*/, 1];
-                case 3: return [2 /*return*/, currentBestResult];
-            }
+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) {
-    var e_1, _a;
-    var firstKey = firstKeyOfMap(truthTable);
-    var arrayWithIndexes = getArrayWithIndexes(firstKey.length);
-    var shuffled = shuffleArray(arrayWithIndexes);
-    var mapping = {};
-    var mappingBeforeToAfter = {};
-    shuffled.forEach(function (indexBefore, indexAfter) {
+    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;
     });
-    var newTable = new Map();
-    try {
-        for (var _b = __values(truthTable.entries()), _c = _b.next(); !_c.done; _c = _b.next()) {
-            var _d = __read(_c.value, 2), key = _d[0], value = _d[1];
-            var newKey = changeKeyOrder(key, mapping);
-            newTable.set(newKey, value);
-        }
-    }
-    catch (e_1_1) { e_1 = { error: e_1_1 }; }
-    finally {
-        try {
-            if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
-        }
-        finally { if (e_1) throw e_1.error; }
+    const newTable = new Map();
+    for (const [key, value] of truthTable.entries()) {
+        const newKey = changeKeyOrder(key, mapping);
+        newTable.set(newKey, value);
     }
     return {
-        newTable: newTable,
-        mapping: mapping,
-        mappingBeforeToAfter: mappingBeforeToAfter
+        newTable,
+        mapping,
+        mappingBeforeToAfter
     };
 }
 export function changeKeyOrder(oldKey, mappingBeforeToAfter) {
-    var chars = oldKey
+    const chars = oldKey
         .split('')
-        .map(function (char, indexBefore) {
+        .map((char, indexBefore) => {
         return {
-            char: char,
-            indexBefore: indexBefore,
+            char,
+            indexBefore,
             indexAfter: mappingBeforeToAfter[indexBefore]
         };
     })
-        .sort(function (a, b) { return a.indexAfter - b.indexAfter; })
-        .map(function (charObj) { return charObj.char; })
+        .sort((a, b) => a.indexAfter - b.indexAfter)
+        .map(charObj => charObj.char)
         .join('');
     return chars;
 }
 export function getArrayWithIndexes(size) {
-    var ret = [];
-    var last = 0;
+    const ret = [];
+    let last = 0;
     while (last < size) {
         ret.push(last);
         last++;

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

@@ -1 +1 @@
-{"version":3,"file":"optimize-brute-force.js","sourceRoot":"","sources":["../../src/optimize-brute-force.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,OAAO,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AACxE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAgBlE;;GAEG;AACH,MAAM,CAAC,IAAM,qBAAqB,GAA2B,UACzD,CAAW,EACX,CAAW;IAEX,IAAI,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;QAClC,OAAO,CAAC,CAAC;KACZ;SAAM;QACH,OAAO,CAAC,CAAC;KACZ;AACL,CAAC,CAAC;AAYF;;;;GAIG;AACH,MAAM,UAAgB,kBAAkB,CAAC,EAOf;QANtB,0BAAU,EACV,kBAAqB,EAArB,0CAAqB,EACrB,mBAAwB,EAAxB,+DAAwB,EACxB,sBAAsC,EAAtC,2DAAsC,EACtC,wBAA6B,EAA7B,oEAA6B,EAC7B,WAAW,EAAX,gCAAW;;;;;;oBAGL,UAAU,GAAG,uBAAuB,CAAC,UAAU,CAAC,CAAC;oBACvD,gBAAgB,CAAC,UAAU,CAAC,CAAC;oBAC7B,UAAU,CAAC,QAAQ,EAAE,CAAC;oBAClB,iBAAiB,GAAuB;wBACxC,UAAU,YAAA;wBACV,GAAG,EAAE,UAAU;qBAClB,CAAC;oBAEF,IAAI,GAAG,EAAE;wBACL,UAAU,CAAC,GAAG,EAAE,CAAC;wBACjB,OAAO,CAAC,GAAG,CAAC,wBAAwB,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;qBACnE;oBAEG,CAAC,GAAG,CAAC,CAAC;;;;;;oCAEN,CAAC,EAAE,CAAC;oCAEJ,IAAI,GAAG,EAAE;wCACL,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;wCAC5B,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;qCACrD;oCACK,gBAAgB,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC;oCACtD,OAAO,GAAG,uBAAuB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;oCAG7D,eAAe,GAAmC,IAAI,GAAG,EAAE,CAAC;oCAC5D,SAAS,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;oCAC7C,eAAe,GAAa,EAAE,CAAC;oCACrC,OAAO,CAAC,SAAS,EAAE;yCACd,MAAM,CAAC,UAAA,KAAK,IAAI,OAAA,KAAK,KAAK,SAAS,EAAnB,CAAmB,CAAC;yCACpC,OAAO,CAAC,UAAA,KAAK;wCACV,IAAM,QAAQ,GAAG,gBAAgB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;wCAC9D,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wCAC/B,IAAM,QAAQ,GAAsB,IAAI,GAAG,EAAE,CAAC;wCAC9C,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wCACxC,OAAO,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,UAAA,IAAI;4CACvC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;4CACtB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wCACvB,CAAC,CAAC,CAAC;oCACP,CAAC,CAAC,CAAC;oCACD,YAAY,GAAsB,IAAI,GAAG,EAAE,CAAC;oCAClD,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,UAAA,IAAI,IAAI,OAAA,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAtB,CAAsB,CAAC,CAAC;oCAC3E,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;oCAC7C,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oCAChC,OAAO,CAAC,YAAY,GAAG,eAAe,CAAC;oCACvC,OAAO,CAAC,MAAM,GAAG,eAAe,CAAC;oCAEjC,gBAAgB,CAAC,OAAO,CAAC,CAAC;oCAC1B,OAAO,CAAC,QAAQ,EAAE,CAAC;oCAEnB,IAAI,GAAG,EAAE;wCACL,OAAO,CAAC,GAAG,CAAC,mCAAmC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;wCACxE,4BAA4B;wCAC5B,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;qCACtD;oCAEiB,qBAAM,cAAc,CAClC,iBAAiB,CAAC,GAAG,EACrB,OAAO,CACV,EAAA;;oCAHK,SAAS,GAAG,SAGjB;oCACD,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,EAAE;wCAC/B,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;qCAC1D;oCAED,IAAI,SAAS,KAAK,OAAO,EAAE;wCAEvB,IAAI,GAAG,EAAE;4CACL,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;4CAC5B,OAAO,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;yCAC3D;wCAED,iBAAiB,GAAG;4CAChB,GAAG,EAAE,OAAO;4CACZ,UAAU,EAAE,gBAAgB,CAAC,QAAQ;yCACxC,CAAC;wCACF,WAAW,CAAC,iBAAiB,CAAC,CAAC;qCAClC;;;;;;;yBA9DE,CAAA,CAAC,GAAG,UAAU,CAAA;;;;;wBAkErB,sBAAO,iBAAiB,EAAC;;;;CAC5B;AAWD,MAAM,UAAU,sBAAsB,CAClC,UAAsB;;IAMtB,IAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;IAC3C,IAAM,gBAAgB,GAAG,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9D,IAAM,QAAQ,GAAG,YAAY,CAAC,gBAAgB,CAAC,CAAC;IAEhD,IAAM,OAAO,GAAkC,EAAE,CAAC;IAClD,IAAM,oBAAoB,GAAyC,EAAE,CAAC;IACtE,QAAQ,CAAC,OAAO,CAAC,UAAC,WAAW,EAAE,UAAU;QACrC,OAAO,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;QAClC,oBAAoB,CAAC,WAAW,CAAC,GAAG,UAAU,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAM,QAAQ,GAAe,IAAI,GAAG,EAAE,CAAC;;QACvC,KAA2B,IAAA,KAAA,SAAA,UAAU,CAAC,OAAO,EAAE,CAAA,gBAAA,4BAAE;YAAtC,IAAA,wBAAY,EAAX,WAAG,EAAE,aAAK;YAClB,IAAM,MAAM,GAAG,cAAc,CACzB,GAAG,EACH,OAAO,CACV,CAAC;YACF,QAAQ,CAAC,GAAG,CACR,MAAM,EACN,KAAK,CACR,CAAC;SACL;;;;;;;;;IAED,OAAO;QACH,QAAQ,UAAA;QACR,OAAO,SAAA;QACP,oBAAoB,sBAAA;KACvB,CAAC;AACN,CAAC;AAED,MAAM,UAAU,cAAc,CAC1B,MAAc,EACd,oBAAmD;IAEnD,IAAM,KAAK,GAAG,MAAM;SACf,KAAK,CAAC,EAAE,CAAC;SACT,GAAG,CAAC,UAAC,IAAI,EAAE,WAAW;QACnB,OAAO;YACH,IAAI,MAAA;YACJ,WAAW,aAAA;YACX,UAAU,EAAE,oBAAoB,CAAC,WAAW,CAAC;SAChD,CAAC;IACN,CAAC,CAAC;SACD,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,EAA3B,CAA2B,CAAC;SAC3C,GAAG,CAAC,UAAA,OAAO,IAAI,OAAA,OAAO,CAAC,IAAI,EAAZ,CAAY,CAAC;SAC5B,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC5C,IAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,IAAI,EAAE;QAChB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,EAAE,CAAC;KACV;IACD,OAAO,GAAG,CAAC;AACf,CAAC"}
+{"version":3,"file":"optimize-brute-force.js","sourceRoot":"","sources":["../../src/optimize-brute-force.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AACxE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAgBlE;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAA2B,UACzD,CAAW,EACX,CAAW;IAEX,IAAI,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;QAClC,OAAO,CAAC,CAAC;KACZ;SAAM;QACH,OAAO,CAAC,CAAC;KACZ;AACL,CAAC,CAAC;AAYF;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,EACrC,UAAU,EACV,UAAU,GAAG,QAAQ,EACrB,WAAW,GAAG,GAAG,EAAE,CAAC,IAAI,EACxB,cAAc,GAAG,qBAAqB,EACtC,gBAAgB,GAAG,GAAG,EAAE,CAAC,IAAI,EAC7B,GAAG,GAAG,KAAK,EACW;IAEtB,MAAM,UAAU,GAAG,uBAAuB,CAAC,UAAU,CAAC,CAAC;IACvD,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC7B,UAAU,CAAC,QAAQ,EAAE,CAAC;IACtB,IAAI,iBAAiB,GAAuB;QACxC,UAAU;QACV,GAAG,EAAE,UAAU;KAClB,CAAC;IAEF,IAAI,GAAG,EAAE;QACL,UAAU,CAAC,GAAG,EAAE,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,wBAAwB,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;KACnE;IAED,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,UAAU,EAAE;QACnB,CAAC,EAAE,CAAC;QAEJ,IAAI,GAAG,EAAE;YACL,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;SACrD;QACD,MAAM,gBAAgB,GAAG,sBAAsB,CAAC,UAAU,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,uBAAuB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEnE,iCAAiC;QACjC,MAAM,eAAe,GAAmC,IAAI,GAAG,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QACnD,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,OAAO,CAAC,SAAS,EAAE;aACd,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC;aACpC,OAAO,CAAC,KAAK,CAAC,EAAE;YACb,MAAM,QAAQ,GAAG,gBAAgB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/B,MAAM,QAAQ,GAAsB,IAAI,GAAG,EAAE,CAAC;YAC9C,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACxC,OAAO,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC1C,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;gBACtB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QACP,MAAM,YAAY,GAAsB,IAAI,GAAG,EAAE,CAAC;QAClD,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC7C,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChC,OAAO,CAAC,YAAY,GAAG,eAAe,CAAC;QACvC,OAAO,CAAC,MAAM,GAAG,eAAe,CAAC;QAEjC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC1B,OAAO,CAAC,QAAQ,EAAE,CAAC;QAEnB,IAAI,GAAG,EAAE;YACL,OAAO,CAAC,GAAG,CAAC,mCAAmC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YACxE,4BAA4B;YAC5B,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;SACtD;QAED,MAAM,SAAS,GAAG,MAAM,cAAc,CAClC,iBAAiB,CAAC,GAAG,EACrB,OAAO,CACV,CAAC;QACF,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,EAAE;YAC/B,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;SAC1D;QAED,IAAI,SAAS,KAAK,OAAO,EAAE;YAEvB,IAAI,GAAG,EAAE;gBACL,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,OAAO,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;aAC3D;YAED,iBAAiB,GAAG;gBAChB,GAAG,EAAE,OAAO;gBACZ,UAAU,EAAE,gBAAgB,CAAC,QAAQ;aACxC,CAAC;YACF,WAAW,CAAC,iBAAiB,CAAC,CAAC;SAClC;KACJ;IAGD,OAAO,iBAAiB,CAAC;AAC7B,CAAC;AAWD,MAAM,UAAU,sBAAsB,CAClC,UAAsB;IAMtB,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,YAAY,CAAC,gBAAgB,CAAC,CAAC;IAEhD,MAAM,OAAO,GAAkC,EAAE,CAAC;IAClD,MAAM,oBAAoB,GAAyC,EAAE,CAAC;IACtE,QAAQ,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,UAAU,EAAE,EAAE;QACzC,OAAO,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;QAClC,oBAAoB,CAAC,WAAW,CAAC,GAAG,UAAU,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAe,IAAI,GAAG,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE;QAC7C,MAAM,MAAM,GAAG,cAAc,CACzB,GAAG,EACH,OAAO,CACV,CAAC;QACF,QAAQ,CAAC,GAAG,CACR,MAAM,EACN,KAAK,CACR,CAAC;KACL;IAED,OAAO;QACH,QAAQ;QACR,OAAO;QACP,oBAAoB;KACvB,CAAC;AACN,CAAC;AAED,MAAM,UAAU,cAAc,CAC1B,MAAc,EACd,oBAAmD;IAEnD,MAAM,KAAK,GAAG,MAAM;SACf,KAAK,CAAC,EAAE,CAAC;SACT,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE;QACvB,OAAO;YACH,IAAI;YACJ,WAAW;YACX,UAAU,EAAE,oBAAoB,CAAC,WAAW,CAAC;SAChD,CAAC;IACN,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;SAC5B,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,IAAI,EAAE;QAChB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,EAAE,CAAC;KACV;IACD,OAAO,GAAG,CAAC;AACf,CAAC"}

package/dist/es/parents.d.ts

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

package/dist/es/parents.js

@@ -1,66 +1,38 @@
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
 /**
  * represents the parents of a single node
  */
-var Parents = /** @class */ (function () {
-    function Parents(node) {
+export class Parents {
+    constructor(node) {
         this.node = node;
         this.parents = new Set();
     }
-    Parents.prototype.remove = function (node) {
+    remove(node) {
         this.parents.delete(node);
         if (this.parents.size === 0) {
             this.node.remove();
         }
-    };
-    Parents.prototype.getAll = function () {
+    }
+    getAll() {
         return Array.from(this.parents);
-    };
-    Parents.prototype.add = function (node) {
+    }
+    add(node) {
         if (this.node.level === node.level) {
             throw new Error('a node cannot be parent of a node with the same level');
         }
         this.parents.add(node);
-    };
-    Parents.prototype.has = function (node) {
+    }
+    has(node) {
         return this.parents.has(node);
-    };
-    Parents.prototype.toString = function () {
-        var e_1, _a;
-        var ret = [];
-        try {
-            for (var _b = __values(this.parents), _c = _b.next(); !_c.done; _c = _b.next()) {
-                var parent_1 = _c.value;
-                ret.push(parent_1.id);
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
-            }
-            finally { if (e_1) throw e_1.error; }
+    }
+    toString() {
+        const ret = [];
+        for (const parent of this.parents) {
+            ret.push(parent.id);
         }
         return ret.join(', ');
-    };
-    Object.defineProperty(Parents.prototype, "size", {
-        get: function () {
-            return this.parents.size;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    return Parents;
-}());
-export { Parents };
+    }
+    get size() {
+        return this.parents.size;
+    }
+}
 //# sourceMappingURL=parents.js.map

package/dist/es/parents.js.map

@@ -1 +1 @@
-{"version":3,"file":"parents.js","sourceRoot":"","sources":["../../src/parents.ts"],"names":[],"mappings":";;;;;;;;;;;AAKA;;GAEG;AACH;IAII,iBACW,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QAHpB,YAAO,GAAqB,IAAI,GAAG,EAAE,CAAC;IAI1C,CAAC;IAEE,wBAAM,GAAb,UAAc,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,wBAAM,GAAb;QACI,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,qBAAG,GAAV,UAAW,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,qBAAG,GAAV,UAAW,IAAiB;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,0BAAQ,GAAR;;QACI,IAAM,GAAG,GAAa,EAAE,CAAC;;YACzB,KAAqB,IAAA,KAAA,SAAA,IAAI,CAAC,OAAO,CAAA,gBAAA,4BAAE;gBAA9B,IAAM,QAAM,WAAA;gBACb,GAAG,CAAC,IAAI,CAAC,QAAM,CAAC,EAAE,CAAC,CAAC;aACvB;;;;;;;;;QACD,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,sBAAI,yBAAI;aAAR;YACI,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC7B,CAAC;;;OAAA;IACL,cAAC;AAAD,CAAC,AA1CD,IA0CC"}
+{"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,6 +1,6 @@
 import { AbstractNode } from './abstract-node';
 import { Branches } from './branches';
-import { NonRootNode, ResolverFunctions, SimpleBdd } from './types';
+import type { NonRootNode, ResolverFunctions, SimpleBdd } from './types';
 import { LeafNode } from './leaf-node';
 export declare class RootNode extends AbstractNode {
     branches: Branches;