@stevenvo780/st-lang 4.3.0 → 4.5.0

package/dist/tests/combinators-ski/combinators-ski.test.js

@@ -0,0 +1,211 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const combinators_ski_1 = require("../../combinators-ski");
+const lambda_calc_1 = require("../../lambda-calc");
+(0, vitest_1.describe)('combinators-ski / reducción básica', () => {
+    (0, vitest_1.it)('I x reduce a x en un paso', () => {
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.I)(), (0, combinators_ski_1.cvar)('x'));
+        const r = (0, combinators_ski_1.reduceStep)(t);
+        (0, vitest_1.expect)(r).not.toBeNull();
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(r, (0, combinators_ski_1.cvar)('x'))).toBe(true);
+    });
+    (0, vitest_1.it)('K x y reduce a x en un paso', () => {
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('x'), (0, combinators_ski_1.cvar)('y'));
+        const r = (0, combinators_ski_1.reduceStep)(t);
+        (0, vitest_1.expect)(r).not.toBeNull();
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(r, (0, combinators_ski_1.cvar)('x'))).toBe(true);
+    });
+    (0, vitest_1.it)('K x y descarta y aunque y tenga redex', () => {
+        // y = I z; tras K x (I z) debe quedar x — sin reducir el segundo arg.
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('x'), (0, combinators_ski_1.app)((0, combinators_ski_1.I)(), (0, combinators_ski_1.cvar)('z')));
+        const norm = (0, combinators_ski_1.normalize)(t);
+        (0, vitest_1.expect)(norm.terminated).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(norm.result, (0, combinators_ski_1.cvar)('x'))).toBe(true);
+    });
+    (0, vitest_1.it)('S x y z reduce a x z (y z)', () => {
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.S)(), (0, combinators_ski_1.cvar)('x'), (0, combinators_ski_1.cvar)('y'), (0, combinators_ski_1.cvar)('z'));
+        const r = (0, combinators_ski_1.reduceStep)(t);
+        (0, vitest_1.expect)(r).not.toBeNull();
+        const expected = (0, combinators_ski_1.app)((0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('x'), (0, combinators_ski_1.cvar)('z')), (0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('y'), (0, combinators_ski_1.cvar)('z')));
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(r, expected)).toBe(true);
+    });
+    (0, vitest_1.it)('S K K x reduce a x (= I)', () => {
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.S)(), (0, combinators_ski_1.K)(), (0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('x'));
+        const norm = (0, combinators_ski_1.normalize)(t);
+        (0, vitest_1.expect)(norm.terminated).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(norm.result, (0, combinators_ski_1.cvar)('x'))).toBe(true);
+    });
+    (0, vitest_1.it)('isNormalForm: variable libre sola es forma normal', () => {
+        (0, vitest_1.expect)((0, combinators_ski_1.isNormalForm)((0, combinators_ski_1.cvar)('x'))).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.isNormalForm)((0, combinators_ski_1.I)())).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.isNormalForm)((0, combinators_ski_1.K)())).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.isNormalForm)((0, combinators_ski_1.S)())).toBe(true);
+    });
+    (0, vitest_1.it)('isNormalForm: K x sin segundo arg también es FN (under-applied)', () => {
+        // K x todavía no tiene los 2 args que necesita.
+        (0, vitest_1.expect)((0, combinators_ski_1.isNormalForm)((0, combinators_ski_1.app)((0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('x')))).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.isNormalForm)((0, combinators_ski_1.app)((0, combinators_ski_1.S)(), (0, combinators_ski_1.cvar)('x'), (0, combinators_ski_1.cvar)('y')))).toBe(true);
+    });
+    (0, vitest_1.it)('reduceStep baja por las ramas si no hay redex en cabeza', () => {
+        // (K x) (I y)  — la cabeza está under-applied a 1 arg; igual baja
+        // al subtérmino (I y) para reducirlo.
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.app)((0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('x')), (0, combinators_ski_1.app)((0, combinators_ski_1.I)(), (0, combinators_ski_1.cvar)('y')));
+        // Primer paso ahora reduce K x (I y) → x (atomic head, well-applied).
+        const r = (0, combinators_ski_1.reduceStep)(t);
+        (0, vitest_1.expect)(r).not.toBeNull();
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(r, (0, combinators_ski_1.cvar)('x'))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('combinators-ski / divergencia y maxSteps', () => {
+    (0, vitest_1.it)('un término divergente respeta maxSteps con terminated=false', () => {
+        // Omega-equivalente en SKI: SII(SII) — clásico divergente.
+        // x = SII;  x x = (SII)(SII) → I(SII)(I(SII)) → SII (SII) ...
+        const SII = (0, combinators_ski_1.app)((0, combinators_ski_1.S)(), (0, combinators_ski_1.I)(), (0, combinators_ski_1.I)());
+        const omega = (0, combinators_ski_1.app)(SII, SII);
+        const r = (0, combinators_ski_1.normalize)(omega, 50);
+        (0, vitest_1.expect)(r.terminated).toBe(false);
+        (0, vitest_1.expect)(r.steps).toBe(50);
+    });
+});
+(0, vitest_1.describe)('combinators-ski / bracket abstraction (λ → SKI)', () => {
+    (0, vitest_1.it)('abstractFromLambda(λx.x) = I', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x'));
+        const c = (0, combinators_ski_1.abstractFromLambda)(t);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(c, (0, combinators_ski_1.I)())).toBe(true);
+    });
+    (0, vitest_1.it)('abstractFromLambda(λx.λy.x) es equivalente a K', () => {
+        // [y] x = K x       (x ∉ FV(x)... pero x ≠ y, sí es K x)
+        // [x] (K x) = S (K K) I     (forma canónica, no sintácticamente K)
+        // Aplicado a dos args debe colapsar a x.
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x')));
+        const c = (0, combinators_ski_1.abstractFromLambda)(t);
+        // Test semántico: aplicado a (a, b) debe normalizar a `a`.
+        const applied = (0, combinators_ski_1.app)(c, (0, combinators_ski_1.cvar)('a'), (0, combinators_ski_1.cvar)('b'));
+        const norm = (0, combinators_ski_1.normalize)(applied);
+        (0, vitest_1.expect)(norm.terminated).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(norm.result, (0, combinators_ski_1.cvar)('a'))).toBe(true);
+    });
+    (0, vitest_1.it)('abstractFromLambda(λx.λy.λz. x z (y z)) es equivalente a S', () => {
+        // S = λx.λy.λz. x z (y z)
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.apN)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('z'), (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('y'), (0, lambda_calc_1.v)('z'))))));
+        const c = (0, combinators_ski_1.abstractFromLambda)(t);
+        // Aplicado a (f, g, h) debe normalizar a f h (g h).
+        const applied = (0, combinators_ski_1.app)(c, (0, combinators_ski_1.cvar)('f'), (0, combinators_ski_1.cvar)('g'), (0, combinators_ski_1.cvar)('h'));
+        const norm = (0, combinators_ski_1.normalize)(applied);
+        (0, vitest_1.expect)(norm.terminated).toBe(true);
+        const expected = (0, combinators_ski_1.app)((0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('f'), (0, combinators_ski_1.cvar)('h')), (0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('g'), (0, combinators_ski_1.cvar)('h')));
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(norm.result, expected)).toBe(true);
+    });
+    (0, vitest_1.it)('abstractFromLambda(λx.y) = K y (constante respecto a x)', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('y'));
+        const c = (0, combinators_ski_1.abstractFromLambda)(t);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(c, (0, combinators_ski_1.app)((0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('y')))).toBe(true);
+    });
+    (0, vitest_1.it)('abstractFromLambda(λx.λy. x y) es equivalente a I aplicado', () => {
+        // λx.λy. x y  ≡  λx. x    bajo η (en λ-cálculo).
+        // SKI bracket genera algo más grande; lo probamos vía aplicación.
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y'))));
+        const c = (0, combinators_ski_1.abstractFromLambda)(t);
+        const applied = (0, combinators_ski_1.app)(c, (0, combinators_ski_1.cvar)('f'), (0, combinators_ski_1.cvar)('a'));
+        const norm = (0, combinators_ski_1.normalize)(applied);
+        (0, vitest_1.expect)(norm.terminated).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(norm.result, (0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('f'), (0, combinators_ski_1.cvar)('a')))).toBe(true);
+    });
+    (0, vitest_1.it)('abstractFromLambda no contiene abstracciones (sólo S/K/I/var/app)', () => {
+        // Cualquier λ-término debe traducirse a una expresión de combinadores pura.
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.apN)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('z'), (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('y'), (0, lambda_calc_1.v)('z'))))));
+        const c = (0, combinators_ski_1.abstractFromLambda)(t);
+        assertNoBinders(c);
+    });
+});
+(0, vitest_1.describe)('combinators-ski / round-trip semántico', () => {
+    (0, vitest_1.it)('toLambda(I), toLambda(K), toLambda(S) son las definiciones λ canónicas', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, combinators_ski_1.toLambda)((0, combinators_ski_1.I)()), (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x')))).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, combinators_ski_1.toLambda)((0, combinators_ski_1.K)()), (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x'))))).toBe(true);
+        const Slam = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.apN)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('z'), (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('y'), (0, lambda_calc_1.v)('z'))))));
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, combinators_ski_1.toLambda)((0, combinators_ski_1.S)()), Slam)).toBe(true);
+    });
+    (0, vitest_1.it)('round-trip λ → SKI → λ preserva la semántica aplicada (identidad)', () => {
+        // Aplicamos `(λx.x) a` y `(toLambda(abstract(λx.x))) a` y comparamos formas normales.
+        const idLam = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x'));
+        const skis = (0, combinators_ski_1.abstractFromLambda)(idLam);
+        const lamBack = (0, combinators_ski_1.toLambda)(skis);
+        const lhs = (0, lambda_calc_1.normalize)((0, lambda_calc_1.ap)(idLam, (0, lambda_calc_1.v)('a')));
+        const rhs = (0, lambda_calc_1.normalize)((0, lambda_calc_1.ap)(lamBack, (0, lambda_calc_1.v)('a')));
+        (0, vitest_1.expect)(lhs.terminated).toBe(true);
+        (0, vitest_1.expect)(rhs.terminated).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(lhs.result, rhs.result)).toBe(true);
+    });
+    (0, vitest_1.it)('round-trip preserva semántica de K aplicado a (a, b)', () => {
+        const Klam = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x')));
+        const skis = (0, combinators_ski_1.abstractFromLambda)(Klam);
+        const lamBack = (0, combinators_ski_1.toLambda)(skis);
+        const applied = (0, lambda_calc_1.apN)(lamBack, (0, lambda_calc_1.v)('a'), (0, lambda_calc_1.v)('b'));
+        const norm = (0, lambda_calc_1.normalize)(applied);
+        (0, vitest_1.expect)(norm.terminated).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(norm.result, (0, lambda_calc_1.v)('a'))).toBe(true);
+    });
+    (0, vitest_1.it)('round-trip preserva semántica de S aplicado a (f, g, h)', () => {
+        const Slam = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.apN)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('z'), (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('y'), (0, lambda_calc_1.v)('z'))))));
+        const skis = (0, combinators_ski_1.abstractFromLambda)(Slam);
+        const lamBack = (0, combinators_ski_1.toLambda)(skis);
+        const applied = (0, lambda_calc_1.apN)(lamBack, (0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('g'), (0, lambda_calc_1.v)('h'));
+        const norm = (0, lambda_calc_1.normalize)(applied);
+        (0, vitest_1.expect)(norm.terminated).toBe(true);
+        // Forma normal: f h (g h).
+        const expected = (0, lambda_calc_1.apN)((0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('h'), (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('g'), (0, lambda_calc_1.v)('h')));
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(norm.result, expected)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('combinators-ski / utilidades', () => {
+    (0, vitest_1.it)('termToString imprime aplicaciones asociativas a la izquierda', () => {
+        // S K K x  → "S K K x" (sin paréntesis: todo es app-izquierda)
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.S)(), (0, combinators_ski_1.K)(), (0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('x'));
+        (0, vitest_1.expect)((0, combinators_ski_1.termToString)(t)).toBe('S K K x');
+    });
+    (0, vitest_1.it)('termToString agrupa con paréntesis los args que son aplicaciones', () => {
+        // f (g x)
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('f'), (0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('g'), (0, combinators_ski_1.cvar)('x')));
+        (0, vitest_1.expect)((0, combinators_ski_1.termToString)(t)).toBe('f (g x)');
+    });
+    (0, vitest_1.it)('freeVars enumera variables libres', () => {
+        // S (K x) y  → libres: {x, y}
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.S)(), (0, combinators_ski_1.app)((0, combinators_ski_1.K)(), (0, combinators_ski_1.cvar)('x')), (0, combinators_ski_1.cvar)('y'));
+        const fv = (0, combinators_ski_1.freeVars)(t);
+        (0, vitest_1.expect)(fv.has('x')).toBe(true);
+        (0, vitest_1.expect)(fv.has('y')).toBe(true);
+        (0, vitest_1.expect)(fv.size).toBe(2);
+    });
+    (0, vitest_1.it)('app con un solo argumento devuelve el término tal cual', () => {
+        const t = (0, combinators_ski_1.app)((0, combinators_ski_1.cvar)('x'));
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)(t, (0, combinators_ski_1.cvar)('x'))).toBe(true);
+    });
+    (0, vitest_1.it)('app() sin argumentos lanza', () => {
+        (0, vitest_1.expect)(() => (0, combinators_ski_1.app)()).toThrow();
+    });
+    (0, vitest_1.it)('ctermEq distingue por estructura', () => {
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)((0, combinators_ski_1.I)(), (0, combinators_ski_1.I)())).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)((0, combinators_ski_1.K)(), (0, combinators_ski_1.S)())).toBe(false);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)((0, combinators_ski_1.cvar)('x'), (0, combinators_ski_1.cvar)('y'))).toBe(false);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)((0, combinators_ski_1.app)((0, combinators_ski_1.I)(), (0, combinators_ski_1.cvar)('x')), (0, combinators_ski_1.app)((0, combinators_ski_1.I)(), (0, combinators_ski_1.cvar)('x')))).toBe(true);
+        (0, vitest_1.expect)((0, combinators_ski_1.ctermEq)((0, combinators_ski_1.app)((0, combinators_ski_1.I)(), (0, combinators_ski_1.cvar)('x')), (0, combinators_ski_1.app)((0, combinators_ski_1.I)(), (0, combinators_ski_1.cvar)('y')))).toBe(false);
+    });
+});
+// Helper de test: confirma que un CTerm no contiene nodos de tipo 'abs'
+// (sería estructuralmente imposible en SKI, pero comprueba que el tipo
+// generado por bracket abstraction es realmente puro).
+function assertNoBinders(t) {
+    switch (t.kind) {
+        case 'S':
+        case 'K':
+        case 'I':
+        case 'var':
+            return;
+        case 'app':
+            assertNoBinders(t.fn);
+            assertNoBinders(t.arg);
+            return;
+    }
+}
+//# sourceMappingURL=combinators-ski.test.js.map

