@stevenvo780/st-lang 4.5.0 → 4.5.2

package/dist/bdd/manager.js

@@ -0,0 +1,524 @@
+"use strict";
+// ============================================================
+// ROBDD — Manager con unique table + apply algorithm
+// ============================================================
+//
+// Implementación clásica de Bryant (1986):
+//   - Unique table: garantiza canonicidad estructural
+//   - Apply: combinador genérico para AND/OR/XOR/... con memoización
+//   - ITE (If-Then-Else): operador universal, reduce las binarias
+//   - Quantificadores ∃/∀ implementados sobre apply
+//   - Sat counting con bigint para evitar overflow en >53 vars
+//
+// Convención: el orden de variables se respeta en todo el DAG.
+// Si en una rama la variable de un hijo tiene índice de orden <=
+// que el padre, hay un bug — el invariante de "ordered" se mantiene
+// porque apply siempre desciende por la variable de menor orden.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BDDManager = void 0;
+const types_1 = require("./types");
+// Clave para unique table: variable + ids de hijos.
+// Para terminales usamos 'T'/'F' como id especial.
+function keyOf(variable, low, high) {
+    const lid = low.kind === 'terminal' ? (low.value ? 'T' : 'F') : `N${low.id}`;
+    const hid = high.kind === 'terminal' ? (high.value ? 'T' : 'F') : `N${high.id}`;
+    return `${variable}|${lid}|${hid}`;
+}
+function applyKey(op, a, b) {
+    const aid = a.kind === 'terminal' ? (a.value ? 'T' : 'F') : `N${a.id}`;
+    const bid = b.kind === 'terminal' ? (b.value ? 'T' : 'F') : `N${b.id}`;
+    return `${op}|${aid}|${bid}`;
+}
+function iteKey(c, t, e) {
+    const cid = c.kind === 'terminal' ? (c.value ? 'T' : 'F') : `N${c.id}`;
+    const tid = t.kind === 'terminal' ? (t.value ? 'T' : 'F') : `N${t.id}`;
+    const eid = e.kind === 'terminal' ? (e.value ? 'T' : 'F') : `N${e.id}`;
+    return `${cid}|${tid}|${eid}`;
+}
+class BDDManager {
+    numVars;
+    TRUE = { kind: 'terminal', value: true };
+    FALSE = { kind: 'terminal', value: false };
+    uniqueTable = new Map();
+    nextId = 1;
+    reductions = 0;
+    // memo caches per binary op + ite
+    memoAnd = new Map();
+    memoOr = new Map();
+    memoXor = new Map();
+    memoIte = new Map();
+    memoNot = new Map();
+    varOrder;
+    constructor(numVars) {
+        this.numVars = numVars;
+        if (numVars < 0)
+            throw new Error('BDDManager: numVars must be >= 0');
+        this.varOrder = Array.from({ length: numVars }, (_, i) => i);
+    }
+    // ----------------------------------------------------------
+    // Orden de variables
+    // ----------------------------------------------------------
+    /**
+     * Cambia el orden global de variables. Invalida memo caches porque
+     * el orden afecta la estructura de los nodos. NO reordena nodos ya
+     * construidos — si los reutilizas tras setVarOrder pueden quedar
+     * inconsistentes; recomendado para sesiones nuevas.
+     */
+    setVarOrder(order) {
+        if (order.length !== this.numVars) {
+            throw new Error(`setVarOrder: expected ${this.numVars} vars, got ${order.length}`);
+        }
+        const seen = new Set();
+        for (const v of order) {
+            if (v < 0 || v >= this.numVars) {
+                throw new Error(`setVarOrder: variable ${v} out of range`);
+            }
+            if (seen.has(v))
+                throw new Error(`setVarOrder: variable ${v} repeated`);
+            seen.add(v);
+        }
+        this.varOrder = [...order];
+        this.uniqueTable.clear();
+        this.memoAnd.clear();
+        this.memoOr.clear();
+        this.memoXor.clear();
+        this.memoIte.clear();
+        this.memoNot.clear();
+        this.nextId = 1;
+    }
+    /** Posición de la variable v dentro del orden actual (0 = top). */
+    orderPos(v) {
+        return this.varOrder.indexOf(v);
+    }
+    /** Devuelve la variable "top" de un nodo o +∞ si es terminal. */
+    topVarPos(b) {
+        if ((0, types_1.isTerminal)(b))
+            return Number.POSITIVE_INFINITY;
+        return this.orderPos(b.variable);
+    }
+    // ----------------------------------------------------------
+    // Constructores básicos
+    // ----------------------------------------------------------
+    true_() {
+        return this.TRUE;
+    }
+    false_() {
+        return this.FALSE;
+    }
+    /**
+     * Crea/recupera un nodo interno con reducción (R1) + (R2).
+     */
+    makeNode(variable, low, high) {
+        if (low === high) {
+            // R1: eliminación
+            this.reductions++;
+            return low;
+        }
+        const key = keyOf(variable, low, high);
+        const existing = this.uniqueTable.get(key);
+        if (existing) {
+            this.reductions++;
+            return existing;
+        }
+        const node = {
+            kind: 'internal',
+            variable,
+            low,
+            high,
+            id: this.nextId++,
+        };
+        this.uniqueTable.set(key, node);
+        return node;
+    }
+    /** BDD de la variable i: nodo (i, FALSE, TRUE). */
+    variable(i) {
+        if (i < 0 || i >= this.numVars) {
+            throw new Error(`variable(${i}): out of range 0..${this.numVars - 1}`);
+        }
+        return this.makeNode(i, this.FALSE, this.TRUE);
+    }
+    // ----------------------------------------------------------
+    // Operaciones
+    // ----------------------------------------------------------
+    /**
+     * Negación: implementada como ITE(b, FALSE, TRUE).
+     * Con memo dedicado para evitar recomputación.
+     */
+    not_(b) {
+        if ((0, types_1.isTerminal)(b)) {
+            return b.value ? this.FALSE : this.TRUE;
+        }
+        const key = `N${b.id}`;
+        const cached = this.memoNot.get(key);
+        if (cached)
+            return cached;
+        const result = this.makeNode(b.variable, this.not_(b.low), this.not_(b.high));
+        this.memoNot.set(key, result);
+        return result;
+    }
+    and_(a, b) {
+        return this.applyOp('and', a, b);
+    }
+    or_(a, b) {
+        return this.applyOp('or', a, b);
+    }
+    xor(a, b) {
+        return this.applyOp('xor', a, b);
+    }
+    /** A → B ≡ ¬A ∨ B */
+    implies(a, b) {
+        return this.or_(this.not_(a), b);
+    }
+    /** A ↔ B ≡ ¬(A ⊕ B) */
+    iff(a, b) {
+        return this.not_(this.xor(a, b));
+    }
+    /**
+     * If-Then-Else canónico: ite(c, t, e).
+     * Equivale a (c ∧ t) ∨ (¬c ∧ e). Implementado con descomposición
+     * Shannon directa para mejor caché.
+     */
+    ite(cond, thenB, elseB) {
+        // Casos base por terminales
+        if ((0, types_1.isTerminal)(cond))
+            return cond.value ? thenB : elseB;
+        if (thenB === elseB)
+            return thenB;
+        if ((0, types_1.isTerminal)(thenB) && (0, types_1.isTerminal)(elseB)) {
+            if (thenB.value && !elseB.value)
+                return cond;
+            if (!thenB.value && elseB.value)
+                return this.not_(cond);
+        }
+        const key = iteKey(cond, thenB, elseB);
+        const cached = this.memoIte.get(key);
+        if (cached)
+            return cached;
+        // Variable top: la de menor posición entre las tres
+        const pc = this.topVarPos(cond);
+        const pt = this.topVarPos(thenB);
+        const pe = this.topVarPos(elseB);
+        const top = Math.min(pc, pt, pe);
+        const v = this.varOrder[top];
+        const condLow = this.cofactor(cond, v, false);
+        const condHigh = this.cofactor(cond, v, true);
+        const thenLow = this.cofactor(thenB, v, false);
+        const thenHigh = this.cofactor(thenB, v, true);
+        const elseLow = this.cofactor(elseB, v, false);
+        const elseHigh = this.cofactor(elseB, v, true);
+        const low = this.ite(condLow, thenLow, elseLow);
+        const high = this.ite(condHigh, thenHigh, elseHigh);
+        const result = this.makeNode(v, low, high);
+        this.memoIte.set(key, result);
+        return result;
+    }
+    /**
+     * Cofactor de b respecto a (variable v = val).
+     * Si v no aparece o aparece más profundo, retorna b sin cambios.
+     */
+    cofactor(b, v, val) {
+        if ((0, types_1.isTerminal)(b))
+            return b;
+        const pb = this.orderPos(b.variable);
+        const pv = this.orderPos(v);
+        if (pb > pv)
+            return b; // v viene antes que b.variable en el orden → b no depende
+        if (b.variable === v) {
+            return val ? b.high : b.low;
+        }
+        // pb < pv: b depende de algo más alto; descender
+        const low = this.cofactor(b.low, v, val);
+        const high = this.cofactor(b.high, v, val);
+        return this.makeNode(b.variable, low, high);
+    }
+    /**
+     * Apply algorithm de Bryant — combinador binario con memoization.
+     * Maneja AND, OR, XOR (los más usados); el resto se deriva.
+     */
+    applyOp(op, a, b) {
+        // Terminales
+        const term = this.applyTerminal(op, a, b);
+        if (term)
+            return term;
+        const memo = this.memoFor(op);
+        const key = applyKey(op, a, b);
+        const cached = memo.get(key);
+        if (cached)
+            return cached;
+        // Variable top
+        const pa = this.topVarPos(a);
+        const pb = this.topVarPos(b);
+        const top = Math.min(pa, pb);
+        const v = this.varOrder[top];
+        const aLow = this.cofactor(a, v, false);
+        const aHigh = this.cofactor(a, v, true);
+        const bLow = this.cofactor(b, v, false);
+        const bHigh = this.cofactor(b, v, true);
+        const low = this.applyOp(op, aLow, bLow);
+        const high = this.applyOp(op, aHigh, bHigh);
+        const result = this.makeNode(v, low, high);
+        memo.set(key, result);
+        return result;
+    }
+    memoFor(op) {
+        if (op === 'and')
+            return this.memoAnd;
+        if (op === 'or')
+            return this.memoOr;
+        return this.memoXor;
+    }
+    applyTerminal(op, a, b) {
+        // Cortocircuitos
+        if (op === 'and') {
+            if (a === this.FALSE || b === this.FALSE)
+                return this.FALSE;
+            if (a === this.TRUE)
+                return b;
+            if (b === this.TRUE)
+                return a;
+            if (a === b)
+                return a;
+        }
+        else if (op === 'or') {
+            if (a === this.TRUE || b === this.TRUE)
+                return this.TRUE;
+            if (a === this.FALSE)
+                return b;
+            if (b === this.FALSE)
+                return a;
+            if (a === b)
+                return a;
+        }
+        else {
+            // xor
+            if (a === this.FALSE)
+                return b;
+            if (b === this.FALSE)
+                return a;
+            if (a === this.TRUE)
+                return this.not_(b);
+            if (b === this.TRUE)
+                return this.not_(a);
+            if (a === b)
+                return this.FALSE;
+        }
+        if ((0, types_1.isTerminal)(a) && (0, types_1.isTerminal)(b)) {
+            const av = a.value;
+            const bv = b.value;
+            let r;
+            if (op === 'and')
+                r = av && bv;
+            else if (op === 'or')
+                r = av || bv;
+            else
+                r = av !== bv;
+            return r ? this.TRUE : this.FALSE;
+        }
+        return undefined;
+    }
+    // ----------------------------------------------------------
+    // Cuantificadores
+    // ----------------------------------------------------------
+    /** ∃v. b ≡ b[v:=0] ∨ b[v:=1] */
+    exists(v, b) {
+        if (v < 0 || v >= this.numVars)
+            throw new Error(`exists: var ${v} out of range`);
+        const c0 = this.cofactor(b, v, false);
+        const c1 = this.cofactor(b, v, true);
+        return this.or_(c0, c1);
+    }
+    /** ∀v. b ≡ b[v:=0] ∧ b[v:=1] */
+    forall(v, b) {
+        if (v < 0 || v >= this.numVars)
+            throw new Error(`forall: var ${v} out of range`);
+        const c0 = this.cofactor(b, v, false);
+        const c1 = this.cofactor(b, v, true);
+        return this.and_(c0, c1);
+    }
+    // ----------------------------------------------------------
+    // Queries
+    // ----------------------------------------------------------
+    /**
+     * Cuenta el número de asignaciones satisfactorias sobre `numVars`.
+     * Usa bigint para soportar funciones con muchas variables.
+     */
+    satCount(b) {
+        return this.satCountAt(b, 0);
+    }
+    /**
+     * Conteo con "skip" de variables ausentes en la rama:
+     * cada variable saltada multiplica por 2.
+     */
+    satCountAt(b, depth) {
+        if ((0, types_1.isTerminal)(b)) {
+            if (!b.value)
+                return 0n;
+            // Todas las variables restantes son libres: 2^(numVars - depth)
+            const skipped = BigInt(this.numVars - depth);
+            return 1n << skipped;
+        }
+        const pos = this.orderPos(b.variable);
+        // Variables entre depth y pos están skipped → 2^(pos - depth)
+        const skipped = BigInt(pos - depth);
+        const factor = 1n << skipped;
+        const low = this.satCountAt(b.low, pos + 1);
+        const high = this.satCountAt(b.high, pos + 1);
+        return factor * (low + high);
+    }
+    isSatisfiable(b) {
+        return b !== this.FALSE;
+    }
+    isValid(b) {
+        return b === this.TRUE;
+    }
+    /**
+     * Equivalencia estructural. Como el manager canonicaliza, basta con
+     * comparar identidad de referencias.
+     */
+    equivalent(a, b) {
+        return a === b;
+    }
+    /**
+     * Evalúa b sobre una asignación `assignment[i] = valor de la var i`.
+     */
+    evaluate(b, assignment) {
+        if (assignment.length < this.numVars) {
+            throw new Error(`evaluate: assignment length ${assignment.length} < numVars ${this.numVars}`);
+        }
+        let cur = b;
+        while (!(0, types_1.isTerminal)(cur)) {
+            const v = cur.variable;
+            const val = assignment[v];
+            if (val === undefined) {
+                throw new Error(`evaluate: missing assignment for var ${v}`);
+            }
+            cur = val ? cur.high : cur.low;
+        }
+        return cur.value;
+    }
+    // ----------------------------------------------------------
+    // Conversión desde CNF / fórmulas
+    // ----------------------------------------------------------
+    /**
+     * Construye un BDD desde CNF. Cada clausula es un array de literales
+     * en la convención DIMACS:
+     *   - literal i > 0  →  variable (i-1) positiva
+     *   - literal i < 0  →  variable (-i-1) negada
+     * El resultado es el AND de las disyunciones de cada clausula.
+     *
+     * Optimización: ordena clausulas por longitud creciente para que la
+     * unidad de propagación temprana mantenga el BDD pequeño.
+     */
+    fromCNF(clauses) {
+        if (clauses.length === 0)
+            return this.TRUE;
+        // Validación de literales
+        for (const cl of clauses) {
+            for (const lit of cl) {
+                if (lit === 0)
+                    throw new Error('fromCNF: literal 0 not allowed (DIMACS)');
+                const v = Math.abs(lit) - 1;
+                if (v >= this.numVars) {
+                    throw new Error(`fromCNF: literal ${lit} exceeds numVars ${this.numVars}`);
+                }
+            }
+        }
+        // Ordenar clausulas: cortas primero (más restrictivas)
+        const ordered = [...clauses].sort((a, b) => a.length - b.length);
+        let acc = this.TRUE;
+        for (const clause of ordered) {
+            let disj = this.FALSE;
+            for (const lit of clause) {
+                const v = Math.abs(lit) - 1;
+                const x = this.variable(v);
+                const litBdd = lit > 0 ? x : this.not_(x);
+                disj = this.or_(disj, litBdd);
+            }
+            acc = this.and_(acc, disj);
+            if (acc === this.FALSE)
+                return acc; // cortocircuito UNSAT
+        }
+        return acc;
+    }
+    /**
+     * Construye un BDD desde una fórmula simbólica con sintaxis libre.
+     * Soporta: `{ kind: 'var', index: number }`, `{ kind: 'true' }`,
+     * `{ kind: 'false' }`, `{ kind: 'not', child }`,
+     * `{ kind: 'and'|'or'|'xor'|'implies'|'iff', left, right }`,
+     * `{ kind: 'ite', cond, then, else }`.
+     *
+     * Si llega algo no reconocido lanza error — el formato es estricto
+     * para evitar `any` silenciosos.
+     */
+    fromFormula(formula) {
+        const k = formula.kind;
+        if (k === 'true')
+            return this.TRUE;
+        if (k === 'false')
+            return this.FALSE;
+        if (k === 'var') {
+            const idx = formula.index;
+            if (typeof idx !== 'number')
+                throw new Error('fromFormula: var.index must be number');
+            return this.variable(idx);
+        }
+        if (k === 'not') {
+            const child = formula.child;
+            return this.not_(this.fromFormula(child));
+        }
+        if (k === 'and' || k === 'or' || k === 'xor' || k === 'implies' || k === 'iff') {
+            const left = formula.left;
+            const right = formula.right;
+            const L = this.fromFormula(left);
+            const R = this.fromFormula(right);
+            if (k === 'and')
+                return this.and_(L, R);
+            if (k === 'or')
+                return this.or_(L, R);
+            if (k === 'xor')
+                return this.xor(L, R);
+            if (k === 'implies')
+                return this.implies(L, R);
+            return this.iff(L, R);
+        }
+        if (k === 'ite') {
+            const c = formula.cond;
+            const t = formula.then;
+            const e = formula.else;
+            return this.ite(this.fromFormula(c), this.fromFormula(t), this.fromFormula(e));
+        }
+        throw new Error(`fromFormula: unknown kind "${k}"`);
+    }
+    // ----------------------------------------------------------
+    // Stats / introspección
+    // ----------------------------------------------------------
+    stats() {
+        return {
+            nodes: this.uniqueTable.size,
+            reductions: this.reductions,
+        };
+    }
+    /**
+     * Cuenta los nodos alcanzables desde `b` (sin contar terminales).
+     * Útil para comparar tamaños bajo distintos órdenes de variables.
+     */
+    countReachable(b) {
+        const seen = new Set();
+        const stack = [b];
+        while (stack.length > 0) {
+            const cur = stack.pop();
+            if (cur === undefined)
+                break;
+            if ((0, types_1.isTerminal)(cur))
+                continue;
+            if (seen.has(cur.id))
+                continue;
+            seen.add(cur.id);
+            stack.push(cur.low);
+            stack.push(cur.high);
+        }
+        return seen.size;
+    }
+}
+exports.BDDManager = BDDManager;
+//# sourceMappingURL=manager.js.map

