@stevenvo780/st-lang 4.5.2 → 4.7.0

package/dist/tests/proof-minify/minify.test.js

@@ -1,281 +0,0 @@
-"use strict";
-// ============================================================
-// ST Proof Minification — Tests
-// ============================================================
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const proof_minify_1 = require("../../runtime/proof-minify");
-// ── Helpers de construcción ──────────────────────────────────
-function ax(conclusion) {
-    return { conclusion, rule: 'axiom', premises: [] };
-}
-function hyp(conclusion) {
-    return { conclusion, rule: 'hypothesis', premises: [] };
-}
-function mp(conclusion, ant, impl) {
-    return { conclusion, rule: 'MP', premises: [ant, impl] };
-}
-function andI(left, right) {
-    return {
-        conclusion: `${left.conclusion} ∧ ${right.conclusion}`,
-        rule: '∧I',
-        premises: [left, right],
-    };
-}
-function andE1(conjunct, conj) {
-    return { conclusion: conjunct, rule: '∧E1', premises: [conj] };
-}
-function cut(conclusion, left, right) {
-    return { conclusion, rule: 'cut', premises: [left, right] };
-}
-function weaken(conclusion, ...premises) {
-    return { conclusion, rule: 'weakening', premises };
-}
-// ── Tests ────────────────────────────────────────────────────
-(0, vitest_1.describe)('proof-minify: counts y depth', () => {
-    (0, vitest_1.it)('countNodes/depth funcionan correctamente sobre un árbol simple', () => {
-        const proof = mp('B', ax('A'), ax('A → B'));
-        const result = (0, proof_minify_1.minifyProof)(proof, { rules: [] }); // no aplicar reglas
-        (0, vitest_1.expect)(result.original.nodes).toBe(3);
-        (0, vitest_1.expect)(result.original.depth).toBe(1);
-    });
-});
-(0, vitest_1.describe)('proof-minify: detrivialize ∧I/∧E', () => {
-    (0, vitest_1.it)('colapsa ∧E1 ∘ ∧I al sub-árbol correspondiente', () => {
-        // (A ∧ B) introducido y luego eliminado a A.
-        const intro = andI(ax('A'), ax('B'));
-        const elim = andE1('A', intro);
-        const result = (0, proof_minify_1.minifyProof)(elim);
-        (0, vitest_1.expect)(result.minified.conclusion).toBe('A');
-        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
-        (0, vitest_1.expect)(result.minified.premises).toHaveLength(0);
-        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
-    });
-    (0, vitest_1.it)('detrivializa anidados: ∧E1 ∘ ∧I ∘ ∧E1 ∘ ∧I', () => {
-        // Construimos: (((A ∧ B) ∧ C) , extracción de A vía dos eliminaciones)
-        const innerIntro = andI(ax('A'), ax('B'));
-        const elim1 = andE1('A', innerIntro);
-        const outerIntro = andI(elim1, ax('C'));
-        const elim2 = andE1('A', outerIntro);
-        const result = (0, proof_minify_1.minifyProof)(elim2);
-        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
-        (0, vitest_1.expect)(result.minified.conclusion).toBe('A');
-    });
-});
-(0, vitest_1.describe)('proof-minify: compact MP chains', () => {
-    (0, vitest_1.it)('compacta una cadena de 5 MPs en un único MP*', () => {
-        // A, A→B, B→C, C→D, D→E, E→F ⊢ F
-        const step1 = mp('B', ax('A'), ax('A → B'));
-        const step2 = mp('C', step1, ax('B → C'));
-        const step3 = mp('D', step2, ax('C → D'));
-        const step4 = mp('E', step3, ax('D → E'));
-        const step5 = mp('F', step4, ax('E → F'));
-        const result = (0, proof_minify_1.minifyProof)(step5, { rules: ['compact-mp'] });
-        (0, vitest_1.expect)(result.minified.rule).toBe('MP*');
-        (0, vitest_1.expect)(result.minified.conclusion).toBe('F');
-        (0, vitest_1.expect)(result.minified.metadata?.chain).toBeDefined();
-        (0, vitest_1.expect)(result.minified.metadata.chain.length).toBeGreaterThanOrEqual(5);
-        // Profundidad debe haberse reducido drásticamente.
-        (0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
-    });
-    (0, vitest_1.it)('no compacta cadenas ambiguas (sin → en las premisas)', () => {
-        const fake1 = mp('X', ax('Y'), ax('Z'));
-        const fake2 = mp('A', fake1, ax('W'));
-        const result = (0, proof_minify_1.compactModusPonensChain)(fake2);
-        // Como no detecta antecedente vs implicación, no compacta.
-        (0, vitest_1.expect)(result.rule).toBe('MP');
-    });
-    (0, vitest_1.it)('cadenas de exactamente 1 MP no se compactan', () => {
-        const proof = mp('B', ax('A'), ax('A → B'));
-        const result = (0, proof_minify_1.compactModusPonensChain)(proof);
-        (0, vitest_1.expect)(result.rule).toBe('MP');
-    });
-});
-(0, vitest_1.describe)('proof-minify: local cut elimination', () => {
-    (0, vitest_1.it)('elimina cut cuando una rama es hoja-identidad', () => {
-        // cut sobre conclusión A: una rama es la hipótesis A, la otra deriva A.
-        const derivacionA = andE1('A', andI(ax('A'), ax('B')));
-        const proofWithCut = cut('A', hyp('A'), derivacionA);
-        const result = (0, proof_minify_1.minifyProof)(proofWithCut, { rules: ['cut-elimination-local'] });
-        // El cut se reemplaza por la derivación que realmente concluyó A.
-        (0, vitest_1.expect)(result.minified.rule).not.toBe('cut');
-    });
-    (0, vitest_1.it)('mantiene cut cuando ninguna rama es hoja-identidad', () => {
-        const left = mp('A', ax('X'), ax('X → A'));
-        const right = mp('B', ax('A'), ax('A → B'));
-        const proof = cut('B', left, right);
-        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['cut-elimination-local'] });
-        (0, vitest_1.expect)(result.minified.rule).toBe('cut');
-    });
-});
-(0, vitest_1.describe)('proof-minify: remove unused subproofs', () => {
-    (0, vitest_1.it)('recorta premisas irrelevantes en weakening', () => {
-        // Weakening: la conclusion es A. Sólo una premisa contiene A.
-        const irrelevante1 = ax('Z');
-        const irrelevante2 = ax('W');
-        const relevante = ax('A');
-        const proof = weaken('A', irrelevante1, irrelevante2, relevante);
-        const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
-        (0, vitest_1.expect)(result.premises.length).toBeLessThan(3);
-        // La premisa que sobrevive debe contener A.
-        (0, vitest_1.expect)(result.premises.some((p) => p.conclusion === 'A')).toBe(true);
-    });
-    (0, vitest_1.it)('no toca nodos con sólo 1 premisa', () => {
-        const proof = {
-            conclusion: 'A',
-            rule: '∧E1',
-            premises: [andI(ax('A'), ax('B'))],
-        };
-        const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
-        (0, vitest_1.expect)(result.premises).toHaveLength(1);
-    });
-});
-(0, vitest_1.describe)('proof-minify: estadística general', () => {
-    (0, vitest_1.it)('reduce un árbol con 10 nodos y 2 redundantes a ≤ 8 nodos', () => {
-        // Construimos un árbol con 2 ∧I/∧E1 redundantes.
-        // Layout:
-        //  A_intro = (A ∧ B), elim1 = A
-        //  B_intro = (B ∧ C), elim2 = B
-        //  raíz = (elim1 ∧ elim2)
-        const aIntro = andI(ax('A'), ax('B')); // 3 nodos
-        const aElim = andE1('A', aIntro); // +1 = 4
-        const bIntro = andI(ax('B'), ax('C')); // +3 = 7
-        const bElim = andE1('B', bIntro); // +1 = 8
-        const root = andI(aElim, bElim); // +1 = 9
-        // Añadimos un dead-weight: el árbol original.
-        const proof = {
-            conclusion: root.conclusion,
-            rule: root.rule,
-            premises: [...root.premises, ax('Q')], // +1 hojas dead = 10
-        };
-        const result = (0, proof_minify_1.minifyProof)(proof);
-        (0, vitest_1.expect)(result.original.nodes).toBe(10);
-        // Tras detrivialize, aElim → ax('A'), bElim → ax('B'). Nodos: 10-4 = 6.
-        (0, vitest_1.expect)(result.minified.conclusion).toBe(proof.conclusion);
-        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
-        (0, vitest_1.expect)(result.minified.premises.length).toBeLessThanOrEqual(2);
-    });
-});
-(0, vitest_1.describe)('proof-minify: preservación de la raíz', () => {
-    (0, vitest_1.it)('la conclusion de la raíz nunca cambia', () => {
-        const proof = mp('Q', ax('P'), ax('P → Q'));
-        const result = (0, proof_minify_1.minifyProof)(proof);
-        (0, vitest_1.expect)(result.minified.conclusion).toBe('Q');
-    });
-    (0, vitest_1.it)('una hoja se devuelve sin cambios', () => {
-        const leaf = ax('Hello');
-        const result = (0, proof_minify_1.minifyProof)(leaf);
-        (0, vitest_1.expect)(result.minified).toEqual(leaf);
-        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
-        (0, vitest_1.expect)(result.reduction.percentage).toBe(0);
-    });
-});
-(0, vitest_1.describe)('proof-minify: idempotencia', () => {
-    (0, vitest_1.it)('minify(minify(p)) tiene la misma estructura que minify(p)', () => {
-        const aIntro = andI(ax('A'), ax('B'));
-        const aElim = andE1('A', aIntro);
-        const proof = andI(aElim, ax('C'));
-        const once = (0, proof_minify_1.minifyProof)(proof);
-        const twice = (0, proof_minify_1.minifyProof)(once.minified);
-        // Las claves canónicas deben coincidir.
-        const keyOnce = JSON.stringify(once.minified);
-        const keyTwice = JSON.stringify(twice.minified);
-        (0, vitest_1.expect)(keyOnce).toBe(keyTwice);
-        (0, vitest_1.expect)(twice.reduction.nodesRemoved).toBe(0);
-    });
-    (0, vitest_1.it)('idempotencia en cadena MP compactada', () => {
-        const s1 = mp('B', ax('A'), ax('A → B'));
-        const s2 = mp('C', s1, ax('B → C'));
-        const s3 = mp('D', s2, ax('C → D'));
-        const once = (0, proof_minify_1.minifyProof)(s3);
-        const twice = (0, proof_minify_1.minifyProof)(once.minified);
-        (0, vitest_1.expect)(JSON.stringify(once.minified)).toBe(JSON.stringify(twice.minified));
-    });
-    (0, vitest_1.it)('idempotencia sobre prueba ya minimal', () => {
-        const leaf = ax('A');
-        const r1 = (0, proof_minify_1.minifyProof)(leaf);
-        const r2 = (0, proof_minify_1.minifyProof)(r1.minified);
-        (0, vitest_1.expect)(r2.iterations).toBeLessThanOrEqual(2);
-        (0, vitest_1.expect)(r2.reduction.nodesRemoved).toBe(0);
-    });
-});
-(0, vitest_1.describe)('proof-minify: opciones', () => {
-    (0, vitest_1.it)('rules=[] no aplica ninguna reducción', () => {
-        const aElim = andE1('A', andI(ax('A'), ax('B')));
-        const result = (0, proof_minify_1.minifyProof)(aElim, { rules: [] });
-        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
-        (0, vitest_1.expect)(result.minified.rule).toBe('∧E1');
-    });
-    (0, vitest_1.it)('maxIterations=1 limita las pasadas globales', () => {
-        const aElim = andE1('A', andI(ax('A'), ax('B')));
-        const result = (0, proof_minify_1.minifyProof)(aElim, { maxIterations: 1 });
-        (0, vitest_1.expect)(result.iterations).toBe(1);
-    });
-    (0, vitest_1.it)('rules selectivo: sólo compact-mp no afecta árboles sin MP', () => {
-        const proof = andI(ax('A'), ax('B'));
-        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['compact-mp'] });
-        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
-    });
-    (0, vitest_1.it)('rules selectivo: sólo detrivialize en árbol con ∧I/∧E', () => {
-        const proof = andE1('A', andI(ax('A'), ax('B')));
-        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['detrivialize'] });
-        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
-    });
-});
-(0, vitest_1.describe)('proof-minify: dedup de premisas', () => {
-    (0, vitest_1.it)('elimina premisas duplicadas estructurales', () => {
-        // ∧I con dos premisas idénticas (caso degenerado pero válido).
-        const dup = {
-            conclusion: 'A ∧ A',
-            rule: '∧I',
-            premises: [ax('A'), ax('A')],
-        };
-        const result = (0, proof_minify_1.minifyProof)(dup, { rules: ['detrivialize'] });
-        (0, vitest_1.expect)(result.minified.premises).toHaveLength(1);
-    });
-});
-(0, vitest_1.describe)('proof-minify: input no se muta', () => {
-    (0, vitest_1.it)('el árbol original queda intacto', () => {
-        const original = andE1('A', andI(ax('A'), ax('B')));
-        const snapshot = JSON.stringify(original);
-        (0, proof_minify_1.minifyProof)(original);
-        (0, vitest_1.expect)(JSON.stringify(original)).toBe(snapshot);
-    });
-});
-(0, vitest_1.describe)('proof-minify: integración multi-regla', () => {
-    (0, vitest_1.it)('combina detrivialize + compact-mp + remove-unused', () => {
-        // Construye: weaken con premisas extras, cadena MP dentro, ∧E∘∧I.
-        const aElim = andE1('A', andI(ax('A'), ax('B')));
-        const s1 = mp('B', aElim, ax('A → B'));
-        const s2 = mp('C', s1, ax('B → C'));
-        const root = weaken('C', s2, ax('IRRELEVANTE_Z'));
-        const result = (0, proof_minify_1.minifyProof)(root);
-        (0, vitest_1.expect)(result.minified.conclusion).toBe('C');
-        // La premisa irrelevante debe haberse podado.
-        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThan(0);
-    });
-    (0, vitest_1.it)('punto fijo alcanzado antes de maxIterations', () => {
-        const proof = mp('B', ax('A'), ax('A → B'));
-        const result = (0, proof_minify_1.minifyProof)(proof, { maxIterations: 100 });
-        (0, vitest_1.expect)(result.iterations).toBeLessThanOrEqual(2);
-    });
-});
-(0, vitest_1.describe)('proof-minify: métricas', () => {
-    (0, vitest_1.it)('percentage es 0 para una hoja', () => {
-        const result = (0, proof_minify_1.minifyProof)(ax('X'));
-        (0, vitest_1.expect)(result.reduction.percentage).toBe(0);
-    });
-    (0, vitest_1.it)('percentage > 0 cuando hay reducción', () => {
-        const aElim = andE1('A', andI(ax('A'), ax('B')));
-        const result = (0, proof_minify_1.minifyProof)(aElim);
-        (0, vitest_1.expect)(result.reduction.percentage).toBeGreaterThan(0);
-    });
-    (0, vitest_1.it)('depthDelta > 0 al compactar cadena MP', () => {
-        const s1 = mp('B', ax('A'), ax('A → B'));
-        const s2 = mp('C', s1, ax('B → C'));
-        const s3 = mp('D', s2, ax('C → D'));
-        const result = (0, proof_minify_1.minifyProof)(s3);
-        (0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
-    });
-});
-//# sourceMappingURL=minify.test.js.map

package/dist/tests/proof-minify/minify.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"minify.test.js","sourceRoot":"","sources":["../../../src/tests/proof-minify/minify.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;;AAE/D,mCAA8C;AAC9C,6DAKoC;AAEpC,gEAAgE;AAEhE,SAAS,EAAE,CAAC,UAAkB;IAC5B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AACrD,CAAC;AACD,SAAS,GAAG,CAAC,UAAkB;IAC7B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AAC1D,CAAC;AACD,SAAS,EAAE,CAAC,UAAkB,EAAE,GAAqB,EAAE,IAAsB;IAC3E,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;AAC3D,CAAC;AACD,SAAS,IAAI,CAAC,IAAsB,EAAE,KAAuB;IAC3D,OAAO;QACL,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,UAAU,EAAE;QACtD,IAAI,EAAE,IAAI;QACV,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;KACxB,CAAC;AACJ,CAAC;AACD,SAAS,KAAK,CAAC,QAAgB,EAAE,IAAsB;IACrD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,CAAC;AACD,SAAS,GAAG,CACV,UAAkB,EAClB,IAAsB,EACtB,KAAuB;IAEvB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;AAC9D,CAAC;AACD,SAAS,MAAM,CAAC,UAAkB,EAAE,GAAG,QAA4B;IACjE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;AACrD,CAAC;AAED,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB;QACtE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,6CAA6C;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,uEAAuE;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,iCAAiC;QACjC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAE1C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACtD,IAAA,eAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAS,CAAC,KAAkB,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvF,mDAAmD;QACnD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,2DAA2D;QAC3D,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,wEAAwE;QACxE,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QAC/E,kEAAkE;QAClE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,8DAA8D;QAC9D,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/C,4CAA4C;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,GAAG;YACf,IAAI,EAAE,KAAK;YACX,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SACnC,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,iDAAiD;QACjD,UAAU;QACV,gCAAgC;QAChC,gCAAgC;QAChC,0BAA0B;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACjD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;QAChD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,SAAS;QAC1C,8CAA8C;QAC9C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,qBAAqB;SAC7D,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,wEAAwE;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,wCAAwC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,+DAA+D;QAC/D,MAAM,GAAG,GAAqB;YAC5B,UAAU,EAAE,OAAO;YACnB,IAAI,EAAE,IAAI;YACV,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;SAC7B,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAA,0BAAW,EAAC,QAAQ,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,kEAAkE;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,8CAA8C;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/proof-nets/proof-nets.test.d.ts.map

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

package/dist/tests/proof-nets/proof-nets.test.js

@@ -1,263 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const proof_nets_1 = require("../../proof-nets");
-(0, vitest_1.describe)('Proof Nets / fórmulas y dualidad', () => {
-    (0, vitest_1.it)('dualidad es involutiva sobre átomos', () => {
-        const A = (0, proof_nets_1.atomPos)('A');
-        (0, vitest_1.expect)((0, proof_nets_1.formulaEquals)((0, proof_nets_1.dual)((0, proof_nets_1.dual)(A)), A)).toBe(true);
-    });
-    (0, vitest_1.it)('De Morgan: (A ⊗ B)⊥ = A⊥ ⅋ B⊥', () => {
-        const A = (0, proof_nets_1.atomPos)('A');
-        const B = (0, proof_nets_1.atomPos)('B');
-        const lhs = (0, proof_nets_1.dual)((0, proof_nets_1.tensor)(A, B));
-        const rhs = (0, proof_nets_1.par)((0, proof_nets_1.dual)(A), (0, proof_nets_1.dual)(B));
-        (0, vitest_1.expect)((0, proof_nets_1.formulaEquals)(lhs, rhs)).toBe(true);
-    });
-    (0, vitest_1.it)('formulaToString muestra ⊥ en átomos negativos', () => {
-        (0, vitest_1.expect)((0, proof_nets_1.formulaToString)((0, proof_nets_1.atomNeg)('A'))).toBe('A⊥');
-        (0, vitest_1.expect)((0, proof_nets_1.formulaToString)((0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('B')))).toBe('(A ⊗ B⊥)');
-        (0, vitest_1.expect)((0, proof_nets_1.formulaToString)((0, proof_nets_1.par)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('B')))).toBe('(A ⅋ B⊥)');
-    });
-});
-(0, vitest_1.describe)('Proof Nets / construcción y corrección Danos-Regnier', () => {
-    (0, vitest_1.it)('axiom link A, A⊥ es correcto', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A')]);
-        (0, vitest_1.expect)(net.nodes).toHaveLength(2);
-        (0, vitest_1.expect)(net.links).toHaveLength(1);
-        (0, vitest_1.expect)(net.links[0].kind).toBe('axiom');
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
-    });
-    (0, vitest_1.it)('secuente ⊢ A⊥, A (orden invertido) sigue siendo correcto', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomPos)('A')]);
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
-    });
-    (0, vitest_1.it)('⊢ A⊥, B⊥, A ⊗ B es correcto (intro de tensor)', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([
-            (0, proof_nets_1.atomNeg)('A'),
-            (0, proof_nets_1.atomNeg)('B'),
-            (0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomPos)('B')),
-        ]);
-        (0, vitest_1.expect)(net.links.some((l) => l.kind === 'tensor')).toBe(true);
-        (0, vitest_1.expect)(net.links.filter((l) => l.kind === 'axiom')).toHaveLength(2);
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
-    });
-    (0, vitest_1.it)('⊢ A⊥ ⅋ B⊥, A ⊗ B es correcto (forma normal)', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([
-            (0, proof_nets_1.par)((0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomNeg)('B')),
-            (0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomPos)('B')),
-        ]);
-        (0, vitest_1.expect)(net.links.some((l) => l.kind === 'tensor')).toBe(true);
-        (0, vitest_1.expect)(net.links.some((l) => l.kind === 'par')).toBe(true);
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
-    });
-    (0, vitest_1.it)('⊢ A, A⊥ ⅋ B, B⊥ NO es correcto: ⊢ A, A⊥, B, B⊥ no es probable en MLL puro (sin mix)', () => {
-        // Aunque ingenuamente uno emparejaría (A,A⊥) y (B,B⊥), bajo el
-        // switching del ⅋ que descarta la premisa "interna" B, el átomo
-        // se queda sin conexión con el resto del net. Esto refleja que
-        // MLL sin "mix" no prueba este secuente: las dos cadenas
-        // axioma-axioma viven en componentes desconexas.
-        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.par)((0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomPos)('B')), (0, proof_nets_1.atomNeg)('B')]);
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
-    });
-    (0, vitest_1.it)('⊢ (A ⊗ B), (A⊥ ⅋ B⊥) sí es correcto (De Morgan)', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([
-            (0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomPos)('B')),
-            (0, proof_nets_1.par)((0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomNeg)('B')),
-        ]);
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
-    });
-    (0, vitest_1.it)('secuente vacío produce net trivialmente correcto', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([]);
-        (0, vitest_1.expect)(net.nodes).toHaveLength(0);
-        (0, vitest_1.expect)(net.links).toHaveLength(0);
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
-    });
-    (0, vitest_1.it)('⊢ A solo (sin dual) NO es correcto: hay nodo aislado', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A')]);
-        // No hay con quién emparejar => sin axiom link, componente
-        // desconexa de tamaño 1 sin aristas.
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
-    });
-    (0, vitest_1.it)('⊢ A ⊗ A⊥ NO es correcto: tensor con cut interno crearía ciclo', () => {
-        // Esta es la trampa clásica: con un solo átomo en cada lado del
-        // tensor no se puede cerrar el net respetando la conexidad bajo
-        // todos los switchings.
-        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A'))]);
-        // Construye: dos hojas A, A⊥, un tensor link, y un axiom link
-        // entre A y A⊥. Bajo el único switching (no hay par) el grafo
-        // tiene un ciclo a—tensor—a⊥—axiom—a, así que es incorrecto.
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
-    });
-    (0, vitest_1.it)('⊢ A ⅋ A⊥ SÍ es correcto: par "abre" el ciclo bajo switching', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.par)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A'))]);
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
-    });
-    (0, vitest_1.it)('net manualmente desconexo es rechazado', () => {
-        // Dos axiom links independientes y nada que los conecte.
-        const net = {
-            nodes: [
-                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
-                { id: 1, formula: (0, proof_nets_1.atomNeg)('A') },
-                { id: 2, formula: (0, proof_nets_1.atomPos)('B') },
-                { id: 3, formula: (0, proof_nets_1.atomNeg)('B') },
-            ],
-            links: [
-                { kind: 'axiom', ports: [0, 1] },
-                { kind: 'axiom', ports: [2, 3] },
-            ],
-            conclusions: [0, 1, 2, 3],
-        };
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
-    });
-    (0, vitest_1.it)('net con port inexistente es rechazado', () => {
-        const net = {
-            nodes: [{ id: 0, formula: (0, proof_nets_1.atomPos)('A') }],
-            links: [{ kind: 'axiom', ports: [0, 99] }],
-            conclusions: [0],
-        };
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
-    });
-    (0, vitest_1.it)('axiom entre fórmulas NO duales es rechazado', () => {
-        const net = {
-            nodes: [
-                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
-                { id: 1, formula: (0, proof_nets_1.atomPos)('B') },
-            ],
-            links: [{ kind: 'axiom', ports: [0, 1] }],
-            conclusions: [0, 1],
-        };
-        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
-    });
-});
-(0, vitest_1.describe)('Proof Nets / eliminación de cortes', () => {
-    (0, vitest_1.it)('axiom-cut: reduceCutStep simplifica un paso', () => {
-        // Net: axiom(0:A, 1:A⊥), cut(1:A⊥, 2:A), conclusion 2.
-        // El cut está entre `1` (premisa axiom) y `2` (átomo libre).
-        // Tras reducir esperamos un axiom(0, 2) y desaparición de `1`.
-        const net = {
-            nodes: [
-                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
-                { id: 1, formula: (0, proof_nets_1.atomNeg)('A') },
-                { id: 2, formula: (0, proof_nets_1.atomPos)('A') },
-            ],
-            links: [
-                { kind: 'axiom', ports: [0, 1] },
-                { kind: 'cut', ports: [1, 2] },
-            ],
-            conclusions: [0, 2],
-        };
-        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(net)).toBe(false);
-        const step = (0, proof_nets_1.reduceCutStep)(net);
-        (0, vitest_1.expect)(step.reduced).toBe(true);
-        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(step.net)).toBe(true);
-        (0, vitest_1.expect)(step.net.links).toHaveLength(1);
-        (0, vitest_1.expect)(step.net.links[0].kind).toBe('axiom');
-        (0, vitest_1.expect)(new Set(step.net.links[0].ports)).toEqual(new Set([0, 2]));
-        (0, vitest_1.expect)(step.net.nodes.find((n) => n.id === 1)).toBeUndefined();
-    });
-    (0, vitest_1.it)('mult-cut: tensor vs par reduce a dos cortes más pequeños', () => {
-        // Construimos manualmente:
-        //   nodos: a:A, b:B, a':A⊥, b':B⊥, t:A⊗B, p:A⊥⅋B⊥
-        //   links: tensor(a,b,t), par(a',b',p), cut(t,p)
-        const A = (0, proof_nets_1.atomPos)('A');
-        const Anot = (0, proof_nets_1.atomNeg)('A');
-        const B = (0, proof_nets_1.atomPos)('B');
-        const Bnot = (0, proof_nets_1.atomNeg)('B');
-        const net = {
-            nodes: [
-                { id: 0, formula: A },
-                { id: 1, formula: B },
-                { id: 2, formula: Anot },
-                { id: 3, formula: Bnot },
-                { id: 4, formula: (0, proof_nets_1.tensor)(A, B) },
-                { id: 5, formula: (0, proof_nets_1.par)(Anot, Bnot) },
-            ],
-            links: [
-                { kind: 'tensor', ports: [0, 1, 4] },
-                { kind: 'par', ports: [2, 3, 5] },
-                { kind: 'cut', ports: [4, 5] },
-            ],
-            conclusions: [],
-        };
-        const step = (0, proof_nets_1.reduceCutStep)(net);
-        (0, vitest_1.expect)(step.reduced).toBe(true);
-        const cuts = step.net.links.filter((l) => l.kind === 'cut');
-        (0, vitest_1.expect)(cuts).toHaveLength(2);
-        // Los dos cortes deben conectar átomos duales.
-        const cutPortSets = cuts.map((c) => new Set(c.ports));
-        (0, vitest_1.expect)(cutPortSets).toContainEqual(new Set([0, 2]));
-        (0, vitest_1.expect)(cutPortSets).toContainEqual(new Set([1, 3]));
-        // Tensor y par originales deben haber desaparecido.
-        (0, vitest_1.expect)(step.net.links.some((l) => l.kind === 'tensor')).toBe(false);
-        (0, vitest_1.expect)(step.net.links.some((l) => l.kind === 'par')).toBe(false);
-    });
-    (0, vitest_1.it)('normalizeCuts converge a un net cut-free', () => {
-        // Cadena: axiom(0,1) + axiom(2,3) + cut(1,2) reduce a axiom(0,3).
-        const net = {
-            nodes: [
-                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
-                { id: 1, formula: (0, proof_nets_1.atomNeg)('A') },
-                { id: 2, formula: (0, proof_nets_1.atomPos)('A') },
-                { id: 3, formula: (0, proof_nets_1.atomNeg)('A') },
-            ],
-            links: [
-                { kind: 'axiom', ports: [0, 1] },
-                { kind: 'axiom', ports: [2, 3] },
-                { kind: 'cut', ports: [1, 2] },
-            ],
-            conclusions: [0, 3],
-        };
-        const norm = (0, proof_nets_1.normalizeCuts)(net);
-        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(norm)).toBe(true);
-        // Algún axiom debería terminar conectando 0 con 3 (mod nodos
-        // intermedios reabsorbidos en una segunda pasada de axiom-cut).
-        (0, vitest_1.expect)(norm.links.length).toBeGreaterThanOrEqual(1);
-    });
-    (0, vitest_1.it)('reduceCut sobre net sin cortes es idempotente', () => {
-        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A')]);
-        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(net)).toBe(true);
-        const step = (0, proof_nets_1.reduceCutStep)(net);
-        (0, vitest_1.expect)(step.reduced).toBe(false);
-        (0, vitest_1.expect)(step.net).toBe(net);
-        (0, vitest_1.expect)((0, proof_nets_1.reduceCut)(net)).toBe(net);
-    });
-    (0, vitest_1.it)('mult-cut compuesto: (A⊗B) vs (A⊥⅋B⊥) cierra a axioms tras normalize', () => {
-        const A = (0, proof_nets_1.atomPos)('A');
-        const Anot = (0, proof_nets_1.atomNeg)('A');
-        const B = (0, proof_nets_1.atomPos)('B');
-        const Bnot = (0, proof_nets_1.atomNeg)('B');
-        const net = {
-            nodes: [
-                { id: 0, formula: A },
-                { id: 1, formula: Anot }, // será emparejado luego
-                { id: 2, formula: B },
-                { id: 3, formula: Bnot }, // será emparejado luego
-                { id: 4, formula: Anot }, // hoja del par
-                { id: 5, formula: Bnot }, // hoja del par
-                { id: 6, formula: A }, // hoja externa
-                { id: 7, formula: B }, // hoja externa
-                { id: 8, formula: (0, proof_nets_1.tensor)(A, B) },
-                { id: 9, formula: (0, proof_nets_1.par)(Anot, Bnot) },
-            ],
-            links: [
-                // axioms: vinculamos los átomos externos con los del par/tensor
-                { kind: 'axiom', ports: [6, 4] },
-                { kind: 'axiom', ports: [7, 5] },
-                { kind: 'axiom', ports: [0, 1] },
-                { kind: 'axiom', ports: [2, 3] },
-                { kind: 'tensor', ports: [0, 2, 8] }, // construye A⊗B desde 0 y 2
-                { kind: 'par', ports: [4, 5, 9] }, // construye A⊥⅋B⊥
-                { kind: 'cut', ports: [8, 9] },
-            ],
-            conclusions: [6, 7, 1, 3],
-        };
-        const norm = (0, proof_nets_1.normalizeCuts)(net);
-        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(norm)).toBe(true);
-        // Tras toda la cascada deben quedar solo axiom links.
-        for (const l of norm.links) {
-            (0, vitest_1.expect)(l.kind).toBe('axiom');
-        }
-    });
-});
-//# sourceMappingURL=proof-nets.test.js.map