package/dist/tests/combinators-ski/combinators-ski.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"combinators-ski.test.js","sourceRoot":"","sources":["../../../src/tests/combinators-ski/combinators-ski.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,2DAc+B;AAE/B,mDAO2B;AAG3B,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAA,4BAAU,EAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,CAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,IAAA,4BAAU,EAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,CAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,IAAI,GAAG,IAAA,2BAAS,EAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAI,CAAC,MAAM,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,IAAA,4BAAU,EAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAA,qBAAG,EAAC,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,CAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAA,2BAAS,EAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAI,CAAC,MAAM,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,mBAAC,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,mBAAC,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,mBAAC,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,gDAAgD;QAChD,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,kEAAkE;QAClE,sCAAsC;QACtC,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxD,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,4BAAU,EAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,CAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,2DAA2D;QAC3D,8DAA8D;QAC9D,MAAM,GAAG,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAA,qBAAG,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAA,2BAAS,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,oCAAkB,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,CAAC,EAAE,IAAA,mBAAC,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,yDAAyD;QACzD,mEAAmE;QACnE,yCAAyC;QACzC,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,oCAAkB,EAAC,CAAC,CAAC,CAAC;QAChC,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAA,qBAAG,EAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAA,2BAAS,EAAC,OAAO,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAI,CAAC,MAAM,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,0BAA0B;QAC1B,MAAM,CAAC,GAAG,IAAA,iBAAG,EACX,GAAG,EACH,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAM,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,gBAAK,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CACtF,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,oCAAkB,EAAC,CAAC,CAAC,CAAC;QAChC,oDAAoD;QACpD,MAAM,OAAO,GAAG,IAAA,qBAAG,EAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,IAAA,2BAAS,EAAC,OAAO,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAA,qBAAG,EAAC,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,oCAAkB,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,iDAAiD;QACjD,kEAAkE;QAClE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAK,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,IAAA,oCAAkB,EAAC,CAAC,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,IAAA,qBAAG,EAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAA,2BAAS,EAAC,OAAO,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAI,CAAC,MAAM,EAAE,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,4EAA4E;QAC5E,MAAM,CAAC,GAAG,IAAA,iBAAG,EACX,GAAG,EACH,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAM,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,gBAAK,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CACtF,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,oCAAkB,EAAC,CAAC,CAAC,CAAC;QAChC,eAAe,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,0BAAQ,EAAC,IAAA,mBAAC,GAAE,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,0BAAQ,EAAC,IAAA,mBAAC,GAAE,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3E,MAAM,IAAI,GAAe,IAAA,iBAAG,EAC1B,GAAG,EACH,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAM,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,gBAAK,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CACtF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,0BAAQ,EAAC,IAAA,mBAAC,GAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,sFAAsF;QACtF,MAAM,KAAK,GAAe,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,IAAA,oCAAkB,EAAC,KAAK,CAAC,CAAC;QACvC,MAAM,OAAO,GAAG,IAAA,0BAAQ,EAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAA,uBAAY,EAAC,IAAA,gBAAK,EAAC,KAAK,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,IAAA,uBAAY,EAAC,IAAA,gBAAK,EAAC,OAAO,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,IAAI,GAAe,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,IAAI,GAAG,IAAA,oCAAkB,EAAC,IAAI,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,IAAA,0BAAQ,EAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAA,iBAAM,EAAC,OAAO,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAI,CAAC,MAAM,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,IAAI,GAAe,IAAA,iBAAG,EAC1B,GAAG,EACH,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAM,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,gBAAK,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CACtF,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,oCAAkB,EAAC,IAAI,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,IAAA,0BAAQ,EAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAA,iBAAM,EAAC,OAAO,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QACvE,MAAM,IAAI,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,IAAA,iBAAM,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,gBAAK,EAAC,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnF,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,+DAA+D;QAC/D,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,UAAU;QACV,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,8BAA8B;QAC9B,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,EAAE,GAAG,IAAA,0BAAQ,EAAC,CAAC,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,qBAAG,GAAE,CAAC,CAAC,OAAO,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,mBAAC,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAA,sBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,IAAA,yBAAO,EAAC,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAG,EAAC,IAAA,mBAAC,GAAE,EAAE,IAAA,sBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,wEAAwE;AACxE,uEAAuE;AACvE,uDAAuD;AACvD,SAAS,eAAe,CAAC,CAAQ;IAC/B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,GAAG,CAAC;QACT,KAAK,GAAG,CAAC;QACT,KAAK,GAAG,CAAC;QACT,KAAK,KAAK;YACR,OAAO;QACT,KAAK,KAAK;YACR,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,OAAO;IACX,CAAC;AACH,CAAC"}