package/dist/bdd/manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"manager.js","sourceRoot":"","sources":["../../src/bdd/manager.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qDAAqD;AACrD,+DAA+D;AAC/D,EAAE;AACF,2CAA2C;AAC3C,sDAAsD;AACtD,qEAAqE;AACrE,kEAAkE;AAClE,oDAAoD;AACpD,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,iEAAiE;AACjE,oEAAoE;AACpE,iEAAiE;;;AAGjE,mCAAqC;AAIrC,oDAAoD;AACpD,mDAAmD;AACnD,SAAS,KAAK,CAAC,QAAgB,EAAE,GAAY,EAAE,IAAa;IAC1D,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC;IAC7E,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;IAChF,OAAO,GAAG,QAAQ,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;AACrC,CAAC;AAED,SAAS,QAAQ,CAAC,EAAU,EAAE,CAAU,EAAE,CAAU;IAClD,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;IACvE,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;IACvE,OAAO,GAAG,EAAE,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;AAC/B,CAAC;AAED,SAAS,MAAM,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU;IAChD,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;IACvE,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;IACvE,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;IACvE,OAAO,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;AAChC,CAAC;AAED,MAAa,UAAU;IAiBF;IAhBF,IAAI,GAAY,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAClD,KAAK,GAAY,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAE7D,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC9C,MAAM,GAAG,CAAC,CAAC;IACX,UAAU,GAAG,CAAC,CAAC;IAEvB,kCAAkC;IAC1B,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IACrC,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;IACpC,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IACrC,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IACrC,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAE7C,QAAQ,CAAW;IAEnB,YAAmB,OAAe;QAAf,YAAO,GAAP,OAAO,CAAQ;QAChC,IAAI,OAAO,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACrE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,6DAA6D;IAC7D,qBAAqB;IACrB,6DAA6D;IAE7D;;;;;OAKG;IACH,WAAW,CAAC,KAAe;QACzB,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,yBAAyB,IAAI,CAAC,OAAO,cAAc,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QACrF,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,eAAe,CAAC,CAAC;YAC7D,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,WAAW,CAAC,CAAC;YACxE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,mEAAmE;IAC3D,QAAQ,CAAC,CAAS;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,iEAAiE;IACzD,SAAS,CAAC,CAAU;QAC1B,IAAI,IAAA,kBAAU,EAAC,CAAC,CAAC;YAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC;QACnD,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED,6DAA6D;IAC7D,wBAAwB;IACxB,6DAA6D;IAE7D,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,QAAgB,EAAE,GAAY,EAAE,IAAa;QAC5D,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YACjB,kBAAkB;YAClB,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,OAAO,GAAG,CAAC;QACb,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3C,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,MAAM,IAAI,GAAiB;YACzB,IAAI,EAAE,UAAU;YAChB,QAAQ;YACR,GAAG;YACH,IAAI;YACJ,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE;SAClB,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mDAAmD;IACnD,QAAQ,CAAC,CAAS;QAChB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,sBAAsB,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,6DAA6D;IAC7D,cAAc;IACd,6DAA6D;IAE7D;;;OAGG;IACH,IAAI,CAAC,CAAU;QACb,IAAI,IAAA,kBAAU,EAAC,CAAC,CAAC,EAAE,CAAC;YAClB,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAC1C,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9E,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC9B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,CAAC,CAAU,EAAE,CAAU;QACzB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,GAAG,CAAC,CAAU,EAAE,CAAU;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,CAAU,EAAE,CAAU;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,qBAAqB;IACrB,OAAO,CAAC,CAAU,EAAE,CAAU;QAC5B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,uBAAuB;IACvB,GAAG,CAAC,CAAU,EAAE,CAAU;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,IAAa,EAAE,KAAc,EAAE,KAAc;QAC/C,4BAA4B;QAC5B,IAAI,IAAA,kBAAU,EAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACxD,IAAI,KAAK,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QAClC,IAAI,IAAA,kBAAU,EAAC,KAAK,CAAC,IAAI,IAAA,kBAAU,EAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;QAED,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAE1B,oDAAoD;QACpD,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAE7B,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAE/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAE3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC9B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,QAAQ,CAAC,CAAU,EAAE,CAAS,EAAE,GAAY;QAClD,IAAI,IAAA,kBAAU,EAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,GAAG,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,0DAA0D;QACjF,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9B,CAAC;QACD,iDAAiD;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED;;;OAGG;IACK,OAAO,CAAC,EAAwB,EAAE,CAAU,EAAE,CAAU;QAC9D,aAAa;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;QAEtB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAE1B,eAAe;QACf,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAExC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAE3C,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,OAAO,CAAC,EAAwB;QACtC,IAAI,EAAE,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC;QACtC,IAAI,EAAE,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC;QACpC,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAEO,aAAa,CAAC,EAAwB,EAAE,CAAU,EAAE,CAAU;QACpE,iBAAiB;QACjB,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC;YAC5D,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YACzD,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM;YACN,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC;QACjC,CAAC;QAED,IAAI,IAAA,kBAAU,EAAC,CAAC,CAAC,IAAI,IAAA,kBAAU,EAAC,CAAC,CAAC,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC;YACnB,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC;YACnB,IAAI,CAAU,CAAC;YACf,IAAI,EAAE,KAAK,KAAK;gBAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;iBAC1B,IAAI,EAAE,KAAK,IAAI;gBAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;;gBAC9B,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QACpC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,6DAA6D;IAC7D,kBAAkB;IAClB,6DAA6D;IAE7D,gCAAgC;IAChC,MAAM,CAAC,CAAS,EAAE,CAAU;QAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,eAAe,CAAC,CAAC;QACjF,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1B,CAAC;IAED,gCAAgC;IAChC,MAAM,CAAC,CAAS,EAAE,CAAU;QAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,eAAe,CAAC,CAAC;QACjF,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,6DAA6D;IAC7D,UAAU;IACV,6DAA6D;IAE7D;;;OAGG;IACH,QAAQ,CAAC,CAAU;QACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACK,UAAU,CAAC,CAAU,EAAE,KAAa;QAC1C,IAAI,IAAA,kBAAU,EAAC,CAAC,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,CAAC,CAAC,KAAK;gBAAE,OAAO,EAAE,CAAC;YACxB,gEAAgE;YAChE,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC;YAC7C,OAAO,EAAE,IAAI,OAAO,CAAC;QACvB,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACtC,8DAA8D;QAC9D,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,EAAE,IAAI,OAAO,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAC9C,OAAO,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,aAAa,CAAC,CAAU;QACtB,OAAO,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC;IAC1B,CAAC;IAED,OAAO,CAAC,CAAU;QAChB,OAAO,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,CAAU,EAAE,CAAU;QAC/B,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,CAAU,EAAE,UAAqB;QACxC,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,+BAA+B,UAAU,CAAC,MAAM,cAAc,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAChG,CAAC;QACD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,CAAC,IAAA,kBAAU,EAAC,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC;YACvB,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,EAAE,CAAC,CAAC;YAC/D,CAAC;YACD,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QACjC,CAAC;QACD,OAAO,GAAG,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,6DAA6D;IAC7D,kCAAkC;IAClC,6DAA6D;IAE7D;;;;;;;;;OASG;IACH,OAAO,CAAC,OAAmB;QACzB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC;QAC3C,0BAA0B;QAC1B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,KAAK,MAAM,GAAG,IAAI,EAAE,EAAE,CAAC;gBACrB,IAAI,GAAG,KAAK,CAAC;oBAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;gBAC1E,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5B,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACtB,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,oBAAoB,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;gBAC7E,CAAC;YACH,CAAC;QACH,CAAC;QACD,uDAAuD;QACvD,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QACjE,IAAI,GAAG,GAAY,IAAI,CAAC,IAAI,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,IAAI,GAAY,IAAI,CAAC,KAAK,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAChC,CAAC;YACD,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC3B,IAAI,GAAG,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,GAAG,CAAC,CAAC,sBAAsB;QAC5D,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CAAC,OAA+C;QACzD,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnC,IAAI,CAAC,KAAK,OAAO;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC;QACrC,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;YAChB,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,IAAI,OAAO,GAAG,KAAK,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;YACtF,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,OAAO,CAAC,KAA+C,CAAC;YACtE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;YAC/E,MAAM,IAAI,GAAG,OAAO,CAAC,IAA8C,CAAC;YACpE,MAAM,KAAK,GAAG,OAAO,CAAC,KAA+C,CAAC;YACtE,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,KAAK;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,KAAK;gBAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,OAAO,CAAC,IAA8C,CAAC;YACjE,MAAM,CAAC,GAAG,OAAO,CAAC,IAA8C,CAAC;YACjE,MAAM,CAAC,GAAG,OAAO,CAAC,IAA8C,CAAC;YACjE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IAED,6DAA6D;IAC7D,wBAAwB;IACxB,6DAA6D;IAE7D,KAAK;QACH,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;YAC5B,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,CAAU;QACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,KAAK,GAAc,CAAC,CAAC,CAAC,CAAC;QAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACxB,IAAI,GAAG,KAAK,SAAS;gBAAE,MAAM;YAC7B,IAAI,IAAA,kBAAU,EAAC,GAAG,CAAC;gBAAE,SAAS;YAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;CACF;AAreD,gCAqeC"}

