binary-decision-diagram 3.2.0 → 5.0.0

package/dist/cjs/src/ordering/exact-cost-ordering.js

@@ -0,0 +1,351 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ExactCostOrderingSearch = void 0;
+const dense_truth_table_js_1 = require("./dense-truth-table.js");
+const ordering_evaluator_js_1 = require("./ordering-evaluator.js");
+const shared_diagram_js_1 = require("./shared-diagram.js");
+/**
+ * Exact minimization of the expected cost of a resolve() call.
+ *
+ * A row pays the cost of a boolean function when its path through the BDD
+ * visits a node of that function, which happens exactly when the cofactor of
+ * the row with respect to the functions above still depends on that function.
+ * So like the amount of nodes, the expected cost decomposes over the lattice of
+ * variable subsets: the edge S -> S + {x} costs cost(x) times the weight of the
+ * rows whose cofactor with respect to S depends on x (the root level always
+ * pays, because the root node always calls its function).
+ *
+ * A state keeps the rows with positive weight grouped by their cofactor.
+ * Rows whose cofactor became constant never pay anything again and are dropped.
+ * The admissible estimate for the remaining cost sums, for every function x
+ * not yet placed, cost(x) times the weight of the rows that are sensitive to x
+ * (the value changes when only x is flipped), because such rows pay for x in
+ * every ordering.
+ */
+class ExactCostOrderingSearch {
+    table;
+    costModel;
+    diagram;
+    n;
+    /** natural indexes of the rows with positive weight, ascending */
+    activeRows;
+    activeWeights;
+    totalWeight;
+    /** sensitiveWeight[v] = weight of the active rows whose value changes when only v is flipped */
+    sensitiveWeight;
+    costs;
+    constructor(table, costModel, options = {}) {
+        this.table = table;
+        this.costModel = costModel;
+        if (table.dontCareTerminal >= 0) {
+            throw new Error('the exact search needs a truth table without don\'t-care rows, resolve them with OrderingEvaluator.complete() first');
+        }
+        this.diagram = new shared_diagram_js_1.SharedDiagram(table, options.maxDiagramNodes === undefined ? shared_diagram_js_1.DEFAULT_MAX_DIAGRAM_NODES : options.maxDiagramNodes);
+        this.n = table.variableCount;
+        this.costs = costModel.functionCosts;
+        const rowWeights = costModel.rowWeights;
+        let activeCount = 0;
+        for (let row = 0; row < table.rowCount; row++) {
+            if (rowWeights[row] > 0) {
+                activeCount++;
+            }
+        }
+        this.activeRows = new Int32Array(activeCount);
+        this.activeWeights = new Float64Array(activeCount);
+        let total = 0;
+        let index = 0;
+        for (let row = 0; row < table.rowCount; row++) {
+            if (rowWeights[row] > 0) {
+                this.activeRows[index] = row;
+                this.activeWeights[index] = rowWeights[row];
+                total += rowWeights[row];
+                index++;
+            }
+        }
+        this.totalWeight = total;
+        this.sensitiveWeight = new Float64Array(this.n);
+        const ids = table.terminalIds;
+        for (let v = 0; v < this.n; v++) {
+            const bit = 1 << (this.n - 1 - v);
+            let weight = 0;
+            for (let i = 0; i < activeCount; i++) {
+                const row = this.activeRows[i];
+                if (ids[row] !== ids[row ^ bit]) {
+                    weight += this.activeWeights[i];
+                }
+            }
+            this.sensitiveWeight[v] = weight;
+        }
+    }
+    normalizeOrdering(ordering) {
+        return this.diagram.normalizeOrdering(ordering);
+    }
+    run(options = {}) {
+        const log = options.log ? options.log : () => null;
+        const maxExpansions = options.maxExpansions === undefined ? 200000 : options.maxExpansions;
+        const maxStoredRows = options.maxStoredRows === undefined ? Math.pow(2, 25) : options.maxStoredRows;
+        const diagram = this.diagram;
+        const relevant = diagram.relevant;
+        const m = relevant.length;
+        const total = this.totalWeight;
+        const costs = this.costs;
+        const irrelevant = diagram.irrelevantVariables();
+        // path costs are unnormalized (multiplied by the total weight), so is the tolerance unit
+        const unit = (0, ordering_evaluator_js_1.costUnit)(this.costModel) * total;
+        const tolerance = (value) => (0, ordering_evaluator_js_1.costTolerance)(value, unit);
+        /**
+         * Only costs below this threshold can beat the upper bound.
+         * Without an upper bound every finite cost can.
+         */
+        const pruneThreshold = (bound) => isFinite(bound) ? bound - tolerance(bound) : Infinity;
+        // upper bound, kept unnormalized (multiplied by the total weight) like the path costs
+        let upperBound = options.upperBound === undefined ? Infinity : options.upperBound * total;
+        let incumbent = null;
+        if (options.upperBoundOrdering) {
+            incumbent = this.normalizeOrdering(options.upperBoundOrdering);
+            const incumbentCost = new ordering_evaluator_js_1.OrderingEvaluator(this.table, this.costModel).evaluate(incumbent).expectedCost * total;
+            if (incumbentCost >= pruneThreshold(upperBound)) {
+                incumbent = null;
+            }
+            else {
+                upperBound = incumbentCost;
+            }
+        }
+        const threshold = pruneThreshold(upperBound);
+        const result = (solved, ordering, cost, expansionCount, generatedCount) => ({
+            solved,
+            ordering,
+            expectedCost: ordering ? cost / total : -1,
+            expansions: expansionCount,
+            generated: generatedCount
+        });
+        if (diagram.overBudget) {
+            log('exact cost search: diagram budget exceeded');
+            return result(false, incumbent, upperBound, 0, 0);
+        }
+        if (m === 0) {
+            // constant function: only the root pays, so the cheapest function goes on top
+            const ordering = (0, dense_truth_table_js_1.naturalOrdering)(this.n).sort((a, b) => (costs[a] - costs[b]) || (a - b));
+            const cost = costs[ordering[0]] * total;
+            if (cost >= threshold) {
+                return result(true, incumbent, upperBound, 0, 0);
+            }
+            return result(true, ordering, cost, 0, 0);
+        }
+        const full = (1 << m) - 1;
+        const states = new Map();
+        const bestCost = new Map();
+        const parentVariable = new Map();
+        const closed = new Set();
+        const heap = new shared_diagram_js_1.StateHeap();
+        const startRows = new Int32Array(this.activeRows.length);
+        for (let i = 0; i < startRows.length; i++) {
+            startRows[i] = i;
+        }
+        const startState = {
+            rows: startRows,
+            groupStart: Int32Array.of(0, startRows.length),
+            groupFunction: Int32Array.of(diagram.rootId),
+            groupWeight: Float64Array.of(total)
+        };
+        states.set(0, startState);
+        bestCost.set(0, 0);
+        heap.push(this.estimate(0), 0, 0);
+        let expansions = 0;
+        let generated = 1;
+        let storedRows = startRows.length;
+        let solvedSet = -1;
+        let solvedCost = -1;
+        try {
+            while (heap.size > 0) {
+                const state = heap.pop();
+                const currentCost = state.cost;
+                const subset = state.subset;
+                if (currentCost !== bestCost.get(subset) || closed.has(subset)) {
+                    continue;
+                }
+                if (state.estimate >= threshold) {
+                    break;
+                }
+                if (subset === full) {
+                    solvedSet = subset;
+                    solvedCost = currentCost;
+                    break;
+                }
+                closed.add(subset);
+                expansions++;
+                if (expansions > maxExpansions) {
+                    log('exact cost search: expansion budget exceeded');
+                    return result(false, incumbent, upperBound, expansions, generated);
+                }
+                if (storedRows > maxStoredRows) {
+                    log('exact cost search: memory budget exceeded');
+                    return result(false, incumbent, upperBound, expansions, generated);
+                }
+                if (expansions % 10000 === 0) {
+                    log('exact cost search: ' + expansions + ' states expanded, ' + generated + ' generated, ' + heap.size + ' open');
+                }
+                const grouped = states.get(subset);
+                for (let c = 0; c < m; c++) {
+                    const bit = 1 << c;
+                    if ((subset & bit) !== 0) {
+                        continue;
+                    }
+                    const variable = relevant[c];
+                    const nextSubset = subset | bit;
+                    const payingWeight = subset === 0 ? total : this.payingWeight(grouped, variable);
+                    const nextCost = currentCost + costs[variable] * payingWeight;
+                    const knownCost = bestCost.get(nextSubset);
+                    if (knownCost !== undefined && knownCost <= nextCost + tolerance(nextCost)) {
+                        continue;
+                    }
+                    const estimate = nextCost + this.estimate(nextSubset);
+                    if (estimate >= threshold) {
+                        continue;
+                    }
+                    // the grouping of the rows is only needed when the state can be expanded
+                    if (!states.has(nextSubset)) {
+                        const next = this.transition(grouped, variable);
+                        states.set(nextSubset, next);
+                        generated++;
+                        storedRows += next.rows.length;
+                    }
+                    bestCost.set(nextSubset, nextCost);
+                    parentVariable.set(nextSubset, variable);
+                    closed.delete(nextSubset);
+                    heap.push(estimate, nextCost, nextSubset);
+                }
+            }
+        }
+        catch (err) {
+            if (err instanceof shared_diagram_js_1.DiagramBudgetExceededError) {
+                log('exact cost search: diagram budget exceeded');
+                return result(false, incumbent, upperBound, expansions, generated);
+            }
+            throw err;
+        }
+        if (solvedSet === -1) {
+            return result(true, incumbent, upperBound, expansions, generated);
+        }
+        const reversed = [];
+        let remainingSubset = solvedSet;
+        while (remainingSubset !== 0) {
+            const variable = parentVariable.get(remainingSubset);
+            reversed.push(variable);
+            remainingSubset = remainingSubset & ~(1 << diagram.compactOf[variable]);
+        }
+        return result(true, reversed.reverse().concat(irrelevant), solvedCost, expansions, generated);
+    }
+    /**
+     * lower bound for the remaining (unnormalized) cost below the subset
+     */
+    estimate(subset) {
+        const relevant = this.diagram.relevant;
+        let estimate = 0;
+        for (let c = 0; c < relevant.length; c++) {
+            if ((subset & (1 << c)) === 0) {
+                const variable = relevant[c];
+                estimate += this.costs[variable] * this.sensitiveWeight[variable];
+            }
+        }
+        return estimate;
+    }
+    /**
+     * the weight of the rows that pay for `variable` when it is fixed next
+     */
+    payingWeight(grouped, variable) {
+        const diagram = this.diagram;
+        const bit = 1 << diagram.compactOf[variable];
+        let payingWeight = 0;
+        for (let g = 0; g < grouped.groupFunction.length; g++) {
+            if ((diagram.supportOf(grouped.groupFunction[g]) & bit) !== 0) {
+                payingWeight += grouped.groupWeight[g];
+            }
+        }
+        return payingWeight;
+    }
+    /**
+     * fixes `variable` additionally: returns the new grouping of the rows
+     * that still have a non-constant cofactor
+     */
+    transition(grouped, variable) {
+        const diagram = this.diagram;
+        const rowBit = 1 << (this.n - 1 - variable);
+        const groupCount = grouped.groupFunction.length;
+        const functions = [];
+        const rowLists = [];
+        for (let g = 0; g < groupCount; g++) {
+            const fn = grouped.groupFunction[g];
+            const start = grouped.groupStart[g];
+            const end = grouped.groupStart[g + 1];
+            const rows = grouped.rows.subarray(start, end);
+            if (!diagram.dependsOn(fn, variable)) {
+                functions.push(fn);
+                rowLists.push(rows);
+                continue;
+            }
+            const lo = diagram.restrict(fn, variable, 0);
+            const hi = diagram.restrict(fn, variable, 1);
+            let loCount = 0;
+            for (let i = 0; i < rows.length; i++) {
+                if ((this.activeRows[rows[i]] & rowBit) === 0) {
+                    loCount++;
+                }
+            }
+            const loRows = new Int32Array(loCount);
+            const hiRows = new Int32Array(rows.length - loCount);
+            let loIndex = 0;
+            let hiIndex = 0;
+            for (let i = 0; i < rows.length; i++) {
+                if ((this.activeRows[rows[i]] & rowBit) === 0) {
+                    loRows[loIndex++] = rows[i];
+                }
+                else {
+                    hiRows[hiIndex++] = rows[i];
+                }
+            }
+            if (!diagram.isTerminal(lo) && loRows.length > 0) {
+                functions.push(lo);
+                rowLists.push(loRows);
+            }
+            if (!diagram.isTerminal(hi) && hiRows.length > 0) {
+                functions.push(hi);
+                rowLists.push(hiRows);
+            }
+        }
+        // merge the groups with equal cofactors
+        const order = functions.map((_fn, index) => index).sort((a, b) => (functions[a] - functions[b]) || (a - b));
+        let totalRows = 0;
+        rowLists.forEach(list => totalRows += list.length);
+        const mergedRows = new Int32Array(totalRows);
+        const groupStart = [0];
+        const groupFunction = [];
+        const groupWeight = [];
+        let position = 0;
+        let weight = 0;
+        for (let i = 0; i < order.length; i++) {
+            const fn = functions[order[i]];
+            const list = rowLists[order[i]];
+            mergedRows.set(list, position);
+            position += list.length;
+            for (let r = 0; r < list.length; r++) {
+                weight += this.activeWeights[list[r]];
+            }
+            if (i + 1 < order.length && functions[order[i + 1]] === fn) {
+                continue;
+            }
+            groupFunction.push(fn);
+            groupStart.push(position);
+            groupWeight.push(weight);
+            weight = 0;
+        }
+        return {
+            rows: mergedRows,
+            groupStart: Int32Array.from(groupStart),
+            groupFunction: Int32Array.from(groupFunction),
+            groupWeight: Float64Array.from(groupWeight)
+        };
+    }
+}
+exports.ExactCostOrderingSearch = ExactCostOrderingSearch;
+//# sourceMappingURL=exact-cost-ordering.js.map

