@stevenvo780/st-lang 4.6.0 → 4.8.0

package/dist/tests/reasoning/mechanism-design/mechanism-design.test.js

@@ -0,0 +1,290 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const mechanism_design_1 = require("../../../reasoning/mechanism-design");
+function agent(id, vals) {
+    return { id, valuation: new Map(Object.entries(vals)) };
+}
+(0, vitest_1.describe)('mechanism-design — VCG', () => {
+    (0, vitest_1.it)('VCG con 3 agents y 1 item: gana el de mayor valor, paga el segundo', () => {
+        const items = ['item'];
+        const agents = [agent('a', { item: 10 }), agent('b', { item: 5 }), agent('c', { item: 3 })];
+        const out = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        (0, vitest_1.expect)(out.allocation.get('a')).toBe('item');
+        (0, vitest_1.expect)(out.allocation.has('b')).toBe(false);
+        (0, vitest_1.expect)(out.allocation.has('c')).toBe(false);
+        // Payment de 'a' = welfare otros sin 'a' (b se queda con item, valor 5)
+        //                 - welfare otros en alloc (b,c sin nada → 0) = 5.
+        (0, vitest_1.expect)(out.payments.get('a')).toBe(5);
+        (0, vitest_1.expect)(out.payments.get('b')).toBe(0);
+        (0, vitest_1.expect)(out.payments.get('c')).toBe(0);
+    });
+    (0, vitest_1.it)('VCG con 2 agents y 2 items: cada uno se lleva su preferido', () => {
+        const items = ['x', 'y'];
+        const agents = [agent('a', { x: 10, y: 2 }), agent('b', { x: 1, y: 8 })];
+        const out = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        (0, vitest_1.expect)(out.allocation.get('a')).toBe('x');
+        (0, vitest_1.expect)(out.allocation.get('b')).toBe('y');
+        // welfare óptimo sin 'a' = b se lleva y (8) o x (1) → 8. En alloc, b=8.
+        // Externalidad de 'a' = 8 - 8 = 0. (no impide a 'b').
+        (0, vitest_1.expect)(out.payments.get('a')).toBe(0);
+        (0, vitest_1.expect)(out.payments.get('b')).toBe(0);
+    });
+    (0, vitest_1.it)('VCG maximiza social welfare', () => {
+        const items = ['a', 'b'];
+        const agents = [
+            agent('p', { a: 9, b: 1 }),
+            agent('q', { a: 3, b: 7 }),
+            agent('r', { a: 2, b: 4 }),
+        ];
+        const out = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        const welfare = (0, mechanism_design_1.socialWelfare)(out, agents);
+        (0, vitest_1.expect)(welfare).toBe(9 + 7); // p:a (9), q:b (7).
+    });
+    (0, vitest_1.it)('VCG es strategy-proof (verificación empírica)', () => {
+        const sp = (0, mechanism_design_1.isStrategyProof)((ags) => (0, mechanism_design_1.vcgMechanism)(ags, ['x', 'y']), 100);
+        (0, vitest_1.expect)(sp).toBe(true);
+    });
+    (0, vitest_1.it)('VCG combinatorial: 2 agents, 2 items, valuations sobre bundles', () => {
+        const items = ['A', 'B'];
+        const agents = [
+            // 'p' valora el bundle entero más alto que cualquier item individual.
+            agent('p', { A: 4, B: 4, 'A+B': 15 }),
+            agent('q', { A: 5, B: 5, 'A+B': 6 }),
+        ];
+        const out = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        // Óptimo: p se queda con A+B (welfare 15) vs split (4+5? — p:B=4, q:A=5 → 9).
+        (0, vitest_1.expect)(out.allocation.get('p')).toBe('A+B');
+        (0, vitest_1.expect)(out.allocation.has('q')).toBe(false);
+        // Sin p: q se queda con A+B (6). En alloc q tiene 0. Pago p = 6.
+        (0, vitest_1.expect)(out.payments.get('p')).toBe(6);
+    });
+    (0, vitest_1.it)('VCG: agente con valuation 0 no recibe nada', () => {
+        const items = ['x'];
+        const agents = [agent('a', { x: 0 }), agent('b', { x: 5 })];
+        const out = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        (0, vitest_1.expect)(out.allocation.get('b')).toBe('x');
+        (0, vitest_1.expect)(out.allocation.has('a')).toBe(false);
+        (0, vitest_1.expect)(out.payments.get('b')).toBe(0);
+    });
+});
+(0, vitest_1.describe)('mechanism-design — sealed-bid auctions', () => {
+    (0, vitest_1.it)('First-price: gana max bid y paga su propio bid', () => {
+        const bids = new Map([
+            ['a', 7],
+            ['b', 5],
+            ['c', 3],
+        ]);
+        const r = (0, mechanism_design_1.firstPriceSealed)(bids);
+        (0, vitest_1.expect)(r.winner).toBe('a');
+        (0, vitest_1.expect)(r.payment).toBe(7);
+    });
+    (0, vitest_1.it)('Second-price (Vickrey): gana max bid y paga el segundo', () => {
+        const bids = new Map([
+            ['a', 10],
+            ['b', 7],
+            ['c', 3],
+        ]);
+        const r = (0, mechanism_design_1.secondPriceSealed)(bids);
+        (0, vitest_1.expect)(r.winner).toBe('a');
+        (0, vitest_1.expect)(r.payment).toBe(7);
+    });
+    (0, vitest_1.it)('Second-price = VCG cuando hay un solo item', () => {
+        const items = ['item'];
+        const agents = [agent('a', { item: 10 }), agent('b', { item: 7 }), agent('c', { item: 3 })];
+        const vcg = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        const bids = new Map([
+            ['a', 10],
+            ['b', 7],
+            ['c', 3],
+        ]);
+        const sp = (0, mechanism_design_1.secondPriceSealed)(bids);
+        (0, vitest_1.expect)(sp.winner).toBe('a');
+        (0, vitest_1.expect)(sp.payment).toBe(vcg.payments.get('a'));
+    });
+    (0, vitest_1.it)('Auctions sin bidders válidos: no hay ganador', () => {
+        const empty = new Map();
+        (0, vitest_1.expect)((0, mechanism_design_1.firstPriceSealed)(empty).winner).toBe('');
+        (0, vitest_1.expect)((0, mechanism_design_1.secondPriceSealed)(empty).winner).toBe('');
+        (0, vitest_1.expect)((0, mechanism_design_1.firstPriceSealed)(empty).payment).toBe(0);
+        (0, vitest_1.expect)((0, mechanism_design_1.secondPriceSealed)(empty).payment).toBe(0);
+    });
+    (0, vitest_1.it)('Second-price con un solo bidder: paga 0', () => {
+        const bids = new Map([['solo', 5]]);
+        const r = (0, mechanism_design_1.secondPriceSealed)(bids);
+        (0, vitest_1.expect)(r.winner).toBe('solo');
+        (0, vitest_1.expect)(r.payment).toBe(0);
+    });
+});
+(0, vitest_1.describe)('mechanism-design — English and Dutch', () => {
+    (0, vitest_1.it)('English ascending termina cuando el 2do desiste — paga ≈ 2do precio', () => {
+        const bids = new Map([
+            ['a', 10],
+            ['b', 7],
+            ['c', 4],
+        ]);
+        const r = (0, mechanism_design_1.englishAuction)(bids, 1);
+        (0, vitest_1.expect)(r.winner).toBe('a');
+        // increment=1, second=7 → cae en grid → paga exactamente 7.
+        (0, vitest_1.expect)(r.payment).toBe(7);
+    });
+    (0, vitest_1.it)('English con increment grande: paga next step sobre el 2do precio', () => {
+        const bids = new Map([
+            ['a', 100],
+            ['b', 65],
+        ]);
+        const r = (0, mechanism_design_1.englishAuction)(bids, 10);
+        (0, vitest_1.expect)(r.winner).toBe('a');
+        // second=65 no es múltiplo de 10 → paga 70.
+        (0, vitest_1.expect)(r.payment).toBe(70);
+    });
+    (0, vitest_1.it)('Dutch descending equivale a first-price', () => {
+        // Si cada bidder está dispuesto a aceptar a su valuation,
+        // el primero en cruzar el precio es el de mayor valuation.
+        const bidders = new Map([
+            ['a', 10],
+            ['b', 7],
+            ['c', 4],
+        ]);
+        const r = (0, mechanism_design_1.dutchAuction)(20, bidders, 1);
+        (0, vitest_1.expect)(r.winner).toBe('a');
+        // Reloj parte de 20, baja a 10 → 'a' acepta.
+        (0, vitest_1.expect)(r.payment).toBe(10);
+    });
+    (0, vitest_1.it)('Dutch sin nadie dispuesto: no se vende', () => {
+        const bidders = new Map();
+        const r = (0, mechanism_design_1.dutchAuction)(10, bidders, 1);
+        (0, vitest_1.expect)(r.winner).toBe('');
+        (0, vitest_1.expect)(r.payment).toBe(0);
+    });
+});
+(0, vitest_1.describe)('mechanism-design — Myerson optimal auction', () => {
+    (0, vitest_1.it)('virtualValuation: para uniform[0,1], φ(v) = 2v - 1', () => {
+        const u = (0, mechanism_design_1.uniformDistribution)(0, 1);
+        (0, vitest_1.expect)((0, mechanism_design_1.virtualValuation)(0.5, u)).toBeCloseTo(0, 9);
+        (0, vitest_1.expect)((0, mechanism_design_1.virtualValuation)(0.75, u)).toBeCloseTo(0.5, 9);
+        (0, vitest_1.expect)((0, mechanism_design_1.virtualValuation)(0.25, u)).toBeCloseTo(-0.5, 9);
+    });
+    (0, vitest_1.it)('findReserve uniform[0,1] = 1/2', () => {
+        const u = (0, mechanism_design_1.uniformDistribution)(0, 1);
+        (0, vitest_1.expect)((0, mechanism_design_1.findReserve)(u)).toBeCloseTo(0.5, 6);
+    });
+    (0, vitest_1.it)('Myerson con bids sobre reserve: gana el mayor, paga max(2do, reserve)', () => {
+        const u = (0, mechanism_design_1.uniformDistribution)(0, 1);
+        const dists = new Map([
+            ['a', u],
+            ['b', u],
+            ['c', u],
+        ]);
+        const bids = new Map([
+            ['a', 0.9],
+            ['b', 0.7],
+            ['c', 0.3],
+        ]);
+        const r = (0, mechanism_design_1.myersonOptimal)(bids, dists);
+        (0, vitest_1.expect)(r.winner).toBe('a');
+        // φ_a = 2*0.9-1 = 0.8; φ_b = 2*0.7-1 = 0.4; φ_c = -0.4
+        // payment = invertVirtual(target=0.4) = 0.7. > reserve 0.5 → 0.7.
+        (0, vitest_1.expect)(r.payment).toBeCloseTo(0.7, 4);
+        (0, vitest_1.expect)(r.reserve).toBeCloseTo(0.5, 4);
+    });
+    (0, vitest_1.it)('Myerson sin nadie sobre reserve: no se vende', () => {
+        const u = (0, mechanism_design_1.uniformDistribution)(0, 1);
+        const dists = new Map([
+            ['a', u],
+            ['b', u],
+        ]);
+        const bids = new Map([
+            ['a', 0.3],
+            ['b', 0.2],
+        ]);
+        const r = (0, mechanism_design_1.myersonOptimal)(bids, dists);
+        (0, vitest_1.expect)(r.winner).toBe('');
+        (0, vitest_1.expect)(r.payment).toBe(0);
+        (0, vitest_1.expect)(r.reserve).toBeCloseTo(0.5, 4);
+    });
+    (0, vitest_1.it)('Myerson con 1 bidder sobre reserve: paga el reserve', () => {
+        const u = (0, mechanism_design_1.uniformDistribution)(0, 1);
+        const dists = new Map([
+            ['a', u],
+            ['b', u],
+        ]);
+        const bids = new Map([
+            ['a', 0.8],
+            ['b', 0.2],
+        ]);
+        const r = (0, mechanism_design_1.myersonOptimal)(bids, dists);
+        (0, vitest_1.expect)(r.winner).toBe('a');
+        // φ_b = -0.6, target = max(-0.6, 0) = 0 → paga reserve = 0.5.
+        (0, vitest_1.expect)(r.payment).toBeCloseTo(0.5, 4);
+    });
+});
+(0, vitest_1.describe)('mechanism-design — revenue equivalence', () => {
+    (0, vitest_1.it)('Revenue equivalence: 1st-price (con shading) ≈ 2nd-price truthful', () => {
+        // Setup: 2 bidders IID uniform[0,1]. Equilibrio simétrico de
+        // 1st-price: b(v) = (n-1)/n · v = v/2. Para 2nd-price es v.
+        const u = (0, mechanism_design_1.uniformDistribution)(0, 1);
+        const dists = new Map([
+            ['a', u],
+            ['b', u],
+        ]);
+        // 1st-price con shading aplicado a las valuations sampleadas.
+        const firstPriceWithShade = (bids) => {
+            const shaded = new Map();
+            for (const [id, v] of bids)
+                shaded.set(id, v * 0.5);
+            return (0, mechanism_design_1.firstPriceSealed)(shaded);
+        };
+        const rev1 = (0, mechanism_design_1.expectedRevenue)(firstPriceWithShade, dists, 4000);
+        const rev2 = (0, mechanism_design_1.expectedRevenue)(mechanism_design_1.secondPriceSealed, dists, 4000);
+        // Ambos deberían dar ~1/3 (resultado clásico para n=2, uniform[0,1]).
+        // Banda ancha por Monte Carlo (4k samples).
+        (0, vitest_1.expect)(rev1).toBeGreaterThan(0.27);
+        (0, vitest_1.expect)(rev1).toBeLessThan(0.4);
+        (0, vitest_1.expect)(rev2).toBeGreaterThan(0.27);
+        (0, vitest_1.expect)(rev2).toBeLessThan(0.4);
+        (0, vitest_1.expect)(Math.abs(rev1 - rev2)).toBeLessThan(0.05);
+    });
+    (0, vitest_1.it)('Myerson optimal supera (o iguala) a 2nd-price sin reserve en expected revenue', () => {
+        const u = (0, mechanism_design_1.uniformDistribution)(0, 1);
+        const dists = new Map([
+            ['a', u],
+            ['b', u],
+        ]);
+        const myer = (0, mechanism_design_1.expectedRevenue)((bids) => {
+            const r = (0, mechanism_design_1.myersonOptimal)(bids, dists);
+            return { winner: r.winner, payment: r.payment };
+        }, dists, 4000);
+        const second = (0, mechanism_design_1.expectedRevenue)(mechanism_design_1.secondPriceSealed, dists, 4000);
+        // Myerson > 2nd-price (reserve eleva el precio mínimo).
+        // Para n=2 uniform[0,1]: 2nd-price = 1/3 ≈ 0.333; Myerson = 5/12 ≈ 0.417.
+        (0, vitest_1.expect)(myer).toBeGreaterThan(second - 0.02);
+    });
+});
+(0, vitest_1.describe)('mechanism-design — invariants', () => {
+    (0, vitest_1.it)('VCG payments son no-negativos para valuations no-negativas', () => {
+        const items = ['x', 'y', 'z'];
+        const agents = [
+            agent('a', { x: 7, y: 3, z: 1 }),
+            agent('b', { x: 4, y: 8, z: 2 }),
+            agent('c', { x: 1, y: 1, z: 9 }),
+        ];
+        const out = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        for (const p of out.payments.values()) {
+            (0, vitest_1.expect)(p).toBeGreaterThanOrEqual(-1e-9);
+        }
+    });
+    (0, vitest_1.it)('Allocation de VCG no asigna el mismo item a dos agentes', () => {
+        const items = ['x', 'y'];
+        const agents = [
+            agent('a', { x: 5, y: 5 }),
+            agent('b', { x: 5, y: 5 }),
+            agent('c', { x: 5, y: 5 }),
+        ];
+        const out = (0, mechanism_design_1.vcgMechanism)(agents, items);
+        const assigned = [...out.allocation.values()];
+        const unique = new Set(assigned);
+        (0, vitest_1.expect)(unique.size).toBe(assigned.length);
+    });
+});
+//# sourceMappingURL=mechanism-design.test.js.map