package/dist/bdd/types.d.ts

@@ -0,0 +1,20 @@
+export type BDDNode = {
+    kind: 'terminal';
+    value: boolean;
+} | {
+    kind: 'internal';
+    variable: number;
+    low: BDDNode;
+    high: BDDNode;
+    id: number;
+};
+export interface BDDStats {
+    nodes: number;
+    reductions: number;
+}
+export declare function isTerminal(b: BDDNode): b is {
+    kind: 'terminal';
+    value: boolean;
+};
+export declare function nodeId(b: BDDNode): string;
+//# sourceMappingURL=types.d.ts.map

package/dist/bdd/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/bdd/types.ts"],"names":[],"mappings":"AAkBA,MAAM,MAAM,OAAO,GACf;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC;AAEpF,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAEhF;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAEzC"}

package/dist/bdd/types.js

@@ -0,0 +1,28 @@
+"use strict";
+// ============================================================
+// ROBDD — Tipos de nodos
+// ============================================================
+//
+// Un ROBDD (Reduced Ordered Binary Decision Diagram) representa
+// una función booleana como un DAG canónico bajo un orden fijo de
+// variables. Cada nodo interno tiene:
+//   - una variable `variable` (índice según el orden global)
+//   - un sucesor `low` para la asignación variable = 0
+//   - un sucesor `high` para la asignación variable = 1
+//
+// Las hojas son terminales `true` o `false`. La canonicidad se
+// obtiene compartiendo nodos vía unique table y aplicando las
+// reglas de reducción:
+//   (R1) eliminación: si low === high, no se crea nodo interno
+//   (R2) isomorfismo: dos nodos con el mismo (var, low, high)
+//        comparten identidad estructural
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isTerminal = isTerminal;
+exports.nodeId = nodeId;
+function isTerminal(b) {
+    return b.kind === 'terminal';
+}
+function nodeId(b) {
+    return b.kind === 'terminal' ? (b.value ? 'T' : 'F') : `N${b.id}`;
+}
+//# sourceMappingURL=types.js.map

