@stevenvo780/st-lang 4.6.0 → 4.7.0

package/dist/tests/reasoning/markov-logic/markov-logic.test.js

@@ -0,0 +1,349 @@
+"use strict";
+// ============================================================
+// Markov Logic Networks — Tests
+// ============================================================
+//
+// La teoría canónica es la "smoking network" de Richardson & Domingos:
+//
+//   Smokes(x) → Cancer(x)                    w = 1.5
+//   Friends(x, y) ∧ Smokes(x) → Smokes(y)    w = 1.1
+//   Smokes(x)                                w = 0.5   (prior)
+//
+// con un universo de 3 personas (Anna, Bob, Carl). Esa teoría aparece
+// en varios tests con distintos hyperparámetros.
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const markov_logic_1 = require("../../../reasoning/markov-logic");
+// ── Fixtures ─────────────────────────────────────────────────
+const smoking3 = {
+    predicates: [
+        { name: 'Smokes', types: ['Person'] },
+        { name: 'Cancer', types: ['Person'] },
+        { name: 'Friends', types: ['Person', 'Person'] },
+    ],
+    constants: { Person: ['Anna', 'Bob', 'Carl'] },
+    formulas: [
+        { formula: 'Smokes(x) → Cancer(x)', weight: 1.5 },
+        { formula: 'Friends(x, y) ∧ Smokes(x) → Smokes(y)', weight: 1.1 },
+        { formula: 'Smokes(x)', weight: 0.5 },
+    ],
+};
+const smokingSmall = {
+    predicates: [
+        { name: 'Smokes', types: ['Person'] },
+        { name: 'Friends', types: ['Person', 'Person'] },
+    ],
+    constants: { Person: ['Anna', 'Bob'] },
+    formulas: [
+        { formula: 'Friends(x, y) ∧ Smokes(x) → Smokes(y)', weight: 1.5 },
+        { formula: 'Smokes(x)', weight: 0.5 },
+    ],
+};
+// PRNG determinista (mulberry32) para tests reproducibles.
+function makeRng(seed) {
+    let s = seed >>> 0;
+    return () => {
+        s = (s + 0x6d2b79f5) >>> 0;
+        let t = s;
+        t = Math.imul(t ^ (t >>> 15), t | 1);
+        t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+// ── parseFOL ─────────────────────────────────────────────────
+(0, vitest_1.describe)('parseFOL', () => {
+    (0, vitest_1.it)('parsea un átomo simple', () => {
+        const ast = (0, markov_logic_1.parseFOL)('Smokes(x)');
+        (0, vitest_1.expect)(ast).toEqual({ kind: 'atom', predicate: 'Smokes', args: ['x'] });
+    });
+    (0, vitest_1.it)('reconoce variables libres', () => {
+        const ast = (0, markov_logic_1.parseFOL)('Friends(x, y) ∧ Smokes(x) → Smokes(y)');
+        (0, vitest_1.expect)((0, markov_logic_1.freeVariables)(ast)).toEqual(['x', 'y']);
+    });
+    (0, vitest_1.it)('acepta sintaxis ASCII alternativa (&, |, ->, !)', () => {
+        const a = (0, markov_logic_1.parseFOL)('Smokes(x) -> Cancer(x)');
+        const b = (0, markov_logic_1.parseFOL)('Smokes(x) → Cancer(x)');
+        (0, vitest_1.expect)(a).toEqual(b);
+        const c = (0, markov_logic_1.parseFOL)('!Smokes(x) & Cancer(x)');
+        const d = (0, markov_logic_1.parseFOL)('¬Smokes(x) ∧ Cancer(x)');
+        (0, vitest_1.expect)(c).toEqual(d);
+    });
+    (0, vitest_1.it)('respeta precedencia ¬ > ∧ > ∨ > →', () => {
+        // ¬A ∨ B ∧ C  ≡  (¬A) ∨ (B ∧ C)
+        const ast = (0, markov_logic_1.parseFOL)('¬A(x) ∨ B(x) ∧ C(x)');
+        (0, vitest_1.expect)(ast).toEqual({
+            kind: 'or',
+            left: { kind: 'not', arg: { kind: 'atom', predicate: 'A', args: ['x'] } },
+            right: {
+                kind: 'and',
+                left: { kind: 'atom', predicate: 'B', args: ['x'] },
+                right: { kind: 'atom', predicate: 'C', args: ['x'] },
+            },
+        });
+    });
+    (0, vitest_1.it)('falla con error claro ante sintaxis inválida', () => {
+        (0, vitest_1.expect)(() => (0, markov_logic_1.parseFOL)('Smokes(x')).toThrow();
+        (0, vitest_1.expect)(() => (0, markov_logic_1.parseFOL)('∧ Cancer(x)')).toThrow();
+    });
+});
+// ── ground ───────────────────────────────────────────────────
+(0, vitest_1.describe)('ground', () => {
+    (0, vitest_1.it)('produce N² ground formulas para una regla con 2 variables', () => {
+        // Friends(x,y) ∧ Smokes(x) → Smokes(y) sobre n=3 personas → 9 ground formulas.
+        const grounded = (0, markov_logic_1.ground)({
+            ...smoking3,
+            formulas: [{ formula: 'Friends(x, y) ∧ Smokes(x) → Smokes(y)', weight: 1.1 }],
+        });
+        (0, vitest_1.expect)(grounded).toHaveLength(9);
+    });
+    (0, vitest_1.it)('inhibe variables con tipos inconsistentes', () => {
+        const badTheory = {
+            predicates: [
+                { name: 'OnTopic', types: ['Course'] },
+                { name: 'Friends', types: ['Person', 'Person'] },
+            ],
+            constants: { Person: ['A'], Course: ['Math'] },
+            formulas: [{ formula: 'OnTopic(x) ∧ Friends(x, x)', weight: 1.0 }],
+        };
+        (0, vitest_1.expect)(() => (0, markov_logic_1.ground)(badTheory)).toThrow(/tipos distintos/);
+    });
+    (0, vitest_1.it)('enumera todos los ground atoms (Herbrand base)', () => {
+        const atoms = (0, markov_logic_1.allGroundAtoms)(smokingSmall);
+        // Smokes: 2, Friends: 2x2 = 4 → 6 atoms totales.
+        (0, vitest_1.expect)(atoms).toHaveLength(6);
+        (0, vitest_1.expect)(atoms).toContain('Smokes(Anna)');
+        (0, vitest_1.expect)(atoms).toContain('Friends(Anna,Bob)');
+    });
+    (0, vitest_1.it)('groundFormula.satisfied y violations son consistentes', () => {
+        const [g] = (0, markov_logic_1.ground)({
+            predicates: [{ name: 'P', types: ['T'] }],
+            constants: { T: ['a'] },
+            formulas: [{ formula: 'P(x)', weight: 1.0 }],
+        });
+        (0, vitest_1.expect)(g).toBeDefined();
+        const wTrue = { groundAtoms: { 'P(a)': true } };
+        const wFalse = { groundAtoms: { 'P(a)': false } };
+        (0, vitest_1.expect)(g.satisfied(wTrue)).toBe(true);
+        (0, vitest_1.expect)(g.violations(wTrue)).toBe(0);
+        (0, vitest_1.expect)(g.satisfied(wFalse)).toBe(false);
+        (0, vitest_1.expect)(g.violations(wFalse)).toBe(1);
+    });
+});
+// ── weight & probability ─────────────────────────────────────
+(0, vitest_1.describe)('weight', () => {
+    (0, vitest_1.it)('asigna peso 0 a un mundo vacío sin fórmulas satisfechas', () => {
+        const theory = {
+            predicates: [{ name: 'P', types: ['T'] }],
+            constants: { T: ['a', 'b'] },
+            formulas: [{ formula: 'P(x)', weight: 2.0 }],
+        };
+        // mundo donde ningún P() es true → ninguna fórmula satisfecha → score 0.
+        const w = { groundAtoms: { 'P(a)': false, 'P(b)': false } };
+        (0, vitest_1.expect)((0, markov_logic_1.weight)(theory, w)).toBe(0);
+    });
+    (0, vitest_1.it)('penaliza mundos con menos fórmulas satisfechas (score menor)', () => {
+        const allSmoke = {
+            groundAtoms: {
+                'Smokes(Anna)': true,
+                'Smokes(Bob)': true,
+                'Cancer(Anna)': true,
+                'Cancer(Bob)': true,
+                'Friends(Anna,Bob)': false,
+                'Friends(Bob,Anna)': false,
+                'Friends(Anna,Anna)': false,
+                'Friends(Bob,Bob)': false,
+            },
+        };
+        const noSmoke = {
+            groundAtoms: {
+                'Smokes(Anna)': false,
+                'Smokes(Bob)': false,
+                'Cancer(Anna)': false,
+                'Cancer(Bob)': false,
+                'Friends(Anna,Bob)': false,
+                'Friends(Bob,Anna)': false,
+                'Friends(Anna,Anna)': false,
+                'Friends(Bob,Bob)': false,
+            },
+        };
+        const theory = {
+            predicates: [
+                { name: 'Smokes', types: ['Person'] },
+                { name: 'Cancer', types: ['Person'] },
+                { name: 'Friends', types: ['Person', 'Person'] },
+            ],
+            constants: { Person: ['Anna', 'Bob'] },
+            formulas: [
+                { formula: 'Smokes(x) → Cancer(x)', weight: 1.5 },
+                { formula: 'Friends(x, y) ∧ Smokes(x) → Smokes(y)', weight: 1.1 },
+                { formula: 'Smokes(x)', weight: 0.5 },
+            ],
+        };
+        const wSmoke = (0, markov_logic_1.weight)(theory, allSmoke);
+        const wNoSmoke = (0, markov_logic_1.weight)(theory, noSmoke);
+        // ambos satisfacen las implicaciones, pero allSmoke gana el prior Smokes(x).
+        (0, vitest_1.expect)(wSmoke).toBeGreaterThan(wNoSmoke);
+    });
+    (0, vitest_1.it)('devuelve -Infinity si un hard constraint está violado', () => {
+        const hardTheory = {
+            predicates: [{ name: 'P', types: ['T'] }],
+            constants: { T: ['a'] },
+            formulas: [{ formula: 'P(x)', weight: Infinity }],
+        };
+        const violator = { groundAtoms: { 'P(a)': false } };
+        (0, vitest_1.expect)((0, markov_logic_1.weight)(hardTheory, violator)).toBe(Number.NEGATIVE_INFINITY);
+        const satisfier = { groundAtoms: { 'P(a)': true } };
+        // hard constraint satisfecho aporta 0 al score, no Infinity.
+        (0, vitest_1.expect)((0, markov_logic_1.weight)(hardTheory, satisfier)).toBe(0);
+    });
+    (0, vitest_1.it)('probability(world, Z) = exp(weight)/Z y es consistente con la exacta', () => {
+        const Z = (0, markov_logic_1.exactPartition)(smokingSmall);
+        const marginals = (0, markov_logic_1.exactMarginals)(smokingSmall);
+        // Suma de probabilidades sobre todos los mundos == 1.
+        const atoms = (0, markov_logic_1.allGroundAtoms)(smokingSmall);
+        let total = 0;
+        const w = { groundAtoms: {} };
+        for (let mask = 0; mask < 1 << atoms.length; mask++) {
+            for (let i = 0; i < atoms.length; i++) {
+                w.groundAtoms[atoms[i]] = (mask & (1 << i)) !== 0;
+            }
+            total += (0, markov_logic_1.probability)(smokingSmall, w, Z);
+        }
+        (0, vitest_1.expect)(total).toBeCloseTo(1, 6);
+        // marginales en [0,1]
+        for (const a of atoms) {
+            (0, vitest_1.expect)(marginals[a]).toBeGreaterThanOrEqual(0);
+            (0, vitest_1.expect)(marginals[a]).toBeLessThanOrEqual(1);
+        }
+    });
+});
+// ── Gibbs sampling ───────────────────────────────────────────
+(0, vitest_1.describe)('gibbsSample', () => {
+    (0, vitest_1.it)('respeta la evidencia (no flippea átomos fijos)', () => {
+        const rng = makeRng(42);
+        const evidence = {
+            groundAtoms: { 'Smokes(Anna)': true, 'Friends(Anna,Bob)': true },
+        };
+        const samples = (0, markov_logic_1.gibbsSample)(smokingSmall, evidence, 100, { rng, burnIn: 20 });
+        (0, vitest_1.expect)(samples).toHaveLength(100);
+        for (const s of samples) {
+            (0, vitest_1.expect)(s.groundAtoms['Smokes(Anna)']).toBe(true);
+            (0, vitest_1.expect)(s.groundAtoms['Friends(Anna,Bob)']).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('converge a marginales cercanas a la distribución exacta', () => {
+        const exact = (0, markov_logic_1.exactMarginals)(smokingSmall);
+        const rng = makeRng(2024);
+        const approx = (0, markov_logic_1.gibbsMarginals)(smokingSmall, {}, 8000, { rng, burnIn: 500 });
+        for (const atom of Object.keys(exact)) {
+            const diff = Math.abs((exact[atom] ?? 0) - (approx[atom] ?? 0));
+            // tolerancia generosa pero suficiente para detectar bugs estructurales.
+            (0, vitest_1.expect)(diff).toBeLessThan(0.07);
+        }
+    });
+    (0, vitest_1.it)('cadena estabiliza: dos corridas largas con la misma semilla dan marginales muy cercanas', () => {
+        const m1 = (0, markov_logic_1.gibbsMarginals)(smokingSmall, {}, 4000, {
+            rng: makeRng(7),
+            burnIn: 500,
+        });
+        const m2 = (0, markov_logic_1.gibbsMarginals)(smokingSmall, {}, 4000, {
+            rng: makeRng(7),
+            burnIn: 500,
+        });
+        for (const a of Object.keys(m1)) {
+            (0, vitest_1.expect)((m1[a] ?? 0) - (m2[a] ?? 0)).toBe(0); // misma semilla → mismo resultado bit-exacto
+        }
+    });
+    (0, vitest_1.it)('detecta correlación entre amigos: si Anna fuma, Bob tiende a fumar más', () => {
+        const rng = makeRng(123);
+        const evidenceA = {
+            groundAtoms: {
+                'Smokes(Anna)': true,
+                'Friends(Anna,Bob)': true,
+                'Friends(Bob,Anna)': true,
+                'Friends(Anna,Anna)': false,
+                'Friends(Bob,Bob)': false,
+            },
+        };
+        const evidenceB = {
+            groundAtoms: {
+                'Smokes(Anna)': false,
+                'Friends(Anna,Bob)': true,
+                'Friends(Bob,Anna)': true,
+                'Friends(Anna,Anna)': false,
+                'Friends(Bob,Bob)': false,
+            },
+        };
+        const mWith = (0, markov_logic_1.gibbsMarginals)(smokingSmall, evidenceA, 4000, { rng, burnIn: 500 });
+        const mWithout = (0, markov_logic_1.gibbsMarginals)(smokingSmall, evidenceB, 4000, {
+            rng: makeRng(124),
+            burnIn: 500,
+        });
+        // Con Anna fumando y amigos↔, Bob fuma más que sin Anna fumando.
+        (0, vitest_1.expect)(mWith['Smokes(Bob)']).toBeGreaterThan(mWithout['Smokes(Bob)']);
+    });
+});
+// ── MAP inference ────────────────────────────────────────────
+(0, vitest_1.describe)('mapInference', () => {
+    (0, vitest_1.it)('encuentra un mundo cuyo weight no es menor al óptimo exacto', () => {
+        const rng = makeRng(99);
+        const result = (0, markov_logic_1.mapInference)(smokingSmall, {}, {
+            rng,
+            maxFlips: 2000,
+            restarts: 6,
+        });
+        // Calcular óptimo exacto enumerando mundos pequeños.
+        const atoms = (0, markov_logic_1.allGroundAtoms)(smokingSmall);
+        let bestExact = Number.NEGATIVE_INFINITY;
+        const w = { groundAtoms: {} };
+        for (let mask = 0; mask < 1 << atoms.length; mask++) {
+            for (let i = 0; i < atoms.length; i++) {
+                w.groundAtoms[atoms[i]] = (mask & (1 << i)) !== 0;
+            }
+            const s = (0, markov_logic_1.weight)(smokingSmall, w);
+            if (s > bestExact)
+                bestExact = s;
+        }
+        const found = (0, markov_logic_1.weight)(smokingSmall, result);
+        (0, vitest_1.expect)(found).toBeCloseTo(bestExact, 6);
+    });
+    (0, vitest_1.it)('respeta hard constraints en la MAP', () => {
+        const theory = {
+            predicates: [
+                { name: 'P', types: ['T'] },
+                { name: 'Q', types: ['T'] },
+            ],
+            constants: { T: ['a'] },
+            formulas: [
+                { formula: 'P(x)', weight: Infinity }, // hard: P(a) debe ser true
+                { formula: '¬Q(x)', weight: 0.5 }, // soft: preferimos ¬Q(a)
+            ],
+        };
+        const rng = makeRng(5);
+        const result = (0, markov_logic_1.mapInference)(theory, {}, { rng, restarts: 3, maxFlips: 200 });
+        (0, vitest_1.expect)(result.groundAtoms['P(a)']).toBe(true);
+        (0, vitest_1.expect)(result.groundAtoms['Q(a)']).toBe(false);
+    });
+    (0, vitest_1.it)('respeta evidencia', () => {
+        const rng = makeRng(11);
+        const evidence = {
+            groundAtoms: { 'Smokes(Anna)': false, 'Friends(Anna,Bob)': true },
+        };
+        const result = (0, markov_logic_1.mapInference)(smokingSmall, evidence, { rng, restarts: 3, maxFlips: 500 });
+        (0, vitest_1.expect)(result.groundAtoms['Smokes(Anna)']).toBe(false);
+        (0, vitest_1.expect)(result.groundAtoms['Friends(Anna,Bob)']).toBe(true);
+    });
+});
+// ── Smoking-3: cordura general ───────────────────────────────
+(0, vitest_1.describe)('Smoking network (3 personas)', () => {
+    (0, vitest_1.it)('ground produce 3+9+3 = 15 ground formulas para la teoría completa', () => {
+        const grounded = (0, markov_logic_1.ground)(smoking3);
+        // Smokes→Cancer: 3, Friends∧Smokes→Smokes: 3² = 9, Smokes prior: 3 → 15
+        (0, vitest_1.expect)(grounded).toHaveLength(15);
+    });
+    (0, vitest_1.it)('atoms Herbrand: 3 Smokes + 3 Cancer + 9 Friends = 15', () => {
+        const atoms = (0, markov_logic_1.allGroundAtoms)(smoking3);
+        (0, vitest_1.expect)(atoms).toHaveLength(15);
+    });
+});
+//# sourceMappingURL=markov-logic.test.js.map

package/dist/tests/reasoning/markov-logic/markov-logic.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"markov-logic.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/markov-logic/markov-logic.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;AAC/D,EAAE;AACF,uEAAuE;AACvE,EAAE;AACF,qDAAqD;AACrD,qDAAqD;AACrD,+DAA+D;AAC/D,EAAE;AACF,sEAAsE;AACtE,iDAAiD;;AAEjD,mCAA8C;AAC9C,kEAcyC;AAEzC,gEAAgE;AAEhE,MAAM,QAAQ,GAAc;IAC1B,UAAU,EAAE;QACV,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE;QACrC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE;QACrC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;KACjD;IACD,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE;IAC9C,QAAQ,EAAE;QACR,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,EAAE,GAAG,EAAE;QACjD,EAAE,OAAO,EAAE,uCAAuC,EAAE,MAAM,EAAE,GAAG,EAAE;QACjE,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE;KACtC;CACF,CAAC;AAEF,MAAM,YAAY,GAAc;IAC9B,UAAU,EAAE;QACV,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE;QACrC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;KACjD;IACD,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE;IACtC,QAAQ,EAAE;QACR,EAAE,OAAO,EAAE,uCAAuC,EAAE,MAAM,EAAE,GAAG,EAAE;QACjE,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE;KACtC;CACF,CAAC;AAEF,2DAA2D;AAC3D,SAAS,OAAO,CAAC,IAAY;IAC3B,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;IACnB,OAAO,GAAW,EAAE;QAClB,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,UAAU,EAAE,GAAG,EAAE;IACxB,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,WAAW,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,uCAAuC,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,IAAA,uBAAQ,EAAC,wBAAwB,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAA,uBAAQ,EAAC,uBAAuB,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,IAAA,uBAAQ,EAAC,wBAAwB,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAA,uBAAQ,EAAC,wBAAwB,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,gCAAgC;QAChC,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,qBAAqB,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAClB,IAAI,EAAE,IAAI;YACV,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE;YACzE,KAAK,EAAE;gBACL,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;gBACnD,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;aACrD;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,uBAAQ,EAAC,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC7C,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,uBAAQ,EAAC,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,QAAQ,EAAE,GAAG,EAAE;IACtB,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,+EAA+E;QAC/E,MAAM,QAAQ,GAAG,IAAA,qBAAM,EAAC;YACtB,GAAG,QAAQ;YACX,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,uCAAuC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;SAC9E,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,SAAS,GAAc;YAC3B,UAAU,EAAE;gBACV,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE;gBACtC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;aACjD;YACD,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE;YAC9C,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,4BAA4B,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;SACnE,CAAC;QACF,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,qBAAM,EAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,YAAY,CAAC,CAAC;QAC3C,iDAAiD;QACjD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,CAAC,CAAC,GAAG,IAAA,qBAAM,EAAC;YACjB,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACzC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;YACvB,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;SAC7C,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACxB,MAAM,KAAK,GAAa,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAa,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5D,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,QAAQ,EAAE,GAAG,EAAE;IACtB,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,MAAM,GAAc;YACxB,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACzC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;YAC5B,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;SAC7C,CAAC;QACF,yEAAyE;QACzE,MAAM,CAAC,GAAa,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACtE,IAAA,eAAM,EAAC,IAAA,qBAAM,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,QAAQ,GAAa;YACzB,WAAW,EAAE;gBACX,cAAc,EAAE,IAAI;gBACpB,aAAa,EAAE,IAAI;gBACnB,cAAc,EAAE,IAAI;gBACpB,aAAa,EAAE,IAAI;gBACnB,mBAAmB,EAAE,KAAK;gBAC1B,mBAAmB,EAAE,KAAK;gBAC1B,oBAAoB,EAAE,KAAK;gBAC3B,kBAAkB,EAAE,KAAK;aAC1B;SACF,CAAC;QACF,MAAM,OAAO,GAAa;YACxB,WAAW,EAAE;gBACX,cAAc,EAAE,KAAK;gBACrB,aAAa,EAAE,KAAK;gBACpB,cAAc,EAAE,KAAK;gBACrB,aAAa,EAAE,KAAK;gBACpB,mBAAmB,EAAE,KAAK;gBAC1B,mBAAmB,EAAE,KAAK;gBAC1B,oBAAoB,EAAE,KAAK;gBAC3B,kBAAkB,EAAE,KAAK;aAC1B;SACF,CAAC;QACF,MAAM,MAAM,GAAc;YACxB,UAAU,EAAE;gBACV,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE;gBACrC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE;gBACrC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;aACjD;YACD,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE;YACtC,QAAQ,EAAE;gBACR,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,EAAE,GAAG,EAAE;gBACjD,EAAE,OAAO,EAAE,uCAAuC,EAAE,MAAM,EAAE,GAAG,EAAE;gBACjE,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE;aACtC;SACF,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,qBAAM,EAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAA,qBAAM,EAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACzC,6EAA6E;QAC7E,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,UAAU,GAAc;YAC5B,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACzC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;YACvB,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;SAClD,CAAC;QACF,MAAM,QAAQ,GAAa,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAA,qBAAM,EAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACpE,MAAM,SAAS,GAAa,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9D,6DAA6D;QAC7D,IAAA,eAAM,EAAC,IAAA,qBAAM,EAAC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,GAAG,IAAA,6BAAc,EAAC,YAAY,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAA,6BAAc,EAAC,YAAY,CAAC,CAAC;QAC/C,sDAAsD;QACtD,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,YAAY,CAAC,CAAC;QAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,GAAa,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACpD,CAAC;YACD,KAAK,IAAI,IAAA,0BAAW,EAAC,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,sBAAsB;QACtB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAA,eAAM,EAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAA,eAAM,EAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,QAAQ,GAAsB;YAClC,WAAW,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE;SACjE,CAAC;QACF,MAAM,OAAO,GAAG,IAAA,0BAAW,EAAC,YAAY,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAA,eAAM,EAAC,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjD,IAAA,eAAM,EAAC,CAAC,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,YAAY,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAA,6BAAc,EAAC,YAAY,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5E,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChE,wEAAwE;YACxE,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yFAAyF,EAAE,GAAG,EAAE;QACjG,MAAM,EAAE,GAAG,IAAA,6BAAc,EAAC,YAAY,EAAE,EAAE,EAAE,IAAI,EAAE;YAChD,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;YACf,MAAM,EAAE,GAAG;SACZ,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,IAAA,6BAAc,EAAC,YAAY,EAAE,EAAE,EAAE,IAAI,EAAE;YAChD,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;YACf,MAAM,EAAE,GAAG;SACZ,CAAC,CAAC;QACH,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,IAAA,eAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,6CAA6C;QAC5F,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,SAAS,GAAsB;YACnC,WAAW,EAAE;gBACX,cAAc,EAAE,IAAI;gBACpB,mBAAmB,EAAE,IAAI;gBACzB,mBAAmB,EAAE,IAAI;gBACzB,oBAAoB,EAAE,KAAK;gBAC3B,kBAAkB,EAAE,KAAK;aAC1B;SACF,CAAC;QACF,MAAM,SAAS,GAAsB;YACnC,WAAW,EAAE;gBACX,cAAc,EAAE,KAAK;gBACrB,mBAAmB,EAAE,IAAI;gBACzB,mBAAmB,EAAE,IAAI;gBACzB,oBAAoB,EAAE,KAAK;gBAC3B,kBAAkB,EAAE,KAAK;aAC1B;SACF,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAClF,MAAM,QAAQ,GAAG,IAAA,6BAAc,EAAC,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE;YAC7D,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC;YACjB,MAAM,EAAE,GAAG;SACZ,CAAC,CAAC;QACH,iEAAiE;QACjE,IAAA,eAAM,EAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,IAAA,2BAAY,EACzB,YAAY,EACZ,EAAE,EACF;YACE,GAAG;YACH,QAAQ,EAAE,IAAI;YACd,QAAQ,EAAE,CAAC;SACZ,CACF,CAAC;QACF,qDAAqD;QACrD,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,YAAY,CAAC,CAAC;QAC3C,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACzC,MAAM,CAAC,GAAa,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACpD,CAAC;YACD,MAAM,CAAC,GAAG,IAAA,qBAAM,EAAC,YAAY,EAAE,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,SAAS;gBAAE,SAAS,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,KAAK,GAAG,IAAA,qBAAM,EAAC,YAAY,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,MAAM,GAAc;YACxB,UAAU,EAAE;gBACV,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC3B,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;aAC5B;YACD,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;YACvB,QAAQ,EAAE;gBACR,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,2BAA2B;gBAClE,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,yBAAyB;aAC7D;SACF,CAAC;QACF,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,IAAA,2BAAY,EAAC,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,QAAQ,GAAsB;YAClC,WAAW,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,mBAAmB,EAAE,IAAI,EAAE;SAClE,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,2BAAY,EAAC,YAAY,EAAE,QAAQ,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QACzF,IAAA,eAAM,EAAC,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,MAAM,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,QAAQ,GAAG,IAAA,qBAAM,EAAC,QAAQ,CAAC,CAAC;QAClC,wEAAwE;QACxE,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,QAAQ,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/optimization/ilp.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ilp.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/optimization/ilp.test.ts"],"names":[],"mappings":""}

package/dist/tests/reasoning/optimization/ilp.test.js

@@ -0,0 +1,204 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const optimization_1 = require("../../../reasoning/optimization");
+(0, vitest_1.describe)('ILP — Branch-and-bound sobre relajación LP', () => {
+    (0, vitest_1.it)('ILP trivial: max x s.t. x ≤ 5.7, x entero → x = 5', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 5.7 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBe(5);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(5, 6);
+    });
+    (0, vitest_1.it)('ILP knapsack 0-1: 4 items, capacidad 10', () => {
+        // valor:  [10, 40, 30, 50], peso: [5, 4, 6, 3]
+        // capacidad 10. Óptimo conocido: item 2 (peso 4, valor 40) +
+        // item 4 (peso 3, valor 50) + item 1 (peso 5? no, supera). Probemos:
+        //  {2,4}: peso=7, valor=90.   {1,2,4}: 5+4+3=12>10 no.
+        //  {2,3}: 4+6=10, valor=70.   {2,4,3}: 4+3+6=13 no.
+        //  {4,1}: 3+5=8, valor=60.    Mejor: {2,4} con valor 90.
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [10, 40, 30, 50] },
+            constraints: [{ coefficients: [5, 4, 6, 3], operator: '<=', rhs: 10 }],
+            integerVars: [0, 1, 2, 3],
+            binaryVars: [0, 1, 2, 3],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(90, 6);
+        (0, vitest_1.expect)(sol.variables[1]).toBe(1);
+        (0, vitest_1.expect)(sol.variables[3]).toBe(1);
+    });
+    (0, vitest_1.it)('ILP infeasible: 2x = 1, x entero', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [2], operator: '=', rhs: 1 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        // LP relaxation: x=0.5. ILP: ningún entero satisface 2x=1.
+        (0, vitest_1.expect)(sol.status).toBe('infeasible');
+    });
+    (0, vitest_1.it)('ILP con relajación ya entera (B&B inmediato)', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1, 1] },
+            constraints: [
+                { coefficients: [1, 0], operator: '<=', rhs: 3 },
+                { coefficients: [0, 1], operator: '<=', rhs: 4 },
+            ],
+            integerVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBe(3);
+        (0, vitest_1.expect)(sol.variables[1]).toBe(4);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(7, 6);
+        (0, vitest_1.expect)(sol.nodesExplored).toBeGreaterThanOrEqual(1);
+    });
+    (0, vitest_1.it)('ILP: max 5x + 4y s.t. 6x+4y≤24, x+2y≤6, x,y enteros ≥ 0', () => {
+        // Caso clásico. Relajación LP: óptimo en (3, 1.5) con val 21.
+        // ILP: (3,1)=19, (2,2)=18, (4,0)=20. Óptimo: (4,0)=20.
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [5, 4] },
+            constraints: [
+                { coefficients: [6, 4], operator: '<=', rhs: 24 },
+                { coefficients: [1, 2], operator: '<=', rhs: 6 },
+            ],
+            integerVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(20, 5);
+        (0, vitest_1.expect)(sol.variables[0]).toBe(4);
+        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(0, 6);
+    });
+    (0, vitest_1.it)('Assignment problem 3x3 binario', () => {
+        // 3 trabajadores, 3 tareas. Coste c[i][j]. Variables x_ij ∈ {0,1}.
+        // Minimizar Σ c·x s.t. Σ_j x_ij = 1 ∀i, Σ_i x_ij = 1 ∀j.
+        // Matriz coste:
+        //   T1 T2 T3
+        // W1 9  2  7
+        // W2 6  4  3
+        // W3 5  8  1
+        // Asignación óptima: W1→T2 (2), W2→T1 (6), W3→T3 (1) = 9.
+        // Otra: W1→T2, W2→T3, W3→T1 = 2+3+5=10. La primera es mejor.
+        const c = [9, 2, 7, 6, 4, 3, 5, 8, 1]; // x11,x12,x13,x21,x22,x23,x31,x32,x33
+        const ilp = {
+            objective: { kind: 'minimize', coefficients: c },
+            constraints: [
+                // sumas por trabajador = 1
+                { coefficients: [1, 1, 1, 0, 0, 0, 0, 0, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 0, 0, 1, 1, 1, 0, 0, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 0, 0, 0, 0, 0, 1, 1, 1], operator: '=', rhs: 1 },
+                // sumas por tarea = 1
+                { coefficients: [1, 0, 0, 1, 0, 0, 1, 0, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 1, 0, 0, 1, 0, 0, 1, 0], operator: '=', rhs: 1 },
+                { coefficients: [0, 0, 1, 0, 0, 1, 0, 0, 1], operator: '=', rhs: 1 },
+            ],
+            integerVars: [0, 1, 2, 3, 4, 5, 6, 7, 8],
+            binaryVars: [0, 1, 2, 3, 4, 5, 6, 7, 8],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp, { maxNodes: 5000, timeoutMs: 15000 });
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(9, 5);
+    });
+    (0, vitest_1.it)('ILP binario simple: max x+y s.t. x+y≤1', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1, 1] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 1 }],
+            integerVars: [0, 1],
+            binaryVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(1, 6);
+        // Solución: una de las dos es 1, la otra 0.
+        const [x, y] = sol.variables;
+        (0, vitest_1.expect)((x === 1 && y === 0) || (x === 0 && y === 1)).toBe(true);
+    });
+    (0, vitest_1.it)('lpRelaxation produce LP válido (sin integerVars)', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [3, 2] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 5 }],
+            integerVars: [0],
+        };
+        const lp = (0, optimization_1.lpRelaxation)(ilp);
+        (0, vitest_1.expect)(lp.objective.coefficients).toEqual([3, 2]);
+        (0, vitest_1.expect)(lp.constraints).toHaveLength(1);
+        // No deberían existir integerVars en LPProblem
+        (0, vitest_1.expect)('integerVars' in lp).toBe(false);
+    });
+    (0, vitest_1.it)('lpRelaxation inyecta cotas [0,1] para binarios', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [10, 20] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 1.5 }],
+            integerVars: [0, 1],
+            binaryVars: [0, 1],
+        };
+        const lp = (0, optimization_1.lpRelaxation)(ilp);
+        (0, vitest_1.expect)(lp.variableBounds?.[0]?.upper).toBe(1);
+        (0, vitest_1.expect)(lp.variableBounds?.[1]?.upper).toBe(1);
+    });
+    (0, vitest_1.it)('ILP reporta nodesExplored ≥ 1', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 3.5 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.nodesExplored).toBeGreaterThanOrEqual(1);
+    });
+    (0, vitest_1.it)('ILP reporta gap = 0 cuando relajación es entera', () => {
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 4 }],
+            integerVars: [0],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.gap).toBe(0);
+    });
+    (0, vitest_1.it)('ILP set-covering pequeño (3 sets, 4 elementos)', () => {
+        // Cubrir {1,2,3,4} con mínimo número de sets.
+        // S1={1,2}, S2={2,3}, S3={3,4}. Variables x1,x2,x3 binarias.
+        // min x1+x2+x3 s.t.
+        //   x1 ≥ 1 (cubre 1)         → x1 = 1
+        //   x1+x2 ≥ 1 (cubre 2)
+        //   x2+x3 ≥ 1 (cubre 3)
+        //   x3 ≥ 1 (cubre 4)         → x3 = 1
+        // Óptimo: x1=1, x3=1, x2=0. Valor 2.
+        const ilp = {
+            objective: { kind: 'minimize', coefficients: [1, 1, 1] },
+            constraints: [
+                { coefficients: [1, 0, 0], operator: '>=', rhs: 1 },
+                { coefficients: [1, 1, 0], operator: '>=', rhs: 1 },
+                { coefficients: [0, 1, 1], operator: '>=', rhs: 1 },
+                { coefficients: [0, 0, 1], operator: '>=', rhs: 1 },
+            ],
+            integerVars: [0, 1, 2],
+            binaryVars: [0, 1, 2],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(2, 5);
+        (0, vitest_1.expect)(sol.variables[0]).toBe(1);
+        (0, vitest_1.expect)(sol.variables[2]).toBe(1);
+    });
+    (0, vitest_1.it)('ILP rounding gap explícito: max 4x+3y s.t. 3x+2y≤8, x,y enteros', () => {
+        // Relajación: max en (8/3, 0) = 32/3 ≈ 10.67 o (0, 4) = 12. → (0,4)=12 entera.
+        // Pero verificamos otras esquinas: óptimo es (0,4)=12.
+        const ilp = {
+            objective: { kind: 'maximize', coefficients: [4, 3] },
+            constraints: [{ coefficients: [3, 2], operator: '<=', rhs: 8 }],
+            integerVars: [0, 1],
+        };
+        const sol = (0, optimization_1.solveILP)(ilp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(12, 5);
+    });
+});
+//# sourceMappingURL=ilp.test.js.map

