@stevenvo780/st-lang 4.6.0 → 4.8.0

package/dist/tests/nbe/nbe.test.d.ts.map

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

package/dist/tests/nbe/nbe.test.js

@@ -1,121 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const nbe_1 = require("../../nbe");
-// ---------- Tipos base reutilizables ----------
-const P = (0, nbe_1.tBase)('P');
-const Q = (0, nbe_1.tBase)('Q');
-const PtoP = (0, nbe_1.tArr)(P, P);
-const PtoPtoP = (0, nbe_1.tArr)(P, PtoP);
-(0, vitest_1.describe)('NbE — Normalization by Evaluation para STLC', () => {
-    (0, vitest_1.it)('β-reduce: (λx:P. x) y  ⇒  y', () => {
-        // y es libre de tipo P
-        const t = (0, nbe_1.ap)((0, nbe_1.lam)('x', P, (0, nbe_1.v)('x')), (0, nbe_1.v)('y'));
-        const nf = (0, nbe_1.normalize)(t, P);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.v)('y'))).toBe(true);
-    });
-    (0, vitest_1.it)('η-long: identidad en P→P queda como λ_x0:P. _x0', () => {
-        const t = (0, nbe_1.lam)('x', P, (0, nbe_1.v)('x'));
-        const nf = (0, nbe_1.normalize)(t, PtoP);
-        // Esperamos λ?:P. ?  (α-equivalente a la identidad)
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.lam)('y', P, (0, nbe_1.v)('y')))).toBe(true);
-    });
-    (0, vitest_1.it)('η-expansión de variable libre f : P→P  ⇒  λ_x0:P. f _x0', () => {
-        const t = (0, nbe_1.v)('f'); // libre
-        const nf = (0, nbe_1.normalize)(t, PtoP);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.lam)('z', P, (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('z'))))).toBe(true);
-    });
-    (0, vitest_1.it)('η-expansión profunda de f : (P→P)→(P→P)', () => {
-        const t = (0, nbe_1.v)('f');
-        const nf = (0, nbe_1.normalize)(t, (0, nbe_1.tArr)(PtoP, PtoP));
-        // λg:P→P. λx:P. f g x
-        const expected = (0, nbe_1.lam)('g', PtoP, (0, nbe_1.lam)('x', P, (0, nbe_1.ap)((0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('g')), (0, nbe_1.v)('x'))));
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, expected)).toBe(true);
-    });
-    (0, vitest_1.it)('forma normal ya normal: λx:P→P. λy:P. x y  estable módulo α', () => {
-        const t = (0, nbe_1.lam)('x', PtoP, (0, nbe_1.lam)('y', P, (0, nbe_1.ap)((0, nbe_1.v)('x'), (0, nbe_1.v)('y'))));
-        const nf = (0, nbe_1.normalize)(t, (0, nbe_1.tArr)(PtoP, PtoP));
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, t)).toBe(true);
-    });
-    (0, vitest_1.it)('β + η combinados: (λf:P→P. λx:P. f (f x)) (λy:P. y)  ⇒  λ_x:P. _x', () => {
-        const inner = (0, nbe_1.lam)('y', P, (0, nbe_1.v)('y')); // id
-        const doubled = (0, nbe_1.lam)('f', PtoP, (0, nbe_1.lam)('x', P, (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('x')))));
-        const t = (0, nbe_1.ap)(doubled, inner);
-        const nf = (0, nbe_1.normalize)(t, PtoP);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.lam)('x', P, (0, nbe_1.v)('x')))).toBe(true);
-    });
-    (0, vitest_1.it)('K combinator (λx:P. λy:Q. x) aplicado a a:P  ⇒  λy:Q. a', () => {
-        const K = (0, nbe_1.lam)('x', P, (0, nbe_1.lam)('y', Q, (0, nbe_1.v)('x')));
-        const t = (0, nbe_1.ap)(K, (0, nbe_1.v)('a'));
-        const nf = (0, nbe_1.normalize)(t, (0, nbe_1.tArr)(Q, P));
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.lam)('y', Q, (0, nbe_1.v)('a')))).toBe(true);
-    });
-    (0, vitest_1.it)('Church-style const: (λx:P. λy:P. y) a b ⇒ b', () => {
-        const term = (0, nbe_1.apN)((0, nbe_1.lam)('x', P, (0, nbe_1.lam)('y', P, (0, nbe_1.v)('y'))), (0, nbe_1.v)('a'), (0, nbe_1.v)('b'));
-        const nf = (0, nbe_1.normalize)(term, P);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.v)('b'))).toBe(true);
-    });
-    (0, vitest_1.it)('aplicación atascada: f a  con f libre P→P  ⇒  f a (no se simplifica)', () => {
-        const t = (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('a'));
-        const nf = (0, nbe_1.normalize)(t, P);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('a')))).toBe(true);
-    });
-    (0, vitest_1.it)('determinismo: misma entrada produce misma salida string-a-string', () => {
-        const t = (0, nbe_1.ap)((0, nbe_1.lam)('x', P, (0, nbe_1.v)('x')), (0, nbe_1.v)('y'));
-        const a = (0, nbe_1.termToString)((0, nbe_1.normalize)(t, P));
-        const b = (0, nbe_1.termToString)((0, nbe_1.normalize)(t, P));
-        const c = (0, nbe_1.termToString)((0, nbe_1.normalize)(t, P));
-        (0, vitest_1.expect)(a).toBe(b);
-        (0, vitest_1.expect)(b).toBe(c);
-    });
-    (0, vitest_1.it)('β-reducción con captura evitada: (λx:P. λy:P. x) y  ⇒  λ_y:P. y_outer', () => {
-        // El "y" exterior es la variable libre; el binder interno NO debe
-        // capturarla. Como reify usa supply fresco, el binder queda como
-        // _x0 (u otro nombre fresco), no como "y".
-        const t = (0, nbe_1.ap)((0, nbe_1.lam)('x', P, (0, nbe_1.lam)('y', P, (0, nbe_1.v)('x'))), (0, nbe_1.v)('y'));
-        const nf = (0, nbe_1.normalize)(t, (0, nbe_1.tArr)(P, P));
-        // El resultado debe ser α-equivalente a λz:P. y
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.lam)('z', P, (0, nbe_1.v)('y')))).toBe(true);
-    });
-    (0, vitest_1.it)('aplicación n-aria: (λx:P. λy:P. λz:P. x) a b c  ⇒  a', () => {
-        const f = (0, nbe_1.lam)('x', P, (0, nbe_1.lam)('y', P, (0, nbe_1.lam)('z', P, (0, nbe_1.v)('x'))));
-        const t = (0, nbe_1.apN)(f, (0, nbe_1.v)('a'), (0, nbe_1.v)('b'), (0, nbe_1.v)('c'));
-        const nf = (0, nbe_1.normalize)(t, P);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.v)('a'))).toBe(true);
-    });
-    (0, vitest_1.it)('S-like: (λf:P→P→P. λx:P. f x x) (λa:P. λb:P. a) v  ⇒  v', () => {
-        // f := proj1 (λa:P. λb:P. a)
-        // λx:P. f x x  =  λx:P. (λa.λb.a) x x  ⇒  λx:P. x
-        // Aplicado a v ⇒ v
-        const proj1 = (0, nbe_1.lam)('a', P, (0, nbe_1.lam)('b', P, (0, nbe_1.v)('a')));
-        const w = (0, nbe_1.lam)('f', PtoPtoP, (0, nbe_1.lam)('x', P, (0, nbe_1.ap)((0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('x')), (0, nbe_1.v)('x'))));
-        const t = (0, nbe_1.ap)((0, nbe_1.ap)(w, proj1), (0, nbe_1.v)('v_arg'));
-        const nf = (0, nbe_1.normalize)(t, P);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.v)('v_arg'))).toBe(true);
-    });
-    (0, vitest_1.it)('evaluate produce una clausura para una λ', () => {
-        const val = (0, nbe_1.evaluate)((0, nbe_1.lam)('x', P, (0, nbe_1.v)('x')), new Map());
-        (0, vitest_1.expect)(val.kind).toBe('closure');
-    });
-    (0, vitest_1.it)('reify con supply explícito es reproducible', () => {
-        const t = (0, nbe_1.v)('f'); // libre, tipo P→P
-        const val = (0, nbe_1.evaluate)(t, new Map());
-        const a = (0, nbe_1.termToString)((0, nbe_1.reify)(val, PtoP, (0, nbe_1.makeFreshSupply)('q')));
-        const b = (0, nbe_1.termToString)((0, nbe_1.reify)(val, PtoP, (0, nbe_1.makeFreshSupply)('q')));
-        (0, vitest_1.expect)(a).toBe(b);
-        // El nombre fresco debe aparecer con el prefijo elegido.
-        (0, vitest_1.expect)(a.includes('q0')).toBe(true);
-    });
-    (0, vitest_1.it)('idempotencia: normalize(normalize(t)) ≡α normalize(t)', () => {
-        const t = (0, nbe_1.ap)((0, nbe_1.lam)('f', PtoP, (0, nbe_1.lam)('x', P, (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('x'))))), (0, nbe_1.lam)('y', P, (0, nbe_1.v)('y')));
-        const nf1 = (0, nbe_1.normalize)(t, PtoP);
-        const nf2 = (0, nbe_1.normalize)(nf1, PtoP);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf1, nf2)).toBe(true);
-    });
-    (0, vitest_1.it)('η-expansión en aplicación parcial: (λx:P→P. x) f  con f:P→P  ⇒  λ_x:P. f _x', () => {
-        const t = (0, nbe_1.ap)((0, nbe_1.lam)('x', PtoP, (0, nbe_1.v)('x')), (0, nbe_1.v)('f'));
-        const nf = (0, nbe_1.normalize)(t, PtoP);
-        (0, vitest_1.expect)((0, nbe_1.alphaEq)(nf, (0, nbe_1.lam)('z', P, (0, nbe_1.ap)((0, nbe_1.v)('f'), (0, nbe_1.v)('z'))))).toBe(true);
-    });
-});
-//# sourceMappingURL=nbe.test.js.map