package/dist/tests/constructive-reals/constructive-reals.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=constructive-reals.test.d.ts.map

package/dist/tests/constructive-reals/constructive-reals.test.d.ts.map

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

package/dist/tests/constructive-reals/constructive-reals.test.js

@@ -0,0 +1,357 @@
+"use strict";
+// ============================================================
+// ST Constructive Reals — Tests
+// ============================================================
+// Verificamos que cada operación cumple su contrato:
+//   |x - approx(p).numerator / approx(p).denominator| < 2^{-p}
+// y que los resultados coinciden numéricamente con cálculos
+// en `number` (con tolerancia floating-point) donde aplica.
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const constructive_reals_1 = require("../../constructive-reals");
+/** Convierte una aproximación a `number` para comparar con float math. */
+function asNumber(r, prec = 60) {
+    const { numerator, denominator } = r.approx(prec);
+    // Para que no perdamos por desbordar Number, dividimos en bigint primero
+    // si los bits son demasiados.
+    const numBits = numerator.toString(2).length;
+    if (numBits > 80) {
+        const shift = numBits - 60;
+        const small = numerator >> BigInt(shift);
+        const denomShifted = denominator >> BigInt(shift);
+        return Number(small) / Number(denomShifted);
+    }
+    return Number(numerator) / Number(denominator);
+}
+(0, vitest_1.describe)('constructive-reals — fundamentos', () => {
+    (0, vitest_1.it)('fromInt(2).approx(20) representa exactamente 2', () => {
+        const r = (0, constructive_reals_1.fromInt)(2);
+        const { numerator, denominator } = r.approx(20);
+        (0, vitest_1.expect)(denominator).toBe(1n << 20n);
+        // 2 · 2^20 = 2097152.
+        (0, vitest_1.expect)(numerator).toBe(2n << 20n);
+    });
+    (0, vitest_1.it)('fromInt(-5).approx(10) representa exactamente -5', () => {
+        const r = (0, constructive_reals_1.fromInt)(-5);
+        const { numerator, denominator } = r.approx(10);
+        (0, vitest_1.expect)(numerator).toBe(-5n * (1n << 10n));
+        (0, vitest_1.expect)(denominator).toBe(1n << 10n);
+    });
+    (0, vitest_1.it)('fromRational(1, 3) tiene error < 2^{-p} en cada precisión', () => {
+        const oneThird = (0, constructive_reals_1.fromRational)(1, 3);
+        for (const p of [10, 30, 60, 100, 200]) {
+            const { numerator, denominator } = oneThird.approx(p);
+            // Error: |1/3 - num/2^p|. Multiplicamos por 3·2^p para enteros:
+            //   |2^p - 3·num| < 3 (es decir, error < 1 en escala 2^p ⇒ < 2^{-p}).
+            const diff3 = (1n << BigInt(p)) - 3n * numerator;
+            const absDiff = diff3 < 0n ? -diff3 : diff3;
+            // |diff3| < 3, lo cual implica |1/3 - num/denom| < 1/2^p < 2^{-p}.
+            (0, vitest_1.expect)(absDiff).toBeLessThan(3n);
+            (0, vitest_1.expect)(denominator).toBe(1n << BigInt(p));
+        }
+    });
+});
+(0, vitest_1.describe)('constructive-reals — aritmética', () => {
+    (0, vitest_1.it)('add(1, 1) ≈ 2 a alta precisión', () => {
+        const two = (0, constructive_reals_1.add)((0, constructive_reals_1.fromInt)(1), (0, constructive_reals_1.fromInt)(1));
+        (0, vitest_1.expect)(asNumber(two)).toBeCloseTo(2, 14);
+        // Verificamos también que la cota está cerca de 2 a precisión 100.
+        const { numerator, denominator } = two.approx(100);
+        // |2 - num/denom| < 2^{-100}, equivalente a |2·denom - num| < 1.
+        const diff = 2n * denominator - numerator;
+        const absDiff = diff < 0n ? -diff : diff;
+        (0, vitest_1.expect)(absDiff).toBeLessThanOrEqual(1n);
+    });
+    (0, vitest_1.it)('sub(5, 3) ≈ 2', () => {
+        const r = (0, constructive_reals_1.sub)((0, constructive_reals_1.fromInt)(5), (0, constructive_reals_1.fromInt)(3));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(2, 14);
+    });
+    (0, vitest_1.it)('mul(7, 6) ≈ 42', () => {
+        const r = (0, constructive_reals_1.mul)((0, constructive_reals_1.fromInt)(7), (0, constructive_reals_1.fromInt)(6));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(42, 12);
+    });
+    (0, vitest_1.it)('neg(neg(x)) = x', () => {
+        const seven = (0, constructive_reals_1.fromInt)(7);
+        const r = (0, constructive_reals_1.neg)((0, constructive_reals_1.neg)(seven));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(7, 14);
+    });
+    (0, vitest_1.it)('abs(-3.5) ≈ 3.5', () => {
+        const r = (0, constructive_reals_1.abs)((0, constructive_reals_1.fromRational)(-7, 2));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(3.5, 14);
+    });
+    (0, vitest_1.it)('div(22, 7) ≈ 3.142857… (aprox π)', () => {
+        const r = (0, constructive_reals_1.div)((0, constructive_reals_1.fromInt)(22), (0, constructive_reals_1.fromInt)(7));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(22 / 7, 12);
+    });
+    (0, vitest_1.it)('div(1, 3) coincide con fromRational(1, 3)', () => {
+        const a = (0, constructive_reals_1.div)((0, constructive_reals_1.fromInt)(1), (0, constructive_reals_1.fromInt)(3));
+        const b = (0, constructive_reals_1.fromRational)(1, 3);
+        // |a - b| debe ser ≤ 2 ulps a precisión 60.
+        const av = a.approx(60).numerator;
+        const bv = b.approx(60).numerator;
+        const diff = av - bv;
+        const absDiff = diff < 0n ? -diff : diff;
+        (0, vitest_1.expect)(absDiff).toBeLessThanOrEqual(2n);
+    });
+    (0, vitest_1.it)('asociatividad aproximada: (a+b)+c ≈ a+(b+c)', () => {
+        const a = (0, constructive_reals_1.fromRational)(7, 11);
+        const b = (0, constructive_reals_1.fromRational)(13, 17);
+        const c = (0, constructive_reals_1.fromRational)(19, 23);
+        const left = (0, constructive_reals_1.add)((0, constructive_reals_1.add)(a, b), c);
+        const right = (0, constructive_reals_1.add)(a, (0, constructive_reals_1.add)(b, c));
+        // A precisión 50, la diferencia debe ser ≤ pocas ulps.
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(left, right, 40)).toBe(0);
+    });
+});
+(0, vitest_1.describe)('constructive-reals — sqrt', () => {
+    (0, vitest_1.it)('sqrt(fromInt(4)) ≈ 2', () => {
+        const r = (0, constructive_reals_1.sqrt)((0, constructive_reals_1.fromInt)(4));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(2, 14);
+        // Verificación más fuerte: (sqrt(4))² ≈ 4.
+        const sq = (0, constructive_reals_1.mul)(r, r);
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(sq, (0, constructive_reals_1.fromInt)(4), 30)).toBe(0);
+    });
+    (0, vitest_1.it)('sqrt(fromInt(2))² ≈ 2 a alta precisión', () => {
+        const r = (0, constructive_reals_1.sqrt)((0, constructive_reals_1.fromInt)(2));
+        const sq = (0, constructive_reals_1.mul)(r, r);
+        // Comparamos con fromInt(2) usando epsilon 40.
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(sq, (0, constructive_reals_1.fromInt)(2), 40)).toBe(0);
+    });
+    (0, vitest_1.it)('SQRT2.approx(50) elevado al cuadrado ≈ 2', () => {
+        const { numerator, denominator } = constructive_reals_1.SQRT2.approx(50);
+        // (num/denom)² ≈ 2  ⇔  |num² - 2·denom²| pequeño.
+        // Con error en num < 1, |num² - 2·denom²| < 2·num ≈ 2·√2·2^50 ≈ 2^51.5
+        const lhs = numerator * numerator;
+        const rhs = 2n * denominator * denominator;
+        const diff = lhs - rhs;
+        const absDiff = diff < 0n ? -diff : diff;
+        // En escala denom² = 2^100, la diferencia debe ser ≤ ~2^52 (margen amplio).
+        (0, vitest_1.expect)(absDiff).toBeLessThan(1n << 55n);
+    });
+    (0, vitest_1.it)('sqrt(fromInt(9)) ≈ 3', () => {
+        const r = (0, constructive_reals_1.sqrt)((0, constructive_reals_1.fromInt)(9));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(3, 14);
+    });
+    (0, vitest_1.it)('sqrt(2) coincide con SQRT2', () => {
+        const a = (0, constructive_reals_1.sqrt)((0, constructive_reals_1.fromInt)(2));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(a, constructive_reals_1.SQRT2, 40)).toBe(0);
+    });
+});
+(0, vitest_1.describe)('constructive-reals — constantes', () => {
+    (0, vitest_1.it)('PI.approx(50) coincide con Math.PI', () => {
+        const piApprox = asNumber(constructive_reals_1.PI, 60);
+        (0, vitest_1.expect)(piApprox).toBeCloseTo(Math.PI, 13);
+    });
+    (0, vitest_1.it)('PI primeros 15 dígitos correctos vía toString', () => {
+        // π = 3.14159265358979323846…
+        const s = (0, constructive_reals_1.toString)(constructive_reals_1.PI, 20);
+        (0, vitest_1.expect)(s.startsWith('3.14159265358979323846')).toBe(true);
+    });
+    (0, vitest_1.it)('E.approx(50) coincide con Math.E', () => {
+        const eApprox = asNumber(constructive_reals_1.E, 60);
+        (0, vitest_1.expect)(eApprox).toBeCloseTo(Math.E, 13);
+    });
+    (0, vitest_1.it)('E primeros 15 dígitos correctos', () => {
+        // e = 2.71828182845904523536…
+        const s = (0, constructive_reals_1.toString)(constructive_reals_1.E, 20);
+        (0, vitest_1.expect)(s.startsWith('2.71828182845904523536')).toBe(true);
+    });
+    (0, vitest_1.it)('SQRT2 coincide con Math.SQRT2', () => {
+        (0, vitest_1.expect)(asNumber(constructive_reals_1.SQRT2, 60)).toBeCloseTo(Math.SQRT2, 13);
+    });
+});
+(0, vitest_1.describe)('constructive-reals — compareWithEpsilon', () => {
+    (0, vitest_1.it)('compareWithEpsilon(PI, fromInt(3), 10) = 1', () => {
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(constructive_reals_1.PI, (0, constructive_reals_1.fromInt)(3), 10)).toBe(1);
+    });
+    (0, vitest_1.it)('compareWithEpsilon(fromInt(3), PI, 10) = -1', () => {
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)((0, constructive_reals_1.fromInt)(3), constructive_reals_1.PI, 10)).toBe(-1);
+    });
+    (0, vitest_1.it)('compareWithEpsilon(x, x, p) = 0 (reflexivo)', () => {
+        const x = (0, constructive_reals_1.fromRational)(355, 113);
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(x, x, 30)).toBe(0);
+    });
+    (0, vitest_1.it)('compareWithEpsilon distingue valores cercanos a precisión adecuada', () => {
+        // 1/3 vs 1/3 + 2^{-20}: a precisión 30 deben diferir.
+        const a = (0, constructive_reals_1.fromRational)(1, 3);
+        const b = (0, constructive_reals_1.add)(a, (0, constructive_reals_1.fromRational)(1, 1 << 20));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(a, b, 30)).toBe(-1);
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(b, a, 30)).toBe(1);
+    });
+    (0, vitest_1.it)('compareWithEpsilon trata como iguales valores dentro de epsilon', () => {
+        // 1/3 vs 1/3 + 2^{-30}: a precisión 10 deben verse iguales.
+        const a = (0, constructive_reals_1.fromRational)(1, 3);
+        const b = (0, constructive_reals_1.add)(a, (0, constructive_reals_1.fromRational)(1, 1 << 30));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(a, b, 10)).toBe(0);
+    });
+});
+(0, vitest_1.describe)('constructive-reals — toString', () => {
+    (0, vitest_1.it)('toString(fromInt(7), 5) = "7.00000"', () => {
+        (0, vitest_1.expect)((0, constructive_reals_1.toString)((0, constructive_reals_1.fromInt)(7), 5)).toBe('7.00000');
+    });
+    (0, vitest_1.it)('toString(fromInt(-3), 0) = "-3"', () => {
+        (0, vitest_1.expect)((0, constructive_reals_1.toString)((0, constructive_reals_1.fromInt)(-3), 0)).toBe('-3');
+    });
+    (0, vitest_1.it)('toString(fromRational(1, 4), 5) = "0.25000"', () => {
+        (0, vitest_1.expect)((0, constructive_reals_1.toString)((0, constructive_reals_1.fromRational)(1, 4), 5)).toBe('0.25000');
+    });
+    (0, vitest_1.it)('toString(SQRT2, 10) coincide con √2 redondeado', () => {
+        // √2 = 1.4142135623730950…  → 1.4142135624 redondeado a 10 dígitos
+        // (el 11º dígito es 7, así que redondea hacia arriba).
+        const s = (0, constructive_reals_1.toString)(constructive_reals_1.SQRT2, 10);
+        (0, vitest_1.expect)(s).toBe('1.4142135624');
+    });
+    (0, vitest_1.it)('toString(SQRT2, 15) coincide con √2 a 15 dígitos', () => {
+        // √2 = 1.414213562373095048…
+        const s = (0, constructive_reals_1.toString)(constructive_reals_1.SQRT2, 15);
+        (0, vitest_1.expect)(s.startsWith('1.41421356237309')).toBe(true);
+    });
+});
+(0, vitest_1.describe)('constructive-reals — propiedades algebraicas', () => {
+    (0, vitest_1.it)('(a + b) - b ≈ a', () => {
+        const a = (0, constructive_reals_1.fromRational)(7, 13);
+        const b = constructive_reals_1.SQRT2;
+        const r = (0, constructive_reals_1.sub)((0, constructive_reals_1.add)(a, b), b);
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(r, a, 30)).toBe(0);
+    });
+    (0, vitest_1.it)('a · (1/a) ≈ 1 para a = π', () => {
+        const inv = (0, constructive_reals_1.div)((0, constructive_reals_1.fromInt)(1), constructive_reals_1.PI);
+        const product = (0, constructive_reals_1.mul)(constructive_reals_1.PI, inv);
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(product, (0, constructive_reals_1.fromInt)(1), 30)).toBe(0);
+    });
+    (0, vitest_1.it)('mul distribuye sobre add: a·(b+c) ≈ a·b + a·c', () => {
+        const a = (0, constructive_reals_1.fromRational)(3, 7);
+        const b = (0, constructive_reals_1.fromRational)(11, 13);
+        const c = (0, constructive_reals_1.fromRational)(17, 19);
+        const lhs = (0, constructive_reals_1.mul)(a, (0, constructive_reals_1.add)(b, c));
+        const rhs = (0, constructive_reals_1.add)((0, constructive_reals_1.mul)(a, b), (0, constructive_reals_1.mul)(a, c));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(lhs, rhs, 30)).toBe(0);
+    });
+    (0, vitest_1.it)('sqrt(x)² ≈ x para varios x positivos', () => {
+        for (const k of [2, 3, 5, 7, 16, 100, 1000]) {
+            const x = (0, constructive_reals_1.fromInt)(k);
+            const sq = (0, constructive_reals_1.mul)((0, constructive_reals_1.sqrt)(x), (0, constructive_reals_1.sqrt)(x));
+            (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(sq, x, 20)).toBe(0);
+        }
+    });
+    (0, vitest_1.it)('error de aproximación está acotado para mul de irracionales', () => {
+        // π · √2 ≈ 4.44288293…
+        const r = (0, constructive_reals_1.mul)(constructive_reals_1.PI, constructive_reals_1.SQRT2);
+        (0, vitest_1.expect)(asNumber(r, 60)).toBeCloseTo(Math.PI * Math.SQRT2, 12);
+    });
+    (0, vitest_1.it)('div maneja divisores negativos', () => {
+        // -10 / -5 = 2.
+        const r = (0, constructive_reals_1.div)((0, constructive_reals_1.fromInt)(-10), (0, constructive_reals_1.fromInt)(-5));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(2, 14);
+        // 10 / -5 = -2.
+        const r2 = (0, constructive_reals_1.div)((0, constructive_reals_1.fromInt)(10), (0, constructive_reals_1.fromInt)(-5));
+        (0, vitest_1.expect)(asNumber(r2)).toBeCloseTo(-2, 14);
+    });
+});
+(0, vitest_1.describe)('constructive-reals — error handling', () => {
+    (0, vitest_1.it)('fromRational(_, 0) lanza', () => {
+        (0, vitest_1.expect)(() => (0, constructive_reals_1.fromRational)(1, 0)).toThrow();
+    });
+    (0, vitest_1.it)('sqrt(-1) lanza', () => {
+        (0, vitest_1.expect)(() => (0, constructive_reals_1.sqrt)((0, constructive_reals_1.fromInt)(-1)).approx(10)).toThrow();
+    });
+    (0, vitest_1.it)('fromInt(NaN) lanza', () => {
+        (0, vitest_1.expect)(() => (0, constructive_reals_1.fromInt)(NaN)).toThrow();
+    });
+    (0, vitest_1.it)('fromInt(3.14) lanza (no es entero)', () => {
+        (0, vitest_1.expect)(() => (0, constructive_reals_1.fromInt)(3.14)).toThrow();
+    });
+});
+(0, vitest_1.describe)('constructive-reals — transcendentales', () => {
+    (0, vitest_1.it)('exp(0) = 1', () => {
+        (0, vitest_1.expect)(asNumber((0, constructive_reals_1.exp)((0, constructive_reals_1.fromInt)(0)))).toBeCloseTo(1, 12);
+    });
+    (0, vitest_1.it)('exp(1) ≈ E', () => {
+        const r = (0, constructive_reals_1.exp)((0, constructive_reals_1.fromInt)(1));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(r, constructive_reals_1.E, 30)).toBe(0);
+    });
+    (0, vitest_1.it)('exp(2) ≈ e²', () => {
+        (0, vitest_1.expect)(asNumber((0, constructive_reals_1.exp)((0, constructive_reals_1.fromInt)(2)))).toBeCloseTo(Math.E * Math.E, 10);
+    });
+    (0, vitest_1.it)('log(E) ≈ 1', () => {
+        const r = (0, constructive_reals_1.log)(constructive_reals_1.E);
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(1, 10);
+    });
+    (0, vitest_1.it)('log(exp(x)) ≈ x para x = 2', () => {
+        const x = (0, constructive_reals_1.fromInt)(2);
+        const r = (0, constructive_reals_1.log)((0, constructive_reals_1.exp)(x));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(r, x, 20)).toBe(0);
+    });
+    (0, vitest_1.it)('exp(log(x)) ≈ x para x = 5', () => {
+        const x = (0, constructive_reals_1.fromInt)(5);
+        const r = (0, constructive_reals_1.exp)((0, constructive_reals_1.log)(x));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(r, x, 20)).toBe(0);
+    });
+    (0, vitest_1.it)('sin(0) ≈ 0', () => {
+        (0, vitest_1.expect)(asNumber((0, constructive_reals_1.sin)((0, constructive_reals_1.fromInt)(0)))).toBeCloseTo(0, 12);
+    });
+    (0, vitest_1.it)('cos(0) = 1', () => {
+        (0, vitest_1.expect)(asNumber((0, constructive_reals_1.cos)((0, constructive_reals_1.fromInt)(0)))).toBeCloseTo(1, 12);
+    });
+    (0, vitest_1.it)('sin(PI) ≈ 0', () => {
+        const r = (0, constructive_reals_1.sin)(constructive_reals_1.PI);
+        // |sin(π)| < 2^{-20} debería ser cierto a precisión razonable.
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(r, (0, constructive_reals_1.fromInt)(0), 20)).toBe(0);
+    });
+    (0, vitest_1.it)('cos(PI) ≈ -1', () => {
+        const r = (0, constructive_reals_1.cos)(constructive_reals_1.PI);
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(r, (0, constructive_reals_1.fromInt)(-1), 20)).toBe(0);
+    });
+    (0, vitest_1.it)('sin²(x) + cos²(x) ≈ 1', () => {
+        const x = (0, constructive_reals_1.fromRational)(7, 5); // arbitrario, dentro de [-π, π].
+        const s = (0, constructive_reals_1.sin)(x);
+        const c = (0, constructive_reals_1.cos)(x);
+        const sum = (0, constructive_reals_1.add)((0, constructive_reals_1.mul)(s, s), (0, constructive_reals_1.mul)(c, c));
+        (0, vitest_1.expect)((0, constructive_reals_1.compareWithEpsilon)(sum, (0, constructive_reals_1.fromInt)(1), 20)).toBe(0);
+    });
+    (0, vitest_1.it)('pow(2, 10) = 1024 (entero rápido)', () => {
+        const r = (0, constructive_reals_1.pow)((0, constructive_reals_1.fromInt)(2), 10);
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(1024, 10);
+    });
+    (0, vitest_1.it)('pow(2, -3) = 1/8', () => {
+        const r = (0, constructive_reals_1.pow)((0, constructive_reals_1.fromInt)(2), -3);
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(0.125, 12);
+    });
+    (0, vitest_1.it)('pow(E, fromInt(2)) ≈ e²', () => {
+        const r = (0, constructive_reals_1.pow)(constructive_reals_1.E, (0, constructive_reals_1.fromInt)(2));
+        (0, vitest_1.expect)(asNumber(r)).toBeCloseTo(Math.E * Math.E, 8);
+    });
+});
+(0, vitest_1.describe)('constructive-reals — internals', () => {
+    (0, vitest_1.it)('isqrt redondea correctamente', () => {
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(0n)).toBe(0n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(1n)).toBe(1n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(2n)).toBe(1n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(3n)).toBe(1n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(4n)).toBe(2n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(15n)).toBe(3n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(16n)).toBe(4n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(10000n)).toBe(100n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.isqrt(1n << 100n)).toBe(1n << 50n);
+    });
+    (0, vitest_1.it)('shiftRight redondea half-away-from-zero', () => {
+        // 5 / 2 = 2.5 → round half away = 3.
+        (0, vitest_1.expect)(constructive_reals_1.__internals.shiftRight(5n, 1)).toBe(3n);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.shiftRight(-5n, 1)).toBe(-3n);
+        // 4 / 2 = 2.
+        (0, vitest_1.expect)(constructive_reals_1.__internals.shiftRight(4n, 1)).toBe(2n);
+        // shift por 0 = identidad.
+        (0, vitest_1.expect)(constructive_reals_1.__internals.shiftRight(7n, 0)).toBe(7n);
+        // shift negativo = shift left.
+        (0, vitest_1.expect)(constructive_reals_1.__internals.shiftRight(3n, -2)).toBe(12n);
+    });
+    (0, vitest_1.it)('bitLength funciona en bordes', () => {
+        (0, vitest_1.expect)(constructive_reals_1.__internals.bitLength(0n)).toBe(0);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.bitLength(1n)).toBe(1);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.bitLength(2n)).toBe(2);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.bitLength(255n)).toBe(8);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.bitLength(256n)).toBe(9);
+        (0, vitest_1.expect)(constructive_reals_1.__internals.bitLength(-256n)).toBe(9);
+    });
+});
+//# sourceMappingURL=constructive-reals.test.js.map