package/dist/bdd/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/bdd/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,kEAAkE;AAClE,sCAAsC;AACtC,6DAA6D;AAC7D,uDAAuD;AACvD,wDAAwD;AACxD,EAAE;AACF,+DAA+D;AAC/D,8DAA8D;AAC9D,uBAAuB;AACvB,+DAA+D;AAC/D,8DAA8D;AAC9D,yCAAyC;;AAWzC,gCAEC;AAED,wBAEC;AAND,SAAgB,UAAU,CAAC,CAAU;IACnC,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC;AAC/B,CAAC;AAED,SAAgB,MAAM,CAAC,CAAU;IAC/B,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;AACpE,CAAC"}

package/dist/game-theory/common-games.d.ts

@@ -0,0 +1,50 @@
+import type { NormalFormGame } from './types';
+/**
+ * Prisoner's dilemma. Estrategias: 0=cooperate, 1=defect.
+ * Pagos típicos (T > R > P > S):
+ *   T=5, R=3, P=1, S=0
+ *
+ *           C       D
+ *      C  (3,3)  (0,5)
+ *      D  (5,0)  (1,1)
+ *
+ * Único Nash: (D, D) con payoff (1, 1).
+ */
+export declare function prisonersDilemma(): NormalFormGame;
+/**
+ * Rock-Paper-Scissors (zero-sum). Estrategias: 0=R, 1=P, 2=S.
+ * Único Nash: (1/3, 1/3, 1/3) por jugador, payoff (0, 0).
+ */
+export declare function rockPaperScissors(): NormalFormGame;
+/**
+ * Battle of the sexes. Dos jugadores prefieren coordinar pero
+ * en cosas distintas. Estrategias: 0=Opera, 1=Football.
+ *
+ *           O       F
+ *      O  (2,1)  (0,0)
+ *      F  (0,0)  (1,2)
+ *
+ * Tres Nash: (O,O), (F,F), mixto.
+ */
+export declare function battleOfSexes(): NormalFormGame;
+/**
+ * Matching pennies (zero-sum). Estrategias: 0=H, 1=T.
+ *
+ *           H        T
+ *      H  ( 1,-1) (-1, 1)
+ *      T  (-1, 1) ( 1,-1)
+ *
+ * Único Nash: (1/2, 1/2).
+ */
+export declare function matchingPennies(): NormalFormGame;
+/**
+ * Coordination "stag hunt". Estrategias: 0=Stag, 1=Hare.
+ *
+ *           S       H
+ *      S  (4,4)  (0,3)
+ *      H  (3,0)  (2,2)
+ *
+ * Nash puros: (S,S) y (H,H); además uno mixto.
+ */
+export declare function stagHunt(): NormalFormGame;
+//# sourceMappingURL=common-games.d.ts.map

package/dist/game-theory/common-games.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"common-games.d.ts","sourceRoot":"","sources":["../../src/game-theory/common-games.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAG9C;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,IAAI,cAAc,CAUjD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,IAAI,cAAc,CAYlD;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,IAAI,cAAc,CAU9C;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,IAAI,cAAc,CAUhD;AAED;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,IAAI,cAAc,CAUzC"}