package/dist/cjs/src/ordering/exact-cost-ordering.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"exact-cost-ordering.js","sourceRoot":"","sources":["../../../../src/ordering/exact-cost-ordering.ts"],"names":[],"mappings":";;;AACA,iEAAyD;AACzD,mEAAgG;AAChG,2DAAsH;AA0DtH;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAa,uBAAuB;IAYX;IACA;IAZJ,OAAO,CAAgB;IACvB,CAAC,CAAS;IAC3B,kEAAkE;IACjD,UAAU,CAAa;IACvB,aAAa,CAAe;IAC5B,WAAW,CAAS;IACrC,gGAAgG;IAC/E,eAAe,CAAe;IAC9B,KAAK,CAAe;IAErC,YACqB,KAAsB,EACtB,SAAoB,EACrC,UAAwC,EAAE;QAFzB,UAAK,GAAL,KAAK,CAAiB;QACtB,cAAS,GAAT,SAAS,CAAW;QAGrC,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,qHAAqH,CAAC,CAAC;QAC3I,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,IAAI,iCAAa,CAC5B,KAAK,EACL,OAAO,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,6CAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAC9F,CAAC;QACF,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,aAAa,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,aAAa,CAAC;QACrC,MAAM,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;QACxC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC;YAC5C,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,WAAW,EAAE,CAAC;YAClB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAC;QAC9C,IAAI,CAAC,aAAa,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC;YAC5C,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;gBAC7B,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;gBAC5C,KAAK,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;gBACzB,KAAK,EAAE,CAAC;YACZ,CAAC;QACL,CAAC;QACD,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QACzB,IAAI,CAAC,eAAe,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAClC,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;oBAC9B,MAAM,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBACpC,CAAC;YACL,CAAC;YACD,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACrC,CAAC;IACL,CAAC;IAEM,iBAAiB,CAAC,QAA2B;QAChD,OAAO,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IACpD,CAAC;IAEM,GAAG,CAAC,UAAoC,EAAE;QAC7C,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;QACnD,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;QAC3F,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;QACpG,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QAClC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,UAAU,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC;QACjD,yFAAyF;QACzF,MAAM,IAAI,GAAG,IAAA,gCAAQ,EAAC,IAAI,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC;QAC9C,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,IAAA,qCAAa,EAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAChE;;;WAGG;QACH,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QAEhG,sFAAsF;QACtF,IAAI,UAAU,GAAG,OAAO,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1F,IAAI,SAAS,GAAoB,IAAI,CAAC;QACtC,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC7B,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;YAC/D,MAAM,aAAa,GAAG,IAAI,yCAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;YACjH,IAAI,aAAa,IAAI,cAAc,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC9C,SAAS,GAAG,IAAI,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACJ,UAAU,GAAG,aAAa,CAAC;YAC/B,CAAC;QACL,CAAC;QACD,MAAM,SAAS,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,CACX,MAAe,EACf,QAAyB,EACzB,IAAY,EACZ,cAAsB,EACtB,cAAsB,EACC,EAAE,CAAC,CAAC;YAC3B,MAAM;YACN,QAAQ;YACR,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,UAAU,EAAE,cAAc;YAC1B,SAAS,EAAE,cAAc;SAC5B,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;YACrB,GAAG,CAAC,4CAA4C,CAAC,CAAC;YAClD,OAAO,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,8EAA8E;YAC9E,MAAM,QAAQ,GAAG,IAAA,sCAAe,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1F,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACxC,IAAI,IAAI,IAAI,SAAS,EAAE,CAAC;gBACpB,OAAO,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrD,CAAC;YACD,OAAO,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,MAAM,GAA6B,IAAI,GAAG,EAAE,CAAC;QACnD,MAAM,QAAQ,GAAwB,IAAI,GAAG,EAAE,CAAC;QAChD,MAAM,cAAc,GAAwB,IAAI,GAAG,EAAE,CAAC;QACtD,MAAM,MAAM,GAAgB,IAAI,GAAG,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,6BAAS,EAAE,CAAC;QAE7B,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,UAAU,GAAgB;YAC5B,IAAI,EAAE,SAAS;YACf,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC;YAC9C,aAAa,EAAE,UAAU,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;YAC5C,WAAW,EAAE,YAAY,CAAC,EAAE,CAAC,KAAK,CAAC;SACtC,CAAC;QACF,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC1B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAElC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC;YACL,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACzB,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC;gBAC/B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;gBAC5B,IAAI,WAAW,KAAK,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC7D,SAAS;gBACb,CAAC;gBACD,IAAI,KAAK,CAAC,QAAQ,IAAI,SAAS,EAAE,CAAC;oBAC9B,MAAM;gBACV,CAAC;gBACD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;oBAClB,SAAS,GAAG,MAAM,CAAC;oBACnB,UAAU,GAAG,WAAW,CAAC;oBACzB,MAAM;gBACV,CAAC;gBACD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACnB,UAAU,EAAE,CAAC;gBACb,IAAI,UAAU,GAAG,aAAa,EAAE,CAAC;oBAC7B,GAAG,CAAC,8CAA8C,CAAC,CAAC;oBACpD,OAAO,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;gBACvE,CAAC;gBACD,IAAI,UAAU,GAAG,aAAa,EAAE,CAAC;oBAC7B,GAAG,CAAC,2CAA2C,CAAC,CAAC;oBACjD,OAAO,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;gBACvE,CAAC;gBACD,IAAI,UAAU,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;oBAC3B,GAAG,CAAC,qBAAqB,GAAG,UAAU,GAAG,oBAAoB,GAAG,SAAS,GAAG,cAAc,GAAG,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC;gBACtH,CAAC;gBAED,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAgB,CAAC;gBAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzB,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;oBACnB,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;wBACvB,SAAS;oBACb,CAAC;oBACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;oBAC7B,MAAM,UAAU,GAAG,MAAM,GAAG,GAAG,CAAC;oBAChC,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;oBACjF,MAAM,QAAQ,GAAG,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,YAAY,CAAC;oBAC9D,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBAC3C,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,IAAI,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACzE,SAAS;oBACb,CAAC;oBACD,MAAM,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;oBACtD,IAAI,QAAQ,IAAI,SAAS,EAAE,CAAC;wBACxB,SAAS;oBACb,CAAC;oBACD,yEAAyE;oBACzE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAChD,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;wBAC7B,SAAS,EAAE,CAAC;wBACZ,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;oBACnC,CAAC;oBACD,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;oBACnC,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;oBACzC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;gBAC9C,CAAC;YACL,CAAC;QACD,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACX,IAAI,GAAG,YAAY,8CAA0B,EAAE,CAAC;gBAC5C,GAAG,CAAC,4CAA4C,CAAC,CAAC;gBAClD,OAAO,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;YACvE,CAAC;YACD,MAAM,GAAG,CAAC;QACd,CAAC;QAED,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;YACnB,OAAO,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;QACtE,CAAC;QAED,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,eAAe,GAAG,SAAS,CAAC;QAChC,OAAO,eAAe,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,eAAe,CAAW,CAAC;YAC/D,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACxB,eAAe,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;IAClG,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,MAAc;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACvC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;YACtE,CAAC;QACL,CAAC;QACD,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,OAAoB,EAAE,QAAgB;QACvD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5D,YAAY,IAAI,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;QACL,CAAC;QACD,OAAO,YAAY,CAAC;IACxB,CAAC;IAED;;;OAGG;IACK,UAAU,CAAC,OAAoB,EAAE,QAAgB;QACrD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC;QAChD,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC/C,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC;gBACnC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,SAAS;YACb,CAAC;YACD,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC5C,OAAO,EAAE,CAAC;gBACd,CAAC;YACL,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;YACrD,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC5C,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChC,CAAC;qBAAM,CAAC;oBACJ,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChC,CAAC;YACL,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/C,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/C,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;QAED,wCAAwC;QACxC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5G,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAa,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC/B,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;gBACzD,SAAS;YACb,CAAC;YACD,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzB,MAAM,GAAG,CAAC,CAAC;QACf,CAAC;QACD,OAAO;YACH,IAAI,EAAE,UAAU;YAChB,UAAU,EAAE,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC;YACvC,aAAa,EAAE,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC;YAC7C,WAAW,EAAE,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC;SAC9C,CAAC;IACN,CAAC;CACJ;AAzVD,0DAyVC"}