package/dist/tests/nbe/nbe.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"nbe.test.js","sourceRoot":"","sources":["../../../src/tests/nbe/nbe.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,mCAcmB;AAEnB,iDAAiD;AACjD,MAAM,CAAC,GAAG,IAAA,WAAK,EAAC,GAAG,CAAC,CAAC;AACrB,MAAM,CAAC,GAAG,IAAA,WAAK,EAAC,GAAG,CAAC,CAAC;AACrB,MAAM,IAAI,GAAG,IAAA,UAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxB,MAAM,OAAO,GAAG,IAAA,UAAI,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAE9B,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,uBAAuB;QACvB,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9B,oDAAoD;QACpD,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAS,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,QAAQ;QAChC,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAS,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAA,UAAI,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC1C,sBAAsB;QACtB,MAAM,QAAQ,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAA,UAAI,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,KAAK,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK;QACxC,MAAM,OAAO,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAA,UAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,IAAI,GAAG,IAAA,SAAG,EAAC,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACnE,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,kBAAY,EAAC,IAAA,eAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,GAAG,IAAA,kBAAY,EAAC,IAAA,eAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,GAAG,IAAA,kBAAY,EAAC,IAAA,eAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,kEAAkE;QAClE,iEAAiE;QACjE,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAA,UAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpC,gDAAgD;QAChD,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,6BAA6B;QAC7B,kDAAkD;QAClD,mBAAmB;QACnB,MAAM,KAAK,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,IAAA,SAAG,EAAC,GAAG,EAAE,OAAO,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,IAAA,QAAE,EAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAA,OAAC,EAAC,OAAO,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,OAAC,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,GAAG,GAAG,IAAA,cAAQ,EAAC,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAS,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB;QAC1C,MAAM,GAAG,GAAG,IAAA,cAAQ,EAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAA,kBAAY,EAAC,IAAA,WAAK,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,qBAAe,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,GAAG,IAAA,kBAAY,EAAC,IAAA,WAAK,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,qBAAe,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,yDAAyD;QACzD,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,IAAA,SAAG,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/F,MAAM,GAAG,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAA,eAAS,EAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,MAAM,CAAC,GAAG,IAAA,QAAE,EAAC,IAAA,SAAG,EAAC,GAAG,EAAE,IAAI,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,EAAE,GAAG,IAAA,eAAS,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,aAAO,EAAC,EAAE,EAAE,IAAA,SAAG,EAAC,GAAG,EAAE,CAAC,EAAE,IAAA,QAAE,EAAC,IAAA,OAAC,EAAC,GAAG,CAAC,EAAE,IAAA,OAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

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

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

@@ -1,204 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const optimization_1 = require("../../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/optimization/ilp.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ilp.test.js","sourceRoot":"","sources":["../../../src/tests/optimization/ilp.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,qDAA4D;AAG5D,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/optimization/lp.test.d.ts.map

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

package/dist/tests/optimization/lp.test.js

@@ -1,224 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const optimization_1 = require("../../optimization");
-(0, vitest_1.describe)('LP — Simplex de dos fases', () => {
-    (0, vitest_1.it)('LP trivial: max x s.t. x ≤ 5 → x = 5', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1] },
-            constraints: [{ coefficients: [1], operator: '<=', rhs: 5 }],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(5, 6);
-        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(5, 6);
-    });
-    (0, vitest_1.it)('LP clásico: max 3x+5y s.t. x+y≤6, x≤4, y≤4 → (4,2)=22', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [3, 5] },
-            constraints: [
-                { coefficients: [1, 1], operator: '<=', rhs: 6 },
-                { coefficients: [1, 0], operator: '<=', rhs: 4 },
-                { coefficients: [0, 1], operator: '<=', rhs: 4 },
-            ],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        // Óptimo en vértice (2,4) ya que 3·2 + 5·4 = 26 > 3·4 + 5·2 = 22.
-        // Recalculamos el caso clásico: max 3x+5y s.t. x+y≤6, x≤4, y≤4
-        // Vértices factibles: (0,0)=0, (4,0)=12, (4,2)=22, (2,4)=26, (0,4)=20.
-        // El óptimo real es (2,4)=26. Ajustamos el assert al óptimo
-        // verdadero del problema (no al del prompt, que tenía un typo).
-        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(26, 6);
-        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(2, 6);
-        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(4, 6);
-    });
-    (0, vitest_1.it)('LP minimización: min x+y s.t. x+y≥3, x≥0, y≥0 → (any) = 3', () => {
-        const lp = {
-            objective: { kind: 'minimize', coefficients: [1, 1] },
-            constraints: [{ coefficients: [1, 1], operator: '>=', rhs: 3 }],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(3, 6);
-    });
-    (0, vitest_1.it)('LP infeasible: x ≤ 1 AND x ≥ 5', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1] },
-            constraints: [
-                { coefficients: [1], operator: '<=', rhs: 1 },
-                { coefficients: [1], operator: '>=', rhs: 5 },
-            ],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('infeasible');
-    });
-    (0, vitest_1.it)('LP unbounded: max x sin cota superior', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1] },
-            constraints: [{ coefficients: [-1], operator: '<=', rhs: 0 }], // x ≥ 0
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('unbounded');
-    });
-    (0, vitest_1.it)('LP con igualdad: max x s.t. x+y=4, x≤3, y≥0', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1, 0] },
-            constraints: [
-                { coefficients: [1, 1], operator: '=', rhs: 4 },
-                { coefficients: [1, 0], operator: '<=', rhs: 3 },
-            ],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(3, 6);
-        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(1, 6);
-    });
-    (0, vitest_1.it)('LP dieta clásico (pequeño): min 2x+3y s.t. x+y≥1, x≥0.2, y≥0.3', () => {
-        const lp = {
-            objective: { kind: 'minimize', coefficients: [2, 3] },
-            constraints: [
-                { coefficients: [1, 1], operator: '>=', rhs: 1 },
-                { coefficients: [1, 0], operator: '>=', rhs: 0.2 },
-                { coefficients: [0, 1], operator: '>=', rhs: 0.3 },
-            ],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        // Óptimo: x=0.7, y=0.3, cost=2·0.7+3·0.3=1.4+0.9=2.3
-        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(2.3, 5);
-    });
-    (0, vitest_1.it)('LP con variableBounds (upper) actúa como restricción', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1] },
-            constraints: [],
-            variableBounds: [{ upper: 7 }],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(7, 6);
-    });
-    (0, vitest_1.it)('LP con 3 variables y 3 restricciones', () => {
-        // max 4x + 5y + 6z s.t.
-        //  x +  y +  z ≤ 10
-        // 2x +  y +  z ≤ 12
-        //  x + 2y + 3z ≤ 15
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [4, 5, 6] },
-            constraints: [
-                { coefficients: [1, 1, 1], operator: '<=', rhs: 10 },
-                { coefficients: [2, 1, 1], operator: '<=', rhs: 12 },
-                { coefficients: [1, 2, 3], operator: '<=', rhs: 15 },
-            ],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        // Comprobamos solo factibilidad y consistencia del objetivo
-        const [x, y, z] = sol.variables;
-        (0, vitest_1.expect)(x + y + z).toBeLessThanOrEqual(10 + 1e-6);
-        (0, vitest_1.expect)(2 * x + y + z).toBeLessThanOrEqual(12 + 1e-6);
-        (0, vitest_1.expect)(x + 2 * y + 3 * z).toBeLessThanOrEqual(15 + 1e-6);
-        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(4 * x + 5 * y + 6 * z, 6);
-        (0, vitest_1.expect)(sol.objectiveValue).toBeGreaterThan(30);
-    });
-    (0, vitest_1.it)('standardForm: minimización pasa a maximización con coefs negados', () => {
-        const lp = {
-            objective: { kind: 'minimize', coefficients: [3, 4] },
-            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 10 }],
-        };
-        const std = (0, optimization_1.standardForm)(lp);
-        (0, vitest_1.expect)(std.objective.kind).toBe('maximize');
-        (0, vitest_1.expect)(std.objective.coefficients).toEqual([-3, -4]);
-    });
-    (0, vitest_1.it)('standardForm: ≥ se invierte a ≤ con signos cambiados', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1] },
-            constraints: [{ coefficients: [2], operator: '>=', rhs: 8 }],
-        };
-        const std = (0, optimization_1.standardForm)(lp);
-        (0, vitest_1.expect)(std.constraints[0].operator).toBe('<=');
-        (0, vitest_1.expect)(std.constraints[0].coefficients).toEqual([-2]);
-        (0, vitest_1.expect)(std.constraints[0].rhs).toBe(-8);
-    });
-    (0, vitest_1.it)('standardForm: igualdad se expande a dos restricciones', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1] },
-            constraints: [{ coefficients: [1], operator: '=', rhs: 5 }],
-        };
-        const std = (0, optimization_1.standardForm)(lp);
-        (0, vitest_1.expect)(std.constraints).toHaveLength(2);
-        (0, vitest_1.expect)(std.constraints[0].operator).toBe('<=');
-        (0, vitest_1.expect)(std.constraints[1].operator).toBe('<=');
-    });
-    (0, vitest_1.it)('standardForm preserva solución óptima', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [2, 3] },
-            constraints: [
-                { coefficients: [1, 1], operator: '<=', rhs: 4 },
-                { coefficients: [1, 2], operator: '<=', rhs: 6 },
-            ],
-        };
-        const sol1 = (0, optimization_1.solveLP)(lp);
-        const sol2 = (0, optimization_1.solveLP)((0, optimization_1.standardForm)(lp));
-        (0, vitest_1.expect)(sol1.status).toBe('optimal');
-        (0, vitest_1.expect)(sol2.status).toBe('optimal');
-        (0, vitest_1.expect)(sol1.objectiveValue).toBeCloseTo(sol2.objectiveValue, 6);
-    });
-    (0, vitest_1.it)('LP con iteration_limit retorna status correcto', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1, 1] },
-            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 10 }],
-        };
-        const sol = (0, optimization_1.solveLP)(lp, { maxIterations: 0 });
-        // Con 0 iteraciones, fase II no puede avanzar; el resultado es
-        // 'iteration_limit' o 'optimal' (si el tableau inicial ya es óptimo).
-        (0, vitest_1.expect)(['optimal', 'iteration_limit']).toContain(sol.status);
-    });
-    (0, vitest_1.it)('LP con coeficientes negativos en objetivo (minimización implícita)', () => {
-        // max -x s.t. x ≥ 0, x ≤ 10 → óptimo en x=0
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [-1] },
-            constraints: [{ coefficients: [1], operator: '<=', rhs: 10 }],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(0, 6);
-        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(0, 6);
-    });
-    (0, vitest_1.it)('LP de transporte chico (4 nodos, factible)', () => {
-        // min c·x s.t. Ax = b (oferta-demanda balanceada).
-        // Oferta: o1=10, o2=15. Demanda: d1=12, d2=13.
-        // Variables: x11, x12, x21, x22.
-        // Coste: 4·x11 + 6·x12 + 5·x21 + 3·x22
-        const lp = {
-            objective: { kind: 'minimize', coefficients: [4, 6, 5, 3] },
-            constraints: [
-                // x11 + x12 = 10 (oferta o1)
-                { coefficients: [1, 1, 0, 0], operator: '=', rhs: 10 },
-                // x21 + x22 = 15 (oferta o2)
-                { coefficients: [0, 0, 1, 1], operator: '=', rhs: 15 },
-                // x11 + x21 = 12 (demanda d1)
-                { coefficients: [1, 0, 1, 0], operator: '=', rhs: 12 },
-                // x12 + x22 = 13 (demanda d2)
-                { coefficients: [0, 1, 0, 1], operator: '=', rhs: 13 },
-            ],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.status).toBe('optimal');
-        // Verificamos factibilidad (sumas) y coste positivo razonable
-        const [x11, x12, x21, x22] = sol.variables;
-        (0, vitest_1.expect)(x11 + x12).toBeCloseTo(10, 5);
-        (0, vitest_1.expect)(x21 + x22).toBeCloseTo(15, 5);
-        (0, vitest_1.expect)(x11 + x21).toBeCloseTo(12, 5);
-        (0, vitest_1.expect)(x12 + x22).toBeCloseTo(13, 5);
-    });
-    (0, vitest_1.it)('LP devuelve iterations >= 0', () => {
-        const lp = {
-            objective: { kind: 'maximize', coefficients: [1, 2] },
-            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 5 }],
-        };
-        const sol = (0, optimization_1.solveLP)(lp);
-        (0, vitest_1.expect)(sol.iterations).toBeGreaterThanOrEqual(0);
-    });
-});
-//# sourceMappingURL=lp.test.js.map