package/dist/tests/proof-nets/proof-nets.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"proof-nets.test.js","sourceRoot":"","sources":["../../../src/tests/proof-nets/proof-nets.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,iDAe0B;AAE1B,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,IAAA,0BAAa,EAAC,IAAA,iBAAI,EAAC,IAAA,iBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,iBAAI,EAAC,IAAA,mBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAA,gBAAG,EAAC,IAAA,iBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,iBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,0BAAa,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,IAAA,eAAM,EAAC,IAAA,4BAAe,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,4BAAe,EAAC,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,IAAA,4BAAe,EAAC,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sDAAsD,EAAE,GAAG,EAAE;IACpE,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC;YAC/B,IAAA,oBAAO,EAAC,GAAG,CAAC;YACZ,IAAA,oBAAO,EAAC,GAAG,CAAC;YACZ,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;SACnC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC;YAC/B,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;YAC/B,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;SACnC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qFAAqF,EAAE,GAAG,EAAE;QAC7F,+DAA+D;QAC/D,gEAAgE;QAChE,+DAA+D;QAC/D,yDAAyD;QACzD,iDAAiD;QACjD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChG,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC;YAC/B,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;YAClC,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;SAChC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,EAAE,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,2DAA2D;QAC3D,qCAAqC;QACrC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,gEAAgE;QAChE,gEAAgE;QAChE,wBAAwB;QACxB,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,8DAA8D;QAC9D,8DAA8D;QAC9D,6DAA6D;QAC7D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,yDAAyD;QACzD,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aACjC;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SAC1B,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,CAAC;YACzC,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC1C,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACzC,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,uDAAuD;QACvD,6DAA6D;QAC7D,+DAA+D;QAC/D,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,2BAA2B;QAC3B,kDAAkD;QAClD,iDAAiD;QACjD,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;gBACxB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;gBACxB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,mBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,gBAAG,EAAC,IAAI,EAAE,IAAI,CAAC,EAAE;aACpC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBACpC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBACjC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,EAAE;SAChB,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,+CAA+C;QAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,WAAW,CAAC,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,WAAW,CAAC,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,oDAAoD;QACpD,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,kEAAkE;QAClE,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,6DAA6D;QAC7D,gEAAgE;QAChE,IAAA,eAAM,EAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,wBAAwB;gBAClD,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,wBAAwB;gBAClD,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,eAAe;gBACzC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,eAAe;gBACzC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,eAAe;gBACtC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,eAAe;gBACtC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,mBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,gBAAG,EAAC,IAAI,EAAE,IAAI,CAAC,EAAE;aACpC;YACD,KAAK,EAAE;gBACL,gEAAgE;gBAChE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,4BAA4B;gBAClE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,kBAAkB;gBACrD,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SAC1B,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,sDAAsD;QACtD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/refinement-types/refinement-types.test.d.ts.map

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