package/dist/cjs/src/ordering/exact-ordering.d.ts

@@ -0,0 +1,89 @@
+import type { DenseTruthTable } from './dense-truth-table.js';
+export interface ExactOrderingOptions {
+    /**
+     * The search stops without a proof when more states were expanded.
+     * Default: 200000
+     */
+    maxExpansions?: number;
+    /**
+     * The search stops without a proof when the stored cofactor sets
+     * contain more entries in total (memory protection).
+     * Default: 2^25
+     */
+    maxCofactorEntries?: number;
+    /**
+     * A known good ordering. Its size is used as upper bound to prune the search,
+     * which makes the search much faster when the ordering is already close to optimal.
+     */
+    upperBoundOrdering?: ArrayLike<number>;
+    /**
+     * Only orderings with fewer internal nodes than this are searched for.
+     */
+    upperBound?: number;
+    log?: (message: string) => void;
+}
+export interface ExactOrderingResult {
+    /**
+     * true when it is proven that no ordering has fewer internal nodes
+     * than the returned one (or than the upper bound, when ordering is null)
+     */
+    solved: boolean;
+    /**
+     * The best ordering that was found. Irrelevant boolean functions
+     * are always at the bottom. null when no ordering below the numeric
+     * upper bound exists and the upperBoundOrdering (if given) is not
+     * below it either.
+     */
+    ordering: number[] | null;
+    /** amount of internal (non-leaf) nodes of `ordering`, -1 when ordering is null */
+    internalNodeCount: number;
+    /** amount of expanded states */
+    expansions: number;
+    /** amount of generated states */
+    generated: number;
+}
+/**
+ * The number of nodes on a level of a reduced BDD only depends on the SET of
+ * variables above that level, not on their order (Friedman & Supowit, 1990):
+ * it is the amount of distinct cofactors with respect to that set that still
+ * depend on the level's variable.
+ *
+ * Therefore the optimal ordering is a shortest path through the lattice of
+ * variable subsets, from the empty set to the full set, where the edge
+ * S -> S + {x} costs the amount of nodes that test x when exactly the
+ * variables of S are above it.
+ *
+ * This class finds that shortest path with an A* search. Each subset S is
+ * represented by the set of its distinct non-constant cofactors, which are
+ * nodes of one shared hash-consed diagram in the natural variable order
+ * (so equal functions always have equal ids). The admissible estimate for the
+ * remaining cost of a subset is the amount of its distinct non-constant
+ * cofactors: each of them needs its own node below.
+ *
+ * With a good upper bound (from the local search) the search typically only
+ * has to look at a tiny fraction of the 2^n subsets.
+ */
+export declare class ExactOrderingSearch {
+    private readonly table;
+    private readonly diagram;
+    private readonly n;
+    private readonly terminalCount;
+    constructor(table: DenseTruthTable, options?: {
+        maxDiagramNodes?: number;
+    });
+    /**
+     * Moves the boolean functions the truth table does not depend on
+     * to the bottom. This never changes the amount of internal nodes
+     * but ensures the root node tests a relevant boolean function.
+     */
+    normalizeOrdering(ordering: ArrayLike<number>): number[];
+    run(options?: ExactOrderingOptions): ExactOrderingResult;
+    /**
+     * lower bound for the amount of nodes below the given subset
+     */
+    private estimate;
+    /**
+     * the distinct non-constant cofactors after additionally fixing `variable`
+     */
+    private cofactorsAfter;
+}