package/dist/tests/reasoning/mechanism-design/mechanism-design.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mechanism-design.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/mechanism-design/mechanism-design.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,0EAe6C;AAE7C,SAAS,KAAK,CAAC,EAAU,EAAE,IAA4B;IACrD,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5F,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,wEAAwE;QACxE,mEAAmE;QACnE,IAAA,eAAM,EAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,wEAAwE;QACxE,sDAAsD;QACtD,IAAA,eAAM,EAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG;YACb,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;SAC3B,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,IAAA,gCAAa,EAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,GAAG,IAAA,kCAAe,EAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAA,+BAAY,EAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG;YACb,sEAAsE;YACtE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACrC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;SACrC,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,8EAA8E;QAC9E,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,iEAAiE;QACjE,IAAA,eAAM,EAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,mCAAgB,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,EAAE,CAAC;YACT,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,oCAAiB,EAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5F,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,EAAE,CAAC;YACT,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,IAAA,oCAAiB,EAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,mCAAgB,EAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,oCAAiB,EAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,mCAAgB,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,oCAAiB,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,IAAA,oCAAiB,EAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,EAAE,CAAC;YACT,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,iCAAc,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,4DAA4D;QAC5D,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,GAAG,EAAE,EAAE,CAAC;SACV,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,iCAAc,EAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,4CAA4C;QAC5C,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,0DAA0D;QAC1D,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC;YACtB,CAAC,GAAG,EAAE,EAAE,CAAC;YACT,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,+BAAY,EAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,6CAA6C;QAC7C,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,+BAAY,EAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,mCAAgB,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,mCAAgB,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,IAAA,mCAAgB,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,8BAAW,EAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,CAAC,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAA6B;YAChD,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,GAAG,EAAE,GAAG,CAAC;SACX,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,iCAAc,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,uDAAuD;QACvD,kEAAkE;QAClE,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAA6B;YAChD,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,GAAG,EAAE,GAAG,CAAC;SACX,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,iCAAc,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAA6B;YAChD,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,GAAG,EAAE,GAAG,CAAC;SACX,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,iCAAc,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,8DAA8D;QAC9D,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,6DAA6D;QAC7D,4DAA4D;QAC5D,MAAM,CAAC,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAA6B;YAChD,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QAEH,8DAA8D;QAC9D,MAAM,mBAAmB,GAAG,CAAC,IAAyB,EAAE,EAAE;YACxD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;YACzC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;YACpD,OAAO,IAAA,mCAAgB,EAAC,MAAM,CAAC,CAAC;QAClC,CAAC,CAAC;QAEF,MAAM,IAAI,GAAG,IAAA,kCAAe,EAAC,mBAAmB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC/D,MAAM,IAAI,GAAG,IAAA,kCAAe,EAAC,oCAAiB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAE7D,sEAAsE;QACtE,4CAA4C;QAC5C,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,MAAM,CAAC,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAA6B;YAChD,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC;SACT,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,kCAAe,EAC1B,CAAC,IAAI,EAAE,EAAE;YACP,MAAM,CAAC,GAAG,IAAA,iCAAc,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACtC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QAClD,CAAC,EACD,KAAK,EACL,IAAI,CACL,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,kCAAe,EAAC,oCAAiB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC/D,wDAAwD;QACxD,0EAA0E;QAC1E,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,eAAe,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG;YACb,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;SACjC,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG;YACb,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;SAC3B,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,+BAAY,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC5C,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":""}