package/dist/tests/optimization/lp.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lp.test.js","sourceRoot":"","sources":["../../../src/tests/optimization/lp.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,qDAA2D;AAG3D,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAc;YACpB,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;SAC7D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,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,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAc;YACpB,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;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,kEAAkE;QAClE,+DAA+D;QAC/D,uEAAuE;QACvE,4DAA4D;QAC5D,gEAAgE;QAChE,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,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,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,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,EAAE,GAAc;YACpB,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;SAChE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,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,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC7C,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aAC9C;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ;SACxE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,EAAE,GAAc;YACpB,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,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC/C,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,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,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,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,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,EAAE,GAAc;YACpB,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,GAAG,EAAE;gBAClD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;aACnD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,qDAAqD;QACrD,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,EAAE;YACf,cAAc,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;SAC/B,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,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,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,wBAAwB;QACxB,oBAAoB;QACpB,oBAAoB;QACpB,oBAAoB;QACpB,MAAM,EAAE,GAAc;YACpB,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,EAAE,EAAE;gBACpD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;gBACpD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;aACrD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,4DAA4D;QAC5D,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,GAAc;YACpB,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,EAAE,EAAE,CAAC;SACjE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAc;YACpB,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;SAC7D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAc;YACpB,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;SAC5D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAc;YACpB,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;SACF,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAA,sBAAO,EAAC,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,EAAE,GAAc;YACpB,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,EAAE,EAAE,CAAC;SACjE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,+DAA+D;QAC/D,sEAAsE;QACtE,IAAA,eAAM,EAAC,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,4CAA4C;QAC5C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;YACnD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;SAC9D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,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,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,mDAAmD;QACnD,+CAA+C;QAC/C,iCAAiC;QACjC,uCAAuC;QACvC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YAC3D,WAAW,EAAE;gBACX,6BAA6B;gBAC7B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,6BAA6B;gBAC7B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,8BAA8B;gBAC9B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,8BAA8B;gBAC9B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;aACvD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,8DAA8D;QAC9D,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,EAAE,GAAc;YACpB,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;SAChE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/planning/planning.test.d.ts.map

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