@stevenvo780/st-lang 4.10.0 → 4.11.0

package/dist/tests/reasoning/graph-theory/graph-theory.test.js

@@ -0,0 +1,363 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const graph_theory_1 = require("../../../reasoning/graph-theory");
+// Helpers
+function pathGraph(n, directed = false) {
+    const G = (0, graph_theory_1.makeGraph)(directed);
+    for (let i = 0; i < n; i++)
+        (0, graph_theory_1.addVertex)(G, i);
+    for (let i = 0; i < n - 1; i++)
+        (0, graph_theory_1.addEdge)(G, { from: i, to: i + 1, weight: 1 });
+    return G;
+}
+function cycleGraph(n, directed = false) {
+    const G = (0, graph_theory_1.makeGraph)(directed);
+    for (let i = 0; i < n; i++)
+        (0, graph_theory_1.addVertex)(G, i);
+    for (let i = 0; i < n; i++)
+        (0, graph_theory_1.addEdge)(G, { from: i, to: (i + 1) % n, weight: 1 });
+    return G;
+}
+function completeGraph(n) {
+    const G = (0, graph_theory_1.makeGraph)(false);
+    for (let i = 0; i < n; i++)
+        (0, graph_theory_1.addVertex)(G, i);
+    for (let i = 0; i < n; i++) {
+        for (let j = i + 1; j < n; j++) {
+            (0, graph_theory_1.addEdge)(G, { from: i, to: j, weight: 1 });
+        }
+    }
+    return G;
+}
+// ------------------------------------------------------------
+// 1. Construcción
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / construcción', () => {
+    (0, vitest_1.it)('makeGraph inicializa vacío', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, vitest_1.expect)(G.vertices.size).toBe(0);
+        (0, vitest_1.expect)(G.edges.length).toBe(0);
+        (0, vitest_1.expect)(G.directed).toBe(false);
+    });
+    (0, vitest_1.it)('addEdge añade extremos como vértices', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 'a', to: 'b', weight: 2 });
+        (0, vitest_1.expect)(G.vertices.has('a')).toBe(true);
+        (0, vitest_1.expect)(G.vertices.has('b')).toBe(true);
+        (0, vitest_1.expect)(G.edges.length).toBe(1);
+    });
+    (0, vitest_1.it)('neighbors respeta dirección', () => {
+        const G = (0, graph_theory_1.makeGraph)(true);
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
+        (0, vitest_1.expect)((0, graph_theory_1.neighbors)(G, 1)).toEqual([2]);
+        (0, vitest_1.expect)((0, graph_theory_1.neighbors)(G, 2)).toEqual([]);
+    });
+    (0, vitest_1.it)('inDegree/outDegree en grafo dirigido', () => {
+        const G = (0, graph_theory_1.makeGraph)(true);
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 2 });
+        (0, vitest_1.expect)((0, graph_theory_1.inDegree)(G, 2)).toBe(2);
+        (0, vitest_1.expect)((0, graph_theory_1.outDegree)(G, 2)).toBe(0);
+        (0, vitest_1.expect)((0, graph_theory_1.outDegree)(G, 1)).toBe(1);
+    });
+});
+// ------------------------------------------------------------
+// 2. Recorridos
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / recorridos', () => {
+    (0, vitest_1.it)('BFS visita en orden de niveles', () => {
+        // Grafo:  0 - 1 - 3
+        //         |   |
+        //         2 - 4
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 3 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 4 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 4 });
+        const order = (0, graph_theory_1.bfs)(G, 0);
+        (0, vitest_1.expect)(order[0]).toBe(0);
+        // Nivel 1 debe ser {1, 2} antes que {3, 4}.
+        const idx = new Map(order.map((v, i) => [v, i]));
+        (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(3));
+        (0, vitest_1.expect)(idx.get(2)).toBeLessThan(idx.get(3));
+        (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(4));
+    });
+    (0, vitest_1.it)('DFS recorre en profundidad', () => {
+        const G = pathGraph(5);
+        const order = (0, graph_theory_1.dfs)(G, 0);
+        // Path 0-1-2-3-4: DFS desde 0 debe visitar todos en orden creciente.
+        (0, vitest_1.expect)(order).toEqual([0, 1, 2, 3, 4]);
+    });
+    (0, vitest_1.it)('topologicalSort en DAG válido', () => {
+        const G = (0, graph_theory_1.makeGraph)(true);
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 3 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 4 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 4 });
+        const order = (0, graph_theory_1.topologicalSort)(G);
+        (0, vitest_1.expect)(order).not.toBe('has-cycle');
+        if (order === 'has-cycle')
+            return;
+        const idx = new Map(order.map((v, i) => [v, i]));
+        (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(2));
+        (0, vitest_1.expect)(idx.get(1)).toBeLessThan(idx.get(3));
+        (0, vitest_1.expect)(idx.get(2)).toBeLessThan(idx.get(4));
+        (0, vitest_1.expect)(idx.get(3)).toBeLessThan(idx.get(4));
+    });
+    (0, vitest_1.it)('topologicalSort detecta ciclo', () => {
+        const G = (0, graph_theory_1.makeGraph)(true);
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 1 });
+        (0, vitest_1.expect)((0, graph_theory_1.topologicalSort)(G)).toBe('has-cycle');
+    });
+});
+// ------------------------------------------------------------
+// 3. Conectividad
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / conectividad', () => {
+    (0, vitest_1.it)('connectedComponents identifica 2 componentes', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 4 });
+        (0, graph_theory_1.addVertex)(G, 5);
+        const comps = (0, graph_theory_1.connectedComponents)(G);
+        (0, vitest_1.expect)(comps.length).toBe(3);
+        const sizes = comps.map((c) => c.length).sort((a, b) => a - b);
+        (0, vitest_1.expect)(sizes).toEqual([1, 2, 2]);
+    });
+    (0, vitest_1.it)('isConnected en path', () => {
+        (0, vitest_1.expect)((0, graph_theory_1.isConnected)(pathGraph(5))).toBe(true);
+    });
+    (0, vitest_1.it)('SCC de Tarjan con 2 SCC en grafo dirigido', () => {
+        // SCC 1: {1, 2, 3} (ciclo) ; SCC 2: {4} ; arista 3 -> 4 no fuerte.
+        const G = (0, graph_theory_1.makeGraph)(true);
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 4 });
+        const sccs = (0, graph_theory_1.stronglyConnectedComponents)(G);
+        (0, vitest_1.expect)(sccs.length).toBe(2);
+        const sizes = sccs.map((c) => c.length).sort((a, b) => a - b);
+        (0, vitest_1.expect)(sizes).toEqual([1, 3]);
+    });
+    (0, vitest_1.it)('articulationPoints en cadena lineal', () => {
+        // Path 0-1-2-3-4: los puntos de articulación son 1, 2, 3.
+        const G = pathGraph(5);
+        const arts = (0, graph_theory_1.articulationPoints)(G).sort((a, b) => a - b);
+        (0, vitest_1.expect)(arts).toEqual([1, 2, 3]);
+    });
+    (0, vitest_1.it)('bridges en cadena lineal', () => {
+        const G = pathGraph(4);
+        const br = (0, graph_theory_1.bridges)(G);
+        // Todo edge de un árbol es puente.
+        (0, vitest_1.expect)(br.length).toBe(3);
+    });
+    (0, vitest_1.it)('bridges: ciclo no tiene puentes', () => {
+        const G = cycleGraph(5);
+        (0, vitest_1.expect)((0, graph_theory_1.bridges)(G).length).toBe(0);
+    });
+});
+// ------------------------------------------------------------
+// 4. Caminos mínimos
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / caminos mínimos', () => {
+    (0, vitest_1.it)('dijkstra en grafo 5-vertex weighted', () => {
+        // Grafo clásico:
+        //   0 --(7)-- 1 --(1)-- 4
+        //   |\        |
+        //  (1)(5)   (2)
+        //   |   \    |
+        //   2 --(2)- 3
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 7 });
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 2, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 3, weight: 5 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 4, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 2 });
+        const { distances } = (0, graph_theory_1.dijkstra)(G, 0);
+        (0, vitest_1.expect)(distances.get(0)).toBe(0);
+        (0, vitest_1.expect)(distances.get(1)).toBe(5); // 0->2->3->1 = 1+2+2 = 5
+        (0, vitest_1.expect)(distances.get(2)).toBe(1);
+        (0, vitest_1.expect)(distances.get(3)).toBe(3); // 0->2->3 = 3
+        (0, vitest_1.expect)(distances.get(4)).toBe(6); // 0->2->3->1->4 = 6
+    });
+    (0, vitest_1.it)('dijkstra rechaza pesos negativos', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: -1 });
+        (0, vitest_1.expect)(() => (0, graph_theory_1.dijkstra)(G, 0)).toThrow();
+    });
+    (0, vitest_1.it)('bellmanFord detecta ciclo negativo', () => {
+        const G = (0, graph_theory_1.makeGraph)(true);
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: -3 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 1, weight: 1 });
+        const r = (0, graph_theory_1.bellmanFord)(G, 1);
+        (0, vitest_1.expect)(r.negativeCycle).toBe(true);
+    });
+    (0, vitest_1.it)('bellmanFord en grafo sin ciclos negativos', () => {
+        const G = (0, graph_theory_1.makeGraph)(true);
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 4 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 2, weight: 2 });
+        const r = (0, graph_theory_1.bellmanFord)(G, 1);
+        (0, vitest_1.expect)(r.negativeCycle).toBe(false);
+        (0, vitest_1.expect)(r.distances.get(2)).toBe(3); // 1->3->2 = 3
+    });
+    (0, vitest_1.it)('floydWarshall coincide con dijkstra en pesos positivos', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 4 });
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 2, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 5 });
+        const fw = (0, graph_theory_1.floydWarshall)(G);
+        const dj = (0, graph_theory_1.dijkstra)(G, 0);
+        for (const v of G.vertices) {
+            (0, vitest_1.expect)(fw.get(0)?.get(v)).toBe(dj.distances.get(v));
+        }
+    });
+});
+// ------------------------------------------------------------
+// 5. MST
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / MST', () => {
+    (0, vitest_1.it)('kruskal MST en grafo simple', () => {
+        // Grafo de 4 nodos con pesos:
+        // 1-2(1), 2-3(2), 3-4(3), 1-4(10), 1-3(5)
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 4, weight: 3 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 4, weight: 10 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 5 });
+        const mst = (0, graph_theory_1.kruskal)(G);
+        (0, vitest_1.expect)(mst.totalWeight).toBe(6); // 1 + 2 + 3
+        (0, vitest_1.expect)(mst.edges.length).toBe(3);
+    });
+    (0, vitest_1.it)('prim MST coincide con kruskal en weight', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 4 });
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 2, weight: 3 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 2, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 1, to: 3, weight: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 4 });
+        (0, graph_theory_1.addEdge)(G, { from: 3, to: 4, weight: 2 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 4, weight: 7 });
+        const kw = (0, graph_theory_1.kruskal)(G).totalWeight;
+        const pw = (0, graph_theory_1.prim)(G).totalWeight;
+        (0, vitest_1.expect)(pw).toBe(kw);
+    });
+    (0, vitest_1.it)('prim en grafo desconectado cubre solo su componente', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        (0, graph_theory_1.addEdge)(G, { from: 0, to: 1, weight: 1 });
+        (0, graph_theory_1.addEdge)(G, { from: 2, to: 3, weight: 1 });
+        const r = (0, graph_theory_1.prim)(G, 0);
+        (0, vitest_1.expect)(r.edges.length).toBe(1);
+    });
+});
+// ------------------------------------------------------------
+// 6. Bipartite matching
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / matching bipartito', () => {
+    (0, vitest_1.it)('bipartiteMaximumMatching: 3 + 3 con 4 edges, max 3', () => {
+        // Lado izquierdo: L1, L2, L3 ; derecho: R1, R2, R3
+        // L1-R1, L1-R2, L2-R2, L3-R3
+        const G = (0, graph_theory_1.makeGraph)();
+        const left = new Set(['L1', 'L2', 'L3']);
+        (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R1' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R2' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L2', to: 'R2' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L3', to: 'R3' });
+        const m = (0, graph_theory_1.bipartiteMaximumMatching)(G, left);
+        (0, vitest_1.expect)(m.length).toBe(3);
+    });
+    (0, vitest_1.it)('hopcroftKarp coincide en tamaño con Kuhn', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        const left = new Set(['L1', 'L2', 'L3', 'L4']);
+        (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R1' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L1', to: 'R2' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L2', to: 'R1' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L3', to: 'R2' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L3', to: 'R3' });
+        (0, graph_theory_1.addEdge)(G, { from: 'L4', to: 'R3' });
+        const k = (0, graph_theory_1.bipartiteMaximumMatching)(G, left).length;
+        const h = (0, graph_theory_1.hopcroftKarp)(G, left).length;
+        (0, vitest_1.expect)(h).toBe(k);
+        (0, vitest_1.expect)(h).toBe(3);
+    });
+});
+// ------------------------------------------------------------
+// 7. Coloreo
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / coloreo', () => {
+    (0, vitest_1.it)('chromaticNumber de K4 = 4', () => {
+        (0, vitest_1.expect)((0, graph_theory_1.chromaticNumber)(completeGraph(4))).toBe(4);
+    });
+    (0, vitest_1.it)('chromaticNumber de bipartito completo K_{3,3} = 2', () => {
+        const G = (0, graph_theory_1.makeGraph)();
+        const left = ['l1', 'l2', 'l3'];
+        const right = ['r1', 'r2', 'r3'];
+        for (const l of left)
+            for (const r of right)
+                (0, graph_theory_1.addEdge)(G, { from: l, to: r });
+        (0, vitest_1.expect)((0, graph_theory_1.chromaticNumber)(G)).toBe(2);
+    });
+    (0, vitest_1.it)('chromaticNumber de C5 (impar) = 3', () => {
+        (0, vitest_1.expect)((0, graph_theory_1.chromaticNumber)(cycleGraph(5))).toBe(3);
+    });
+    (0, vitest_1.it)('greedyColoring no asigna mismo color a vecinos', () => {
+        const G = completeGraph(5);
+        const color = (0, graph_theory_1.greedyColoring)(G);
+        for (const e of G.edges) {
+            (0, vitest_1.expect)(color.get(e.from)).not.toBe(color.get(e.to));
+        }
+    });
+});
+// ------------------------------------------------------------
+// 8. Isomorfismo
+// ------------------------------------------------------------
+(0, vitest_1.describe)('graph-theory / isomorfismo', () => {
+    (0, vitest_1.it)('dos C5 son isomorfos', () => {
+        const G1 = cycleGraph(5);
+        const G2 = (0, graph_theory_1.makeGraph)();
+        const labels = ['a', 'b', 'c', 'd', 'e'];
+        for (const l of labels)
+            (0, graph_theory_1.addVertex)(G2, l);
+        for (let i = 0; i < labels.length; i++) {
+            (0, graph_theory_1.addEdge)(G2, { from: labels[i], to: labels[(i + 1) % labels.length] });
+        }
+        (0, vitest_1.expect)((0, graph_theory_1.areIsomorphic)(G1, G2)).toBe(true);
+    });
+    (0, vitest_1.it)('C5 y C6 no son isomorfos', () => {
+        (0, vitest_1.expect)((0, graph_theory_1.areIsomorphic)(cycleGraph(5), cycleGraph(6))).toBe(false);
+    });
+    (0, vitest_1.it)('K4 y C4 no son isomorfos (mismo |V| distinto |E|)', () => {
+        (0, vitest_1.expect)((0, graph_theory_1.areIsomorphic)(completeGraph(4), cycleGraph(4))).toBe(false);
+    });
+    (0, vitest_1.it)('findIsomorphism devuelve mapeo válido', () => {
+        const G1 = pathGraph(4);
+        const G2 = (0, graph_theory_1.makeGraph)();
+        const labels = ['w', 'x', 'y', 'z'];
+        for (const l of labels)
+            (0, graph_theory_1.addVertex)(G2, l);
+        for (let i = 0; i < labels.length - 1; i++) {
+            (0, graph_theory_1.addEdge)(G2, { from: labels[i], to: labels[i + 1] });
+        }
+        const m = (0, graph_theory_1.findIsomorphism)(G1, G2);
+        (0, vitest_1.expect)(m).not.toBeNull();
+        if (!m)
+            return;
+        // Verificar que las aristas se preservan.
+        for (const e of G1.edges) {
+            const f = m.get(e.from);
+            const t = m.get(e.to);
+            const found = G2.edges.some((e2) => (e2.from === f && e2.to === t) || (e2.from === t && e2.to === f));
+            (0, vitest_1.expect)(found).toBe(true);
+        }
+    });
+});
+//# sourceMappingURL=graph-theory.test.js.map

