@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/tests/description-logic/alc.test.js

@@ -0,0 +1,253 @@
+"use strict";
+// ============================================================
+// ST Description Logic — Tests del perfil ALC
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const description_logic_1 = require("../../profiles/description-logic");
+(0, vitest_1.describe)('ALC — NNF', () => {
+    (0, vitest_1.it)('empuja ¬ al interior y elimina ⊤/⊥ bajo ¬', () => {
+        const c = (0, description_logic_1.not)((0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.or)((0, description_logic_1.atomic)('B'), (0, description_logic_1.atomic)('C'))));
+        const n = (0, description_logic_1.toNNF)(c);
+        // ¬(A ⊓ (B ⊔ C)) = ¬A ⊔ (¬B ⊓ ¬C)
+        (0, vitest_1.expect)((0, description_logic_1.conceptEqual)(n, (0, description_logic_1.or)((0, description_logic_1.not)((0, description_logic_1.atomic)('A')), (0, description_logic_1.and)((0, description_logic_1.not)((0, description_logic_1.atomic)('B')), (0, description_logic_1.not)((0, description_logic_1.atomic)('C')))))).toBe(true);
+    });
+    (0, vitest_1.it)('¬⊤ = ⊥ y ¬⊥ = ⊤', () => {
+        (0, vitest_1.expect)((0, description_logic_1.conceptEqual)((0, description_logic_1.toNNF)((0, description_logic_1.not)(description_logic_1.TOP)), description_logic_1.BOTTOM)).toBe(true);
+        (0, vitest_1.expect)((0, description_logic_1.conceptEqual)((0, description_logic_1.toNNF)((0, description_logic_1.not)(description_logic_1.BOTTOM)), description_logic_1.TOP)).toBe(true);
+    });
+    (0, vitest_1.it)('¬∃R.C = ∀R.¬C y viceversa', () => {
+        const c = (0, description_logic_1.atomic)('C');
+        (0, vitest_1.expect)((0, description_logic_1.conceptEqual)((0, description_logic_1.toNNF)((0, description_logic_1.not)((0, description_logic_1.exists)('R', c))), (0, description_logic_1.forall)('R', (0, description_logic_1.not)(c)))).toBe(true);
+        (0, vitest_1.expect)((0, description_logic_1.conceptEqual)((0, description_logic_1.toNNF)((0, description_logic_1.not)((0, description_logic_1.forall)('R', c))), (0, description_logic_1.exists)('R', (0, description_logic_1.not)(c)))).toBe(true);
+    });
+    (0, vitest_1.it)('conceptToString rinde notación legible', () => {
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)(description_logic_1.TOP)).toBe('⊤');
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)(description_logic_1.BOTTOM)).toBe('⊥');
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)((0, description_logic_1.atomic)('Dog'))).toBe('Dog');
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)((0, description_logic_1.not)((0, description_logic_1.atomic)('A')))).toBe('¬A');
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)((0, description_logic_1.exists)('hasChild', (0, description_logic_1.atomic)('Person')))).toBe('∃hasChild.Person');
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)((0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('A')))).toBe('∀R.A');
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)((0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B')))).toBe('(A ⊓ B)');
+        (0, vitest_1.expect)((0, description_logic_1.conceptToString)((0, description_logic_1.or)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B')))).toBe('(A ⊔ B)');
+    });
+    (0, vitest_1.it)('conceptHash es estable y conmutativo en and/or', () => {
+        const a = (0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B'));
+        const b = (0, description_logic_1.and)((0, description_logic_1.atomic)('B'), (0, description_logic_1.atomic)('A'));
+        (0, vitest_1.expect)((0, description_logic_1.conceptHash)(a)).toBe((0, description_logic_1.conceptHash)(b));
+    });
+});
+(0, vitest_1.describe)('ALC — Satisfiability básica', () => {
+    (0, vitest_1.it)('⊤ es satisfacible', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)(description_logic_1.TOP)).toBe(true);
+    });
+    (0, vitest_1.it)('⊥ NO es satisfacible', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)(description_logic_1.BOTTOM)).toBe(false);
+    });
+    (0, vitest_1.it)('A ⊓ ¬A es insatisfacible', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.not)((0, description_logic_1.atomic)('A'))))).toBe(false);
+    });
+    (0, vitest_1.it)('A ⊔ ¬A es satisfacible (TND clásico)', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.or)((0, description_logic_1.atomic)('A'), (0, description_logic_1.not)((0, description_logic_1.atomic)('A'))))).toBe(true);
+    });
+    (0, vitest_1.it)('A atómico solo es satisfacible', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.atomic)('A'))).toBe(true);
+    });
+    (0, vitest_1.it)('∃R.A es satisfacible con KB vacío', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.exists)('R', (0, description_logic_1.atomic)('A')))).toBe(true);
+    });
+    (0, vitest_1.it)('∀R.A es satisfacible (trivial: sin sucesores)', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('A')))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('ALC — Interacción ∃/∀', () => {
+    (0, vitest_1.it)('∃R.A ⊓ ∀R.¬A es INSATISFACIBLE', () => {
+        const c = (0, description_logic_1.and)((0, description_logic_1.exists)('R', (0, description_logic_1.atomic)('A')), (0, description_logic_1.forall)('R', (0, description_logic_1.not)((0, description_logic_1.atomic)('A'))));
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)(c)).toBe(false);
+    });
+    (0, vitest_1.it)('∃R.A ⊓ ∀R.A es satisfacible', () => {
+        const c = (0, description_logic_1.and)((0, description_logic_1.exists)('R', (0, description_logic_1.atomic)('A')), (0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('A')));
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)(c)).toBe(true);
+    });
+    (0, vitest_1.it)('∃R.(A ⊓ ¬A) es INSATISFACIBLE', () => {
+        const c = (0, description_logic_1.exists)('R', (0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.not)((0, description_logic_1.atomic)('A'))));
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)(c)).toBe(false);
+    });
+    (0, vitest_1.it)('∀R.⊥ ⊓ ∃R.⊤ es INSATISFACIBLE (existe sucesor que debe ser ⊥)', () => {
+        const c = (0, description_logic_1.and)((0, description_logic_1.forall)('R', description_logic_1.BOTTOM), (0, description_logic_1.exists)('R', description_logic_1.TOP));
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)(c)).toBe(false);
+    });
+    (0, vitest_1.it)('∃R.∃S.A es satisfacible (cadena de roles)', () => {
+        const c = (0, description_logic_1.exists)('R', (0, description_logic_1.exists)('S', (0, description_logic_1.atomic)('A')));
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)(c)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('ALC — Subsumption', () => {
+    (0, vitest_1.it)('A ⊓ B ⊑ A', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B')), (0, description_logic_1.atomic)('A'))).toBe(true);
+    });
+    (0, vitest_1.it)('A ⊑ A ⊔ B', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.atomic)('A'), (0, description_logic_1.or)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B')))).toBe(true);
+    });
+    (0, vitest_1.it)('A NO subsume a B sin KB', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B'))).toBe(false);
+    });
+    (0, vitest_1.it)('∃R.A ⊑ ∃R.(A ⊔ B)', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.exists)('R', (0, description_logic_1.atomic)('A')), (0, description_logic_1.exists)('R', (0, description_logic_1.or)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B'))))).toBe(true);
+    });
+    (0, vitest_1.it)('∀R.A ⊓ ∀R.B ⊑ ∀R.(A ⊓ B)', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.and)((0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('A')), (0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('B'))), (0, description_logic_1.forall)('R', (0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B'))))).toBe(true);
+    });
+    (0, vitest_1.it)('⊥ ⊑ C para todo C', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)(description_logic_1.BOTTOM, (0, description_logic_1.atomic)('A'))).toBe(true);
+    });
+    (0, vitest_1.it)('C ⊑ ⊤ para todo C', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.atomic)('A'), description_logic_1.TOP)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('ALC — Subsumption con TBox', () => {
+    const kb = {
+        tbox: [(0, description_logic_1.subsumes)((0, description_logic_1.atomic)('Dog'), (0, description_logic_1.atomic)('Mammal')), (0, description_logic_1.subsumes)((0, description_logic_1.atomic)('Mammal'), (0, description_logic_1.atomic)('Animal'))],
+        abox: [],
+    };
+    (0, vitest_1.it)('Dog ⊑ Animal (transitividad de subsumption)', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.atomic)('Dog'), (0, description_logic_1.atomic)('Animal'), kb)).toBe(true);
+    });
+    (0, vitest_1.it)('Dog ⊑ Mammal', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.atomic)('Dog'), (0, description_logic_1.atomic)('Mammal'), kb)).toBe(true);
+    });
+    (0, vitest_1.it)('Animal NO ⊑ Dog (sin información)', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.atomic)('Animal'), (0, description_logic_1.atomic)('Dog'), kb)).toBe(false);
+    });
+    (0, vitest_1.it)('equivalencia C ≡ D implica subsumption en ambas direcciones', () => {
+        const kb2 = {
+            tbox: [(0, description_logic_1.equivalent)((0, description_logic_1.atomic)('Bachelor'), (0, description_logic_1.and)((0, description_logic_1.atomic)('Unmarried'), (0, description_logic_1.atomic)('Man')))],
+            abox: [],
+        };
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.atomic)('Bachelor'), (0, description_logic_1.atomic)('Man'), kb2)).toBe(true);
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.and)((0, description_logic_1.atomic)('Unmarried'), (0, description_logic_1.atomic)('Man')), (0, description_logic_1.atomic)('Bachelor'), kb2)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('ALC — Instance checking', () => {
+    (0, vitest_1.it)('ABox {a:A, R(a,b), b:¬A}, ¿a : ∃R.¬A?  → true', () => {
+        const kb = {
+            tbox: [],
+            abox: [
+                (0, description_logic_1.instance)('a', (0, description_logic_1.atomic)('A')),
+                (0, description_logic_1.roleInstance)('a', 'R', 'b'),
+                (0, description_logic_1.instance)('b', (0, description_logic_1.not)((0, description_logic_1.atomic)('A'))),
+            ],
+        };
+        (0, vitest_1.expect)((0, description_logic_1.isInstance)('a', (0, description_logic_1.exists)('R', (0, description_logic_1.not)((0, description_logic_1.atomic)('A'))), kb)).toBe(true);
+    });
+    (0, vitest_1.it)('ABox {a:A}, a NO es instancia de B', () => {
+        const kb = {
+            tbox: [],
+            abox: [(0, description_logic_1.instance)('a', (0, description_logic_1.atomic)('A'))],
+        };
+        (0, vitest_1.expect)((0, description_logic_1.isInstance)('a', (0, description_logic_1.atomic)('B'), kb)).toBe(false);
+    });
+    (0, vitest_1.it)('TBox {A ⊑ B} + ABox {a:A} ⊨ a:B', () => {
+        const kb = {
+            tbox: [(0, description_logic_1.subsumes)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B'))],
+            abox: [(0, description_logic_1.instance)('a', (0, description_logic_1.atomic)('A'))],
+        };
+        (0, vitest_1.expect)((0, description_logic_1.isInstance)('a', (0, description_logic_1.atomic)('B'), kb)).toBe(true);
+    });
+    (0, vitest_1.it)('inconsistencia: {a:A, a:¬A} hace que a sea instancia de cualquier cosa', () => {
+        const kb = {
+            tbox: [],
+            abox: [(0, description_logic_1.instance)('a', (0, description_logic_1.atomic)('A')), (0, description_logic_1.instance)('a', (0, description_logic_1.not)((0, description_logic_1.atomic)('A')))],
+        };
+        // KB inconsistente ⇒ todo se sigue (ex falso quodlibet)
+        (0, vitest_1.expect)((0, description_logic_1.isInstance)('a', (0, description_logic_1.atomic)('Z'), kb)).toBe(true);
+    });
+    (0, vitest_1.it)('∀R.A propaga: {R(a,b), a:∀R.A} ⊨ b:A', () => {
+        const kb = {
+            tbox: [],
+            abox: [(0, description_logic_1.roleInstance)('a', 'R', 'b'), (0, description_logic_1.instance)('a', (0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('A')))],
+        };
+        (0, vitest_1.expect)((0, description_logic_1.isInstance)('b', (0, description_logic_1.atomic)('A'), kb)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('ALC — Classify (taxonomía)', () => {
+    (0, vitest_1.it)('jerarquía simple Dog ⊑ Mammal ⊑ Animal', () => {
+        const kb = {
+            tbox: [
+                (0, description_logic_1.subsumes)((0, description_logic_1.atomic)('Dog'), (0, description_logic_1.atomic)('Mammal')),
+                (0, description_logic_1.subsumes)((0, description_logic_1.atomic)('Mammal'), (0, description_logic_1.atomic)('Animal')),
+            ],
+            abox: [],
+        };
+        const tax = (0, description_logic_1.classify)(kb);
+        // Dog está subsumido por Dog, Mammal, Animal, ⊤
+        (0, vitest_1.expect)(tax.get('Dog').has('Mammal')).toBe(true);
+        (0, vitest_1.expect)(tax.get('Dog').has('Animal')).toBe(true);
+        (0, vitest_1.expect)(tax.get('Dog').has('⊤')).toBe(true);
+        // Mammal por sí mismo + Animal + ⊤ (no Dog)
+        (0, vitest_1.expect)(tax.get('Mammal').has('Animal')).toBe(true);
+        (0, vitest_1.expect)(tax.get('Mammal').has('Dog')).toBe(false);
+        // Animal por sí mismo + ⊤
+        (0, vitest_1.expect)(tax.get('Animal').has('Dog')).toBe(false);
+        (0, vitest_1.expect)(tax.get('Animal').has('Mammal')).toBe(false);
+        (0, vitest_1.expect)(tax.get('Animal').has('⊤')).toBe(true);
+    });
+    (0, vitest_1.it)('concepto insatisfacible aparece como subsumido por TODO', () => {
+        const kb = {
+            tbox: [
+                (0, description_logic_1.subsumes)((0, description_logic_1.atomic)('Round'), (0, description_logic_1.not)((0, description_logic_1.atomic)('Square'))),
+                (0, description_logic_1.subsumes)((0, description_logic_1.atomic)('RoundSquare'), (0, description_logic_1.and)((0, description_logic_1.atomic)('Round'), (0, description_logic_1.atomic)('Square'))),
+            ],
+            abox: [],
+        };
+        const tax = (0, description_logic_1.classify)(kb);
+        // RoundSquare es insatisfacible → subsumido por todo, incluso conceptos no-relacionados
+        const rs = tax.get('RoundSquare');
+        (0, vitest_1.expect)(rs.has('Round')).toBe(true);
+        (0, vitest_1.expect)(rs.has('Square')).toBe(true);
+        (0, vitest_1.expect)(rs.has('⊥')).toBe(true);
+    });
+});
+(0, vitest_1.describe)('ALC — emptyKB helper', () => {
+    (0, vitest_1.it)('emptyKB devuelve una KB vacía utilizable', () => {
+        const kb = (0, description_logic_1.emptyKB)();
+        (0, vitest_1.expect)(kb.tbox).toEqual([]);
+        (0, vitest_1.expect)(kb.abox).toEqual([]);
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.atomic)('A'), kb)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('ALC — Terminación con TBox cíclico (blocking)', () => {
+    (0, vitest_1.it)('TBox cíclico Person ≡ ∃hasParent.Person no diverge y A:Person es satisfacible', () => {
+        const kb = {
+            tbox: [(0, description_logic_1.equivalent)((0, description_logic_1.atomic)('Person'), (0, description_logic_1.exists)('hasParent', (0, description_logic_1.atomic)('Person')))],
+            abox: [],
+        };
+        // No debe colgarse — el blocking garantiza terminación.
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.atomic)('Person'), kb)).toBe(true);
+    });
+    (0, vitest_1.it)('TBox cíclico contradictorio Person ⊑ ∃hasFoo.Person ⊓ ∀hasFoo.⊥ es insatisfacible', () => {
+        const kb = {
+            tbox: [
+                (0, description_logic_1.subsumes)((0, description_logic_1.atomic)('Person'), (0, description_logic_1.and)((0, description_logic_1.exists)('hasFoo', (0, description_logic_1.atomic)('Person')), (0, description_logic_1.forall)('hasFoo', description_logic_1.BOTTOM))),
+            ],
+            abox: [],
+        };
+        (0, vitest_1.expect)((0, description_logic_1.isSatisfiable)((0, description_logic_1.atomic)('Person'), kb)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('ALC — Casos clásicos OWL/DL', () => {
+    (0, vitest_1.it)('regla de De Morgan a nivel de concepto', () => {
+        // ¬(A ⊓ B) ≡ ¬A ⊔ ¬B
+        const lhs = (0, description_logic_1.not)((0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B')));
+        const rhs = (0, description_logic_1.or)((0, description_logic_1.not)((0, description_logic_1.atomic)('A')), (0, description_logic_1.not)((0, description_logic_1.atomic)('B')));
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)(lhs, rhs)).toBe(true);
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)(rhs, lhs)).toBe(true);
+    });
+    (0, vitest_1.it)('axioma K modal: ∀R.(A ⊓ B) ⊑ ∀R.A ⊓ ∀R.B', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.forall)('R', (0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B'))), (0, description_logic_1.and)((0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('A')), (0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('B'))))).toBe(true);
+    });
+    (0, vitest_1.it)('∃R.A ⊓ ∀R.B ⊑ ∃R.(A ⊓ B)', () => {
+        (0, vitest_1.expect)((0, description_logic_1.isSubsumed)((0, description_logic_1.and)((0, description_logic_1.exists)('R', (0, description_logic_1.atomic)('A')), (0, description_logic_1.forall)('R', (0, description_logic_1.atomic)('B'))), (0, description_logic_1.exists)('R', (0, description_logic_1.and)((0, description_logic_1.atomic)('A'), (0, description_logic_1.atomic)('B'))))).toBe(true);
+    });
+});
+//# sourceMappingURL=alc.test.js.map

package/dist/tests/description-logic/alc.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"alc.test.js","sourceRoot":"","sources":["../../../src/tests/description-logic/alc.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8CAA8C;AAC9C,+DAA+D;;AAE/D,mCAA8C;AAC9C,wEAuB0C;AAE1C,IAAA,iBAAQ,EAAC,WAAW,EAAE,GAAG,EAAE;IACzB,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAE,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,IAAA,yBAAK,EAAC,CAAC,CAAC,CAAC;QACnB,kCAAkC;QAClC,IAAA,eAAM,EAAC,IAAA,gCAAY,EAAC,CAAC,EAAE,IAAA,sBAAE,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CACzF,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,IAAA,eAAM,EAAC,IAAA,gCAAY,EAAC,IAAA,yBAAK,EAAC,IAAA,uBAAG,EAAC,uBAAG,CAAC,CAAC,EAAE,0BAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,IAAA,gCAAY,EAAC,IAAA,yBAAK,EAAC,IAAA,uBAAG,EAAC,0BAAM,CAAC,CAAC,EAAE,uBAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,gCAAY,EAAC,IAAA,yBAAK,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjF,IAAA,eAAM,EAAC,IAAA,gCAAY,EAAC,IAAA,yBAAK,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,uBAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,0BAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,IAAA,0BAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,IAAA,0BAAM,EAAC,UAAU,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACvF,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,IAAA,mCAAe,EAAC,IAAA,sBAAE,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,GAAG,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAA,+BAAW,EAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,uBAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,0BAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,sBAAE,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,GAAG,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,0BAAM,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,uBAAG,CAAC,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAA,WAAE,EAAC,WAAW,EAAE,GAAG,EAAE;QACnB,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,WAAW,EAAE,GAAG,EAAE;QACnB,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,sBAAE,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,sBAAE,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAC1F,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EACJ,IAAA,8BAAU,EACR,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,EACvD,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAC3C,CACF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,0BAAM,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,uBAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,MAAM,EAAE,GAAoB;QAC1B,IAAI,EAAE,CAAC,IAAA,4BAAQ,EAAC,IAAA,0BAAM,EAAC,KAAK,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,IAAA,4BAAQ,EAAC,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC,CAAC;QAC/F,IAAI,EAAE,EAAE;KACT,CAAC;IAEF,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,KAAK,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,cAAc,EAAE,GAAG,EAAE;QACtB,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,KAAK,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,IAAA,0BAAM,EAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAoB;YAC3B,IAAI,EAAE,CAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,UAAU,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,WAAW,CAAC,EAAE,IAAA,0BAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/E,IAAI,EAAE,EAAE;SACT,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,UAAU,CAAC,EAAE,IAAA,0BAAM,EAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,WAAW,CAAC,EAAE,IAAA,0BAAM,EAAC,KAAK,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE,EAAE;YACR,IAAI,EAAE;gBACJ,IAAA,4BAAQ,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC;gBAC1B,IAAA,gCAAY,EAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;gBAC3B,IAAA,4BAAQ,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC;aAChC;SACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE,EAAE;YACR,IAAI,EAAE,CAAC,IAAA,4BAAQ,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC;SACnC,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE,CAAC,IAAA,4BAAQ,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,EAAE,CAAC,IAAA,4BAAQ,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC;SACnC,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE,EAAE;YACR,IAAI,EAAE,CAAC,IAAA,4BAAQ,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,4BAAQ,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACpE,CAAC;QACF,wDAAwD;QACxD,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE,EAAE;YACR,IAAI,EAAE,CAAC,IAAA,gCAAY,EAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAA,4BAAQ,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC7E,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE;gBACJ,IAAA,4BAAQ,EAAC,IAAA,0BAAM,EAAC,KAAK,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC;gBACzC,IAAA,4BAAQ,EAAC,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC;aAC7C;YACD,IAAI,EAAE,EAAE;SACT,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,4BAAQ,EAAC,EAAE,CAAC,CAAC;QACzB,gDAAgD;QAChD,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,4CAA4C;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,0BAA0B;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE;gBACJ,IAAA,4BAAQ,EAAC,IAAA,0BAAM,EAAC,OAAO,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC,CAAC;gBAChD,IAAA,4BAAQ,EAAC,IAAA,0BAAM,EAAC,aAAa,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,OAAO,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC,CAAC;aACxE;YACD,IAAI,EAAE,EAAE;SACT,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,4BAAQ,EAAC,EAAE,CAAC,CAAC;QACzB,wFAAwF;QACxF,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC;QACnC,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,EAAE,GAAG,IAAA,2BAAO,GAAE,CAAC;QACrB,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+CAA+C,EAAE,GAAG,EAAE;IAC7D,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE,CAAC,IAAA,8BAAU,EAAC,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,IAAA,0BAAM,EAAC,WAAW,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3E,IAAI,EAAE,EAAE;SACT,CAAC;QACF,wDAAwD;QACxD,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mFAAmF,EAAE,GAAG,EAAE;QAC3F,MAAM,EAAE,GAAoB;YAC1B,IAAI,EAAE;gBACJ,IAAA,4BAAQ,EACN,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAChB,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,QAAQ,EAAE,IAAA,0BAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,QAAQ,EAAE,0BAAM,CAAC,CAAC,CAClE;aACF;YACD,IAAI,EAAE,EAAE;SACT,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,iCAAa,EAAC,IAAA,0BAAM,EAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,qBAAqB;QACrB,MAAM,GAAG,GAAG,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAA,sBAAE,EAAC,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,IAAA,eAAM,EACJ,IAAA,8BAAU,EACR,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,EAC1C,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CACxD,CACF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EACJ,IAAA,8BAAU,EACR,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,EACvD,IAAA,0BAAM,EAAC,GAAG,EAAE,IAAA,uBAAG,EAAC,IAAA,0BAAM,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAM,EAAC,GAAG,CAAC,CAAC,CAAC,CAC3C,CACF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/fca/fca.test.d.ts

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

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

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

package/dist/tests/fca/fca.test.js

@@ -0,0 +1,317 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const fca_1 = require("../../runtime/fca");
+function set(...xs) {
+    return new Set(xs);
+}
+function setsEqual(a, b) {
+    if (a.size !== b.size)
+        return false;
+    for (const x of a)
+        if (!b.has(x))
+            return false;
+    return true;
+}
+/**
+ * Contexto "living beings" clásico de la literatura (Ganter & Wille, simplificado).
+ * 4 objetos × 4 atributos:
+ *               needs-water  lives-in-water  lives-on-land  has-leaves
+ *   fish-leech      X             X
+ *   bream           X             X
+ *   reed            X             X              X            X
+ *   bean            X                            X            X
+ *
+ * Conceptos esperados (clausuras de intents):
+ *   ∅            (lectic 1st) → intent = closeIntent(∅) = {needs-water}
+ *                                       (todos comparten needs-water)
+ *   {fish-leech, bream, reed} → intent {needs-water, lives-in-water}
+ *   {reed}                    → intent {needs-water, lives-in-water,
+ *                                       lives-on-land, has-leaves}
+ *   {reed, bean}              → intent {needs-water, lives-on-land, has-leaves}
+ *   {fish-leech,bream,reed,bean} top → {needs-water}
+ *   etc.
+ * El número exacto se calcula vía allConcepts (lo verificamos con el código).
+ */
+function livingBeingsContext() {
+    return (0, fca_1.createContext)(['fish-leech', 'bream', 'reed', 'bean'], ['needs-water', 'lives-in-water', 'lives-on-land', 'has-leaves'], [
+        ['fish-leech', 'needs-water'],
+        ['fish-leech', 'lives-in-water'],
+        ['bream', 'needs-water'],
+        ['bream', 'lives-in-water'],
+        ['reed', 'needs-water'],
+        ['reed', 'lives-in-water'],
+        ['reed', 'lives-on-land'],
+        ['reed', 'has-leaves'],
+        ['bean', 'needs-water'],
+        ['bean', 'lives-on-land'],
+        ['bean', 'has-leaves'],
+    ]);
+}
+(0, vitest_1.describe)('FCA — createContext y operadores polares de Galois', () => {
+    (0, vitest_1.it)('rechaza identificadores con el separador reservado "|"', () => {
+        (0, vitest_1.expect)(() => (0, fca_1.createContext)(['a|b'], ['m'], [])).toThrow(/separador/);
+        (0, vitest_1.expect)(() => (0, fca_1.createContext)(['a'], ['m|n'], [])).toThrow(/separador/);
+    });
+    (0, vitest_1.it)('rechaza objetos o atributos duplicados', () => {
+        (0, vitest_1.expect)(() => (0, fca_1.createContext)(['a', 'a'], ['m'], [])).toThrow(/duplicado/);
+        (0, vitest_1.expect)(() => (0, fca_1.createContext)(['a'], ['m', 'm'], [])).toThrow(/duplicado/);
+    });
+    (0, vitest_1.it)('rechaza incidencias hacia objetos o atributos no declarados', () => {
+        (0, vitest_1.expect)(() => (0, fca_1.createContext)(['a'], ['m'], [['a', 'x']])).toThrow(/atributo/);
+        (0, vitest_1.expect)(() => (0, fca_1.createContext)(['a'], ['m'], [['z', 'm']])).toThrow(/objeto/);
+    });
+    (0, vitest_1.it)('derivativeObjects({}) = G (convención: ∀ trivial sobre conjunto vacío)', () => {
+        const K = livingBeingsContext();
+        const G = (0, fca_1.derivativeObjects)(K, set());
+        (0, vitest_1.expect)(setsEqual(G, set('fish-leech', 'bream', 'reed', 'bean'))).toBe(true);
+    });
+    (0, vitest_1.it)('derivativeAttributes({}) = M', () => {
+        const K = livingBeingsContext();
+        const M = (0, fca_1.derivativeAttributes)(K, set());
+        (0, vitest_1.expect)(setsEqual(M, set('needs-water', 'lives-in-water', 'lives-on-land', 'has-leaves'))).toBe(true);
+    });
+    (0, vitest_1.it)('derivativeObjects: {lives-in-water} → {fish-leech, bream, reed}', () => {
+        const K = livingBeingsContext();
+        const r = (0, fca_1.derivativeObjects)(K, set('lives-in-water'));
+        (0, vitest_1.expect)(setsEqual(r, set('fish-leech', 'bream', 'reed'))).toBe(true);
+    });
+    (0, vitest_1.it)('derivativeAttributes: {reed, bean} → {needs-water, lives-on-land, has-leaves}', () => {
+        const K = livingBeingsContext();
+        const r = (0, fca_1.derivativeAttributes)(K, set('reed', 'bean'));
+        (0, vitest_1.expect)(setsEqual(r, set('needs-water', 'lives-on-land', 'has-leaves'))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('FCA — clausura Galois e isConcept', () => {
+    (0, vitest_1.it)('closeIntent es idempotente: closure(closure(B)) = closure(B)', () => {
+        const K = livingBeingsContext();
+        const seeds = [
+            set(),
+            set('needs-water'),
+            set('lives-in-water'),
+            set('has-leaves'),
+            set('lives-on-land', 'has-leaves'),
+            set('needs-water', 'lives-in-water', 'lives-on-land', 'has-leaves'),
+        ];
+        for (const s of seeds) {
+            const c1 = (0, fca_1.closeIntent)(K, s);
+            const c2 = (0, fca_1.closeIntent)(K, c1);
+            (0, vitest_1.expect)(setsEqual(c1, c2)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('closeIntent extiende el seed (B ⊆ B" siempre)', () => {
+        const K = livingBeingsContext();
+        const seed = set('lives-in-water');
+        const closed = (0, fca_1.closeIntent)(K, seed);
+        for (const m of seed)
+            (0, vitest_1.expect)(closed.has(m)).toBe(true);
+    });
+    (0, vitest_1.it)('isConcept reconoce ({reed}, {needs-water, lives-in-water, lives-on-land, has-leaves})', () => {
+        const K = livingBeingsContext();
+        (0, vitest_1.expect)((0, fca_1.isConcept)(K, set('reed'), set('needs-water', 'lives-in-water', 'lives-on-land', 'has-leaves'))).toBe(true);
+    });
+    (0, vitest_1.it)('isConcept rechaza pares no-cerrados', () => {
+        const K = livingBeingsContext();
+        // intent incompleto: {reed} en realidad determina los 4 atributos, no 1.
+        (0, vitest_1.expect)((0, fca_1.isConcept)(K, set('reed'), set('needs-water'))).toBe(false);
+        // extent incompleto: {needs-water, lives-in-water}' = {fish-leech, bream, reed},
+        // no {fish-leech} solo.
+        (0, vitest_1.expect)((0, fca_1.isConcept)(K, set('fish-leech'), set('needs-water', 'lives-in-water'))).toBe(false);
+    });
+});
+(0, vitest_1.describe)('FCA — allConcepts (Next Closure, Ganter)', () => {
+    (0, vitest_1.it)('contexto living-beings: genera los conceptos esperados sin duplicados', () => {
+        const K = livingBeingsContext();
+        const cs = (0, fca_1.allConcepts)(K);
+        // Sin duplicados (intents únicos como firma).
+        const intentSignatures = new Set(cs.map((c) => [...c.intent].sort().join(',')));
+        (0, vitest_1.expect)(intentSignatures.size).toBe(cs.length);
+        // Cada par devuelto cumple A' = B y B' = A.
+        for (const c of cs) {
+            (0, vitest_1.expect)((0, fca_1.isConcept)(K, c.extent, c.intent)).toBe(true);
+        }
+        // Top concept (extent = G) presente: intent = atributos comunes a todos = {needs-water}.
+        const top = cs.find((c) => c.extent.size === 4);
+        (0, vitest_1.expect)(top).toBeDefined();
+        (0, vitest_1.expect)(setsEqual(top.intent, set('needs-water'))).toBe(true);
+        // Bottom concept (intent = M = los 4 atrs) presente:
+        // como `reed` posee los 4 atributos, su extent es {reed}, no ∅.
+        const bottom = cs.find((c) => c.intent.size === 4);
+        (0, vitest_1.expect)(bottom).toBeDefined();
+        (0, vitest_1.expect)(setsEqual(bottom.extent, set('reed'))).toBe(true);
+        // Concepto ({reed}, los 4 atrs) ES el bottom: lo verificamos por separado
+        // mirando que es el único concepto con extent={reed}.
+        const reedOnly = cs.find((c) => c.extent.size === 1 && c.extent.has('reed'));
+        (0, vitest_1.expect)(reedOnly).toBeDefined();
+        (0, vitest_1.expect)(reedOnly.intent.size).toBe(4);
+        // Enumeración manual del lattice:
+        //   1. (G,                     {needs-water})                        — top
+        //   2. ({fl, br, reed},        {needs-water, lives-in-water})
+        //   3. ({reed, bean},          {needs-water, lives-on-land, has-leaves})
+        //   4. ({reed},                M)                                    — bottom
+        // Más: ({bean}, {nw, lol, hl})? No: {bean}' = {nw, lol, hl}, pero
+        //   {nw, lol, hl}' = {reed, bean}, no {bean} — no es concepto.
+        // 4 conceptos cerrados en este lattice (top + 2 intermedios + bottom).
+        (0, vitest_1.expect)(cs.length).toBe(4);
+    });
+    (0, vitest_1.it)('contexto trivial vacío (sin objetos ni atributos): exactamente 1 concepto (∅, ∅)', () => {
+        const K = (0, fca_1.createContext)([], [], []);
+        const cs = (0, fca_1.allConcepts)(K);
+        (0, vitest_1.expect)(cs.length).toBe(1);
+        (0, vitest_1.expect)(cs[0].extent.size).toBe(0);
+        (0, vitest_1.expect)(cs[0].intent.size).toBe(0);
+    });
+    (0, vitest_1.it)('contexto con un objeto sin atributos: 2 conceptos (top y bottom degenerados)', () => {
+        const K = (0, fca_1.createContext)(['solo'], ['m'], []);
+        const cs = (0, fca_1.allConcepts)(K);
+        // closeIntent(∅) = ∅'' = ({solo})' = ∅  (solo no tiene atributos)
+        //   → concepto top: ({solo}, ∅).
+        // Siguiente: closeIntent({m}) = {m}'' = (∅)' = {m}
+        //   → concepto bottom: (∅, {m}).
+        (0, vitest_1.expect)(cs.length).toBe(2);
+        const top = cs.find((c) => c.extent.size === 1);
+        const bot = cs.find((c) => c.extent.size === 0);
+        (0, vitest_1.expect)(setsEqual(top.extent, set('solo'))).toBe(true);
+        (0, vitest_1.expect)(top.intent.size).toBe(0);
+        (0, vitest_1.expect)(setsEqual(bot.intent, set('m'))).toBe(true);
+    });
+    (0, vitest_1.it)('contexto discreto (identidad): los closed-intents son {∅, {A}, {B}, {C}, M} → 5 conceptos', () => {
+        // n=3: G = {a,b,c}, M = {A,B,C}, I = {(a,A),(b,B),(c,C)}.
+        // Cualquier subconjunto de objetos de tamaño ≥ 2 comparte 0 atributos,
+        // luego su intent común es ∅, que cierra a ∅ ó a M según el operador
+        // doble. Los conjuntos cerrados de atributos son: ∅, {A}, {B}, {C}, M.
+        // Esto da 5 conceptos (no 2^3=8: el lattice NO es boolean porque los
+        // singletons en M son atómicos y no hay combinaciones intermedias).
+        const K = (0, fca_1.createContext)(['a', 'b', 'c'], ['A', 'B', 'C'], [
+            ['a', 'A'],
+            ['b', 'B'],
+            ['c', 'C'],
+        ]);
+        const cs = (0, fca_1.allConcepts)(K);
+        (0, vitest_1.expect)(cs.length).toBe(5);
+        // Sin duplicados.
+        const sigs = new Set(cs.map((c) => [...c.intent].sort().join(',')));
+        (0, vitest_1.expect)(sigs.size).toBe(5);
+    });
+});
+(0, vitest_1.describe)('FCA — lattice (Hasse) y orden por inclusión de extents', () => {
+    (0, vitest_1.it)('aristas conectan conceptos con extent estrictamente incluido', () => {
+        const K = livingBeingsContext();
+        const cs = (0, fca_1.allConcepts)(K);
+        const H = (0, fca_1.lattice)(cs);
+        for (const [i, j] of H.edges) {
+            const ci = cs[i];
+            const cj = cs[j];
+            // Subconjunto estricto: ci.extent ⊊ cj.extent.
+            (0, vitest_1.expect)(ci.extent.size).toBeLessThan(cj.extent.size);
+            for (const o of ci.extent)
+                (0, vitest_1.expect)(cj.extent.has(o)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('no hay aristas de cobertura "saltadas" (orden de Hasse mínimo)', () => {
+        const K = livingBeingsContext();
+        const cs = (0, fca_1.allConcepts)(K);
+        const H = (0, fca_1.lattice)(cs);
+        // Para cada arista (i, j), no debe existir k distinto con extent_i ⊊ extent_k ⊊ extent_j.
+        for (const [i, j] of H.edges) {
+            const ei = cs[i].extent;
+            const ej = cs[j].extent;
+            for (let k = 0; k < cs.length; k++) {
+                if (k === i || k === j)
+                    continue;
+                const ek = cs[k].extent;
+                const ekStrictGtEi = ek.size > ei.size && [...ei].every((x) => ek.has(x));
+                const ejStrictGtEk = ej.size > ek.size && [...ek].every((x) => ej.has(x));
+                (0, vitest_1.expect)(ekStrictGtEi && ejStrictGtEk).toBe(false);
+            }
+        }
+    });
+    (0, vitest_1.it)('lattice del contexto discreto-3: estrella con 6 aristas de cobertura', () => {
+        // 5 conceptos: bottom (intent=M, extent=∅) — 3 átomos ({g},{Attr_g}) — top (G,∅).
+        // Hasse: bottom cubre los 3 átomos (3 aristas) y los 3 átomos están
+        // cubiertos por top (3 aristas). Total = 6.
+        const K = (0, fca_1.createContext)(['a', 'b', 'c'], ['A', 'B', 'C'], [
+            ['a', 'A'],
+            ['b', 'B'],
+            ['c', 'C'],
+        ]);
+        const cs = (0, fca_1.allConcepts)(K);
+        const H = (0, fca_1.lattice)(cs);
+        (0, vitest_1.expect)(H.edges.length).toBe(6);
+    });
+});
+(0, vitest_1.describe)('FCA — implicaciones de atributos', () => {
+    (0, vitest_1.it)('impliesAll: {has-leaves} → {lives-on-land} es válida en living-beings', () => {
+        // Todos los objetos con has-leaves (reed, bean) viven en tierra.
+        const K = livingBeingsContext();
+        (0, vitest_1.expect)((0, fca_1.impliesAll)(K, set('has-leaves'), set('lives-on-land'))).toBe(true);
+    });
+    (0, vitest_1.it)('impliesAll: {lives-in-water} → {has-leaves} es inválida (fish-leech contraejemplo)', () => {
+        const K = livingBeingsContext();
+        (0, vitest_1.expect)((0, fca_1.impliesAll)(K, set('lives-in-water'), set('has-leaves'))).toBe(false);
+    });
+    (0, vitest_1.it)('impliesAll: {} → {needs-water} es válida (atributo común a todos)', () => {
+        const K = livingBeingsContext();
+        (0, vitest_1.expect)((0, fca_1.impliesAll)(K, set(), set('needs-water'))).toBe(true);
+    });
+    (0, vitest_1.it)('impliesAll vacua: cualquier premisa → ∅ es válida', () => {
+        const K = livingBeingsContext();
+        (0, vitest_1.expect)((0, fca_1.impliesAll)(K, set('lives-on-land'), set())).toBe(true);
+    });
+    (0, vitest_1.it)("caracterización extensional: a → b sii a' ⊆ b'", () => {
+        const K = livingBeingsContext();
+        // a = {lives-on-land}, b = {has-leaves}: ambos tienen extent {reed, bean}.
+        // Luego a' = b' y la implicación va en ambos sentidos.
+        (0, vitest_1.expect)((0, fca_1.impliesAll)(K, set('lives-on-land'), set('has-leaves'))).toBe(true);
+        (0, vitest_1.expect)((0, fca_1.impliesAll)(K, set('has-leaves'), set('lives-on-land'))).toBe(true);
+        // Comprobación equivalente con derivativeObjects.
+        const aPrime = (0, fca_1.derivativeObjects)(K, set('lives-on-land'));
+        const bPrime = (0, fca_1.derivativeObjects)(K, set('has-leaves'));
+        (0, vitest_1.expect)(setsEqual(aPrime, bPrime)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('FCA — concept lattice como retículo completo', () => {
+    (0, vitest_1.it)('Top concept tiene extent = G y intent = atributos comunes a todos', () => {
+        const K = livingBeingsContext();
+        const cs = (0, fca_1.allConcepts)(K);
+        const top = cs.find((c) => c.extent.size === 4);
+        (0, vitest_1.expect)(setsEqual(top.extent, set('fish-leech', 'bream', 'reed', 'bean'))).toBe(true);
+        // En este contexto: needs-water es el único atributo común.
+        (0, vitest_1.expect)(setsEqual(top.intent, set('needs-water'))).toBe(true);
+    });
+    (0, vitest_1.it)('Bottom concept tiene intent = M; extent = ∅ sólo si ningún objeto los tiene todos', () => {
+        // En living-beings, "reed" posee los 4 atributos → bottom = ({reed}, M).
+        const K = livingBeingsContext();
+        const cs = (0, fca_1.allConcepts)(K);
+        const bottom = cs.find((c) => c.intent.size === 4);
+        (0, vitest_1.expect)(setsEqual(bottom.extent, set('reed'))).toBe(true);
+        (0, vitest_1.expect)(setsEqual(bottom.intent, set('needs-water', 'lives-in-water', 'lives-on-land', 'has-leaves'))).toBe(true);
+        // Contexto adicional donde nadie tiene todos: ahora sí el extent del bottom es ∅.
+        const K2 = (0, fca_1.createContext)(['x', 'y'], ['p', 'q'], [
+            ['x', 'p'],
+            ['y', 'q'],
+        ]);
+        const cs2 = (0, fca_1.allConcepts)(K2);
+        const bot2 = cs2.find((c) => c.intent.size === 2);
+        (0, vitest_1.expect)(bot2.extent.size).toBe(0);
+    });
+    (0, vitest_1.it)('todos los conceptos son cerrados (verificación cruzada con isConcept)', () => {
+        const K = livingBeingsContext();
+        const cs = (0, fca_1.allConcepts)(K);
+        for (const c of cs)
+            (0, vitest_1.expect)((0, fca_1.isConcept)(K, c.extent, c.intent)).toBe(true);
+    });
+    (0, vitest_1.it)('un objeto pertenece al extent de un concepto sii su intent ⊇ intent del concepto', () => {
+        const K = livingBeingsContext();
+        const cs = (0, fca_1.allConcepts)(K);
+        for (const c of cs) {
+            for (const g of c.extent) {
+                // Atributos del objeto g: {g}'.
+                const gAttrs = (0, fca_1.derivativeAttributes)(K, set(g));
+                for (const m of c.intent)
+                    (0, vitest_1.expect)(gAttrs.has(m)).toBe(true);
+            }
+        }
+    });
+});
+//# sourceMappingURL=fca.test.js.map