package/dist/tests/reasoning/optimization/ilp.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ilp.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/optimization/ilp.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,kEAAyE;AAGzE,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAC9D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,+CAA+C;QAC/C,6DAA6D;QAC7D,qEAAqE;QACrE,uDAAuD;QACvD,oDAAoD;QACpD,yDAAyD;QACzD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;YAC/D,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YACtE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACzB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC3D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,2DAA2D;QAC3D,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,aAAa,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,8DAA8D;QAC9D,uDAAuD;QACvD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;gBACjD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,mEAAmE;QACnE,yDAAyD;QACzD,gBAAgB;QAChB,aAAa;QACb,aAAa;QACb,aAAa;QACb,aAAa;QACb,0DAA0D;QAC1D,6DAA6D;QAC7D,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,sCAAsC;QAC7E,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE;YAChD,WAAW,EAAE;gBACX,2BAA2B;gBAC3B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,sBAAsB;gBACtB,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;aACrE;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACxC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACxC,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC/D,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACnB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,4CAA4C;QAC5C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC/D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,EAAE,CAAC,WAAW,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACvC,+CAA+C;QAC/C,IAAA,eAAM,EAAC,aAAa,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;YACvD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YACjE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACnB,CAAC;QACF,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAC9D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,aAAa,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC5D,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,8CAA8C;QAC9C,6DAA6D;QAC7D,oBAAoB;QACpB,sCAAsC;QACtC,wBAAwB;QACxB,wBAAwB;QACxB,sCAAsC;QACtC,qCAAqC;QACrC,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YACxD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBACnD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBACnD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBACnD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACpD;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACtB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACtB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,+EAA+E;QAC/E,uDAAuD;QACvD,MAAM,GAAG,GAAe;YACtB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC/D,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,GAAG,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/optimization/lp.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lp.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/optimization/lp.test.ts"],"names":[],"mappings":""}