package/dist/tests/reasoning/graph-theory/graph-theory.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-theory.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/graph-theory/graph-theory.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,kEA2ByC;AAEzC,UAAU;AACV,SAAS,SAAS,CAAC,CAAS,EAAE,QAAQ,GAAG,KAAK;IAC5C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,QAAQ,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9E,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,QAAQ,GAAG,KAAK;IAC7C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,QAAQ,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAChF,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,KAAK,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+DAA+D;AAC/D,kBAAkB;AAClB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,gBAAgB;AAChB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,oBAAoB;QACpB,gBAAgB;QAChB,gBAAgB;QAChB,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAA,kBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,4CAA4C;QAC5C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,IAAA,kBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,qEAAqE;QACrE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAA,8BAAe,EAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,WAAW;YAAE,OAAO;QAClC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,kBAAkB;AAClB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,wBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,MAAM,KAAK,GAAG,IAAA,kCAAmB,EAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,IAAA,eAAM,EAAC,IAAA,0BAAW,EAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,mEAAmE;QACnE,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAA,0CAA2B,EAAC,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,0DAA0D;QAC1D,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,iCAAkB,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC;QACtB,mCAAmC;QACnC,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,qBAAqB;AACrB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,iBAAiB;QACjB,0BAA0B;QAC1B,gBAAgB;QAChB,gBAAgB;QAChB,eAAe;QACf,eAAe;QACf,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,EAAE,SAAS,EAAE,GAAG,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,yBAAyB;QAC3D,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;QAChD,IAAA,eAAM,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,oBAAoB;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,wBAAS,EAAS,IAAI,CAAC,CAAC;QAClC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAA,4BAAa,EAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,SAAS;AACT,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,8BAA8B;QAC9B,0CAA0C;QAC1C,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAClC,MAAM,EAAE,GAAG,IAAA,mBAAI,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAC/B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAA,mBAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,wBAAwB;AACxB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,mDAAmD;QACnD,6BAA6B;QAC7B,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACzC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,uCAAwB,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC/C,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,uCAAwB,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,2BAAY,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,aAAa;AACb,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,IAAA,sBAAO,EAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5E,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,CAAC,CAAC,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACxB,IAAA,eAAM,EAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,iBAAiB;AACjB,+DAA+D;AAC/D,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAA,wBAAS,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAA,sBAAO,EAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxE,CAAC;QACD,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,aAAa,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAA,wBAAS,GAAU,CAAC;QAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAA,wBAAS,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAA,sBAAO,EAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,CAAC,GAAG,IAAA,8BAAe,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,0CAA0C;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAW,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAW,CAAC;YAChC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CACzB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CACzE,CAAC;YACF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/group-presentation/group-presentation.test.d.ts

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

package/dist/tests/reasoning/group-presentation/group-presentation.test.d.ts.map

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

package/dist/tests/reasoning/group-presentation/group-presentation.test.js

@@ -0,0 +1,229 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const group_presentation_1 = require("../../../reasoning/group-presentation");
+(0, vitest_1.describe)('Group Presentation — palabras y reducción libre', () => {
+    (0, vitest_1.it)('inverse intercambia caja a↔A, r↔R', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('a')).toBe('A');
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('A')).toBe('a');
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('r')).toBe('R');
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('R')).toBe('r');
+    });
+    (0, vitest_1.it)('reduceWord cancela pares adyacentes inverso-mutuos', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'b', 'B', 'a'])).toEqual(['a', 'a']);
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['A', 'a', 'b'])).toEqual(['b']);
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'A'])).toEqual([]);
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)([])).toEqual([]);
+    });
+    (0, vitest_1.it)('reduceWord es idempotente y elimina cascadas', () => {
+        // a b B A → ε (cancelaciones encadenadas)
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'b', 'B', 'A'])).toEqual([]);
+        // a a b B A A → ε  (a²b · b⁻¹ · a⁻² )
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'a', 'b', 'B', 'A', 'A'])).toEqual([]);
+    });
+    (0, vitest_1.it)('multiplyWords concatena y reduce', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)(['a', 'b'], ['B', 'a'])).toEqual(['a', 'a']);
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)([], ['a'])).toEqual(['a']);
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)(['a'], ['A'])).toEqual([]);
+    });
+    (0, vitest_1.it)('invertWord invierte y aplica inverso a cada letra', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.invertWord)(['a', 'b', 'A'])).toEqual(['a', 'B', 'A']);
+        (0, vitest_1.expect)((0, group_presentation_1.invertWord)([])).toEqual([]);
+        // (w · w⁻¹) reduce a ε
+        const w = ['a', 'b', 'c', 'A'];
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)(w, (0, group_presentation_1.invertWord)(w))).toEqual([]);
+    });
+    (0, vitest_1.it)('wordEquals compara sintácticamente', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)(['a', 'b'], ['a', 'b'])).toBe(true);
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)(['a', 'b'], ['a', 'B'])).toBe(false);
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)([], [])).toBe(true);
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)(['a'], ['a', 'b'])).toBe(false);
+    });
+    (0, vitest_1.it)('isReduced detecta y rechaza cancelaciones pendientes', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)(['a', 'b'])).toBe(true);
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)(['a', 'A'])).toBe(false);
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)(['a', 'b', 'B'])).toBe(false);
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)([])).toBe(true);
+    });
+    (0, vitest_1.it)('parseWord y wordToString son inversas', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.parseWord)('abAb')).toEqual(['a', 'b', 'A', 'b']);
+        (0, vitest_1.expect)((0, group_presentation_1.wordToString)(['a', 'b', 'A', 'b'])).toBe('abAb');
+        (0, vitest_1.expect)((0, group_presentation_1.wordToString)([])).toBe('1');
+    });
+});
+(0, vitest_1.describe)('Group Presentation — Todd-Coxeter coset enumeration', () => {
+    (0, vitest_1.it)('cyclicGroupZn(5) tiene orden 5', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.cyclicGroupZn)(5))).toBe(5);
+    });
+    (0, vitest_1.it)('cyclicGroupZn(1) es trivial: orden 1', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.cyclicGroupZn)(1))).toBe(1);
+    });
+    (0, vitest_1.it)('cyclicGroupZn(7) — primo: orden 7', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.cyclicGroupZn)(7))).toBe(7);
+    });
+    (0, vitest_1.it)('dihedralGroupDn(3) tiene orden 6 (≅ S_3)', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(3))).toBe(6);
+    });
+    (0, vitest_1.it)('dihedralGroupDn(4) tiene orden 8', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(4))).toBe(8);
+    });
+    (0, vitest_1.it)('dihedralGroupDn(5) tiene orden 10', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(5))).toBe(10);
+    });
+    (0, vitest_1.it)('grupo libre F_2 tiene orden infinito', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.freeGroupFn)(2))).toBe('infinite');
+    });
+    (0, vitest_1.it)('grupo libre F_1 tiene orden infinito', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.freeGroupFn)(1))).toBe('infinite');
+    });
+    (0, vitest_1.it)('grupo trivial ⟨ | ⟩ tiene orden 1', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)({ generators: [], relations: [] })).toBe(1);
+    });
+    (0, vitest_1.it)('S_3 vía symmetricGroupSn(3) tiene orden 6', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.symmetricGroupSn)(3))).toBe(6);
+    });
+    (0, vitest_1.it)('S_4 vía symmetricGroupSn(4) tiene orden 24', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.symmetricGroupSn)(4), 256)).toBe(24);
+    });
+    (0, vitest_1.it)('Klein four-group ⟨a,b | a², b², (ab)²⟩ tiene orden 4', () => {
+        const klein = {
+            generators: ['a', 'b'],
+            relations: [
+                ['a', 'a'],
+                ['b', 'b'],
+                ['a', 'b', 'a', 'b'],
+            ],
+        };
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(klein)).toBe(4);
+    });
+    (0, vitest_1.it)('cap maxCosets demasiado bajo en F_2 devuelve unknown', () => {
+        // F_2 es infinito; con maxCosets=10, Todd-Coxeter no termina,
+        // aunque la rama 'infinite' lo detecta antes por ausencia de
+        // relaciones. Forzamos relación trivial para evitar el shortcut.
+        const almostFree = {
+            generators: ['a', 'b'],
+            relations: [['a', 'A']], // relación trivialmente reducible a vacío
+        };
+        // Como la relación reduce a ε, sigue siendo libre → 'infinite' por shortcut.
+        // Para forzar 'unknown' añadimos una relación no-trivial que no acote rápido:
+        const slow = {
+            generators: ['a', 'b'],
+            relations: [['a', 'b', 'A', 'B']], // commutator → Z²; con cap chico no termina
+        };
+        // Z² es infinito; cap pequeño da 'unknown'.
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(slow, 8)).toBe('unknown');
+        // El caso almostFree mantiene la rama 'infinite'.
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(almostFree)).toBe('infinite');
+    });
+});
+(0, vitest_1.describe)('Group Presentation — tabla de cosets y subgrupos', () => {
+    (0, vitest_1.it)('toddCoxeter sobre Z_6 produce 6 cosets', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.cyclicGroupZn)(6));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)(t.numCosets).toBe(6);
+    });
+    (0, vitest_1.it)('isInSubgroup: ⟨a²⟩ en Z_6 tiene índice 2 (Lagrange: |Z_6|/|⟨a²⟩|=6/3=2)', () => {
+        const z6 = (0, group_presentation_1.cyclicGroupZn)(6);
+        const t = (0, group_presentation_1.toddCoxeter)(z6, [['a', 'a']]);
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)(t.numCosets).toBe(2);
+        // a² ∈ ⟨a²⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a', 'a'], t)).toBe(true);
+        // a ∉ ⟨a²⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a'], t)).toBe(false);
+        // a⁴ ∈ ⟨a²⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a', 'a', 'a', 'a'], t)).toBe(true);
+    });
+    (0, vitest_1.it)('isInSubgroup: ⟨a³⟩ en Z_6 tiene índice 3 (Lagrange: 6/2=3)', () => {
+        const z6 = (0, group_presentation_1.cyclicGroupZn)(6);
+        const t = (0, group_presentation_1.toddCoxeter)(z6, [['a', 'a', 'a']]);
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)(t.numCosets).toBe(3);
+        // a³ ∈ ⟨a³⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a', 'a', 'a'], t)).toBe(true);
+        // a ∉ ⟨a³⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a'], t)).toBe(false);
+    });
+    (0, vitest_1.it)('isInSubgroup: ε siempre está en cualquier subgrupo', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.cyclicGroupZn)(4));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)([], t)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Group Presentation — Cayley graph', () => {
+    (0, vitest_1.it)('grafo de Cayley de Z_4 tiene 4 vértices y 4 aristas con un generador', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.cyclicGroupZn)(4));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        const g = (0, group_presentation_1.cayleyGraph)(t);
+        (0, vitest_1.expect)(g.vertices.length).toBe(4);
+        (0, vitest_1.expect)(g.edges.length).toBe(4); // solo el generador positivo 'a'
+        // Cada vértice tiene exactamente una arista saliente con 'a'.
+        const out = new Map();
+        for (const [v, ,] of g.edges) {
+            out.set(v, (out.get(v) ?? 0) + 1);
+        }
+        for (const v of g.vertices) {
+            (0, vitest_1.expect)(out.get(v)).toBe(1);
+        }
+    });
+    (0, vitest_1.it)('grafo de Cayley de D_3 tiene 6 vértices y 12 aristas (2 generadores)', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.dihedralGroupDn)(3));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        const g = (0, group_presentation_1.cayleyGraph)(t);
+        (0, vitest_1.expect)(g.vertices.length).toBe(6);
+        (0, vitest_1.expect)(g.edges.length).toBe(12); // 6 vértices × 2 generadores positivos
+    });
+    (0, vitest_1.it)('grafo de Cayley del grupo trivial tiene 1 vértice', () => {
+        const t = (0, group_presentation_1.toddCoxeter)({ generators: ['a'], relations: [['a']] });
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        const g = (0, group_presentation_1.cayleyGraph)(t);
+        (0, vitest_1.expect)(g.vertices.length).toBe(1);
+        // El bucle a: 1 → 1 cuenta como una arista.
+        (0, vitest_1.expect)(g.edges.length).toBe(1);
+    });
+});
+(0, vitest_1.describe)('Group Presentation — más familias clásicas', () => {
+    (0, vitest_1.it)('Z_2 × Z_2 (Klein) usando otra presentación', () => {
+        // ⟨a, b | a², b², ab=ba⟩  ↔  conmutador [a,b]=1
+        const v4 = {
+            generators: ['a', 'b'],
+            relations: [
+                ['a', 'a'],
+                ['b', 'b'],
+                ['a', 'b', 'A', 'B'], // [a,b] = 1
+            ],
+        };
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(v4)).toBe(4);
+    });
+    (0, vitest_1.it)('grupo cuaternio Q_8: ⟨a,b | a⁴, a²b⁻², bab⁻¹a⟩ tiene orden 8', () => {
+        // Presentación clásica: a^4 = 1, a^2 = b^2, b a b^{-1} = a^{-1}
+        // → relaciones a^4, a^2 b^{-2}, b a b^{-1} a
+        const q8 = {
+            generators: ['a', 'b'],
+            relations: [
+                ['a', 'a', 'a', 'a'],
+                ['a', 'a', 'B', 'B'],
+                ['b', 'a', 'B', 'a'],
+            ],
+        };
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(q8, 128)).toBe(8);
+    });
+    (0, vitest_1.it)('D_2 = Z_2 × Z_2 (Klein) tiene orden 4', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(2))).toBe(4);
+    });
+});
+//# sourceMappingURL=group-presentation.test.js.map