@stevenvo780/st-lang 4.11.0 → 4.13.0

package/dist/reasoning/lattice/index.js

@@ -0,0 +1,587 @@
+"use strict";
+/**
+ * Finite lattice theory.
+ *
+ * A lattice is a poset (P, ≤) in which every pair of elements has both
+ * a least upper bound (join, ∨) and a greatest lower bound (meet, ∧).
+ *
+ * This module focuses on **finite** lattices: given the carrier set and
+ * a `leq` predicate, we derive join/meet exhaustively (O(n^3) per pair
+ * via direct search). That is enough for the structural checks
+ * downstream — distributivity, modularity, complementation, Heyting
+ * implication — which are themselves O(n^3) or O(n^4) and not meant
+ * for n ≫ 100.
+ *
+ * Notable theorems used:
+ *   - Dedekind: a lattice is **modular** iff it has no sublattice
+ *     isomorphic to the pentagon N5.
+ *   - Birkhoff: a lattice is **distributive** iff it has no sublattice
+ *     isomorphic to N5 *or* to the diamond M3.
+ *
+ * Equality of carrier elements is decided by *antisymmetry of leq*:
+ * `a === b` whenever `leq(a,b) && leq(b,a)`. This lets callers use
+ * structural elements like `Set<string>` without supplying their own
+ * equality predicate.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports._indexOfElement = void 0;
+exports.isLattice = isLattice;
+exports.makeLattice = makeLattice;
+exports.isDistributive = isDistributive;
+exports.isModular = isModular;
+exports.complement = complement;
+exports.isComplemented = isComplemented;
+exports.isBoolean = isBoolean;
+exports.relativeComplement = relativeComplement;
+exports.isHeyting = isHeyting;
+exports.atoms = atoms;
+exports.coatoms = coatoms;
+exports.containsPentagon = containsPentagon;
+exports.containsDiamond = containsDiamond;
+exports.dedekindAnalysis = dedekindAnalysis;
+exports.powerSetLattice = powerSetLattice;
+exports.divisibilityLattice = divisibilityLattice;
+exports.chain = chain;
+exports.pentagonN5 = pentagonN5;
+exports.diamondM3 = diamondM3;
+const eq = (leq, a, b) => leq(a, b) && leq(b, a);
+const indexOf = (L, x) => {
+    for (let i = 0; i < L.elements.length; i++) {
+        if (eq(L.leq, L.elements[i], x))
+            return i;
+    }
+    return -1;
+};
+exports._indexOfElement = indexOf;
+/**
+ * Compute least upper bound of a,b within `elements` under `leq`,
+ * or null if it does not exist or is not unique.
+ */
+function computeJoin(elements, leq, a, b) {
+    const upper = [];
+    for (const x of elements) {
+        if (leq(a, x) && leq(b, x))
+            upper.push(x);
+    }
+    if (upper.length === 0)
+        return null;
+    // Find unique minimum of `upper` under leq.
+    let candidate = null;
+    for (const u of upper) {
+        if (upper.every((v) => leq(u, v))) {
+            if (candidate !== null && !eq(leq, candidate, u))
+                return null;
+            candidate = u;
+        }
+    }
+    return candidate;
+}
+function computeMeet(elements, leq, a, b) {
+    const lower = [];
+    for (const x of elements) {
+        if (leq(x, a) && leq(x, b))
+            lower.push(x);
+    }
+    if (lower.length === 0)
+        return null;
+    let candidate = null;
+    for (const u of lower) {
+        if (lower.every((v) => leq(v, u))) {
+            if (candidate !== null && !eq(leq, candidate, u))
+                return null;
+            candidate = u;
+        }
+    }
+    return candidate;
+}
+/**
+ * Check that (elements, leq) forms a lattice: poset axioms plus
+ * existence of join/meet for every pair.
+ */
+function isLattice(elements, leq) {
+    // Reflexivity
+    for (const a of elements)
+        if (!leq(a, a))
+            return false;
+    // Antisymmetry (assuming elements are pairwise distinct under === or
+    // under structural identity provided by the caller).
+    for (let i = 0; i < elements.length; i++) {
+        for (let j = i + 1; j < elements.length; j++) {
+            const a = elements[i];
+            const b = elements[j];
+            if (leq(a, b) && leq(b, a))
+                return false;
+        }
+    }
+    // Transitivity
+    for (const a of elements) {
+        for (const b of elements) {
+            for (const c of elements) {
+                if (leq(a, b) && leq(b, c) && !leq(a, c))
+                    return false;
+            }
+        }
+    }
+    // Join + meet existence
+    for (const a of elements) {
+        for (const b of elements) {
+            if (computeJoin(elements, leq, a, b) === null)
+                return false;
+            if (computeMeet(elements, leq, a, b) === null)
+                return false;
+        }
+    }
+    return true;
+}
+/**
+ * Build a FiniteLattice from carrier + order. Returns null if the
+ * structure is not a lattice (missing/non-unique join or meet, or
+ * the order itself is malformed).
+ */
+function makeLattice(elements, leq) {
+    if (elements.length === 0)
+        return null;
+    if (!isLattice(elements, leq))
+        return null;
+    const els = elements.slice();
+    const joinTable = new Map();
+    const meetTable = new Map();
+    for (let i = 0; i < els.length; i++) {
+        for (let j = 0; j < els.length; j++) {
+            const a = els[i];
+            const b = els[j];
+            const j2 = computeJoin(els, leq, a, b);
+            const m2 = computeMeet(els, leq, a, b);
+            if (j2 === null || m2 === null)
+                return null;
+            joinTable.set(`${i}|${j}`, j2);
+            meetTable.set(`${i}|${j}`, m2);
+        }
+    }
+    const lookup = (x) => {
+        for (let i = 0; i < els.length; i++) {
+            if (eq(leq, els[i], x))
+                return i;
+        }
+        return -1;
+    };
+    const join = (a, b) => {
+        const i = lookup(a);
+        const j = lookup(b);
+        if (i < 0 || j < 0)
+            throw new Error('join: element not in lattice');
+        return joinTable.get(`${i}|${j}`);
+    };
+    const meet = (a, b) => {
+        const i = lookup(a);
+        const j = lookup(b);
+        if (i < 0 || j < 0)
+            throw new Error('meet: element not in lattice');
+        return meetTable.get(`${i}|${j}`);
+    };
+    // Top: an element ≥ every element.
+    let top = null;
+    for (const t of els) {
+        if (els.every((x) => leq(x, t))) {
+            top = t;
+            break;
+        }
+    }
+    let bottom = null;
+    for (const t of els) {
+        if (els.every((x) => leq(t, x))) {
+            bottom = t;
+            break;
+        }
+    }
+    if (top === null || bottom === null)
+        return null;
+    return {
+        elements: els,
+        leq,
+        join,
+        meet,
+        top,
+        bottom,
+    };
+}
+/**
+ * Distributive: a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) for all a,b,c.
+ */
+function isDistributive(L) {
+    for (const a of L.elements) {
+        for (const b of L.elements) {
+            for (const c of L.elements) {
+                const lhs = L.meet(a, L.join(b, c));
+                const rhs = L.join(L.meet(a, b), L.meet(a, c));
+                if (!eq(L.leq, lhs, rhs))
+                    return false;
+            }
+        }
+    }
+    return true;
+}
+/**
+ * Modular: a ≤ c ⇒ a ∨ (b ∧ c) = (a ∨ b) ∧ c.
+ */
+function isModular(L) {
+    for (const a of L.elements) {
+        for (const b of L.elements) {
+            for (const c of L.elements) {
+                if (!L.leq(a, c))
+                    continue;
+                const lhs = L.join(a, L.meet(b, c));
+                const rhs = L.meet(L.join(a, b), c);
+                if (!eq(L.leq, lhs, rhs))
+                    return false;
+            }
+        }
+    }
+    return true;
+}
+/**
+ * Find a complement of `a`: some x with a ∨ x = ⊤ and a ∧ x = ⊥.
+ * Returns the first match (lattice may have multiple), or null.
+ */
+function complement(L, a) {
+    for (const x of L.elements) {
+        if (eq(L.leq, L.join(a, x), L.top) && eq(L.leq, L.meet(a, x), L.bottom)) {
+            return x;
+        }
+    }
+    return null;
+}
+/**
+ * Complemented: every element has at least one complement.
+ */
+function isComplemented(L) {
+    for (const a of L.elements) {
+        if (complement(L, a) === null)
+            return false;
+    }
+    return true;
+}
+/**
+ * Boolean lattice: distributive + complemented.
+ * In finite Boolean lattices, complements are automatically unique.
+ */
+function isBoolean(L) {
+    return isDistributive(L) && isComplemented(L);
+}
+/**
+ * Relative pseudo-complement of `a` with respect to `b`: the largest
+ * x such that a ∧ x ≤ b. Equivalently the Heyting implication a ⇒ b.
+ * Returns null if no largest x exists.
+ */
+function relativeComplement(L, a, b) {
+    const candidates = [];
+    for (const x of L.elements) {
+        if (L.leq(L.meet(a, x), b))
+            candidates.push(x);
+    }
+    if (candidates.length === 0)
+        return null;
+    let max = null;
+    for (const u of candidates) {
+        if (candidates.every((v) => L.leq(v, u))) {
+            if (max !== null && !eq(L.leq, max, u))
+                return null;
+            max = u;
+        }
+    }
+    return max;
+}
+/**
+ * Heyting algebra: distributive lattice in which every pair (a,b)
+ * has a relative pseudo-complement a ⇒ b.
+ *
+ * In finite lattices, distributivity is equivalent to existence of
+ * relative pseudo-complements, so any finite distributive lattice is
+ * automatically Heyting. We still check both for clarity.
+ */
+function isHeyting(L) {
+    if (!isDistributive(L))
+        return false;
+    for (const a of L.elements) {
+        for (const b of L.elements) {
+            if (relativeComplement(L, a, b) === null)
+                return false;
+        }
+    }
+    return true;
+}
+/**
+ * Atoms: elements that cover ⊥ (i.e. ⊥ < a with no element strictly
+ * between).
+ */
+function atoms(L) {
+    const res = [];
+    for (const a of L.elements) {
+        if (eq(L.leq, a, L.bottom))
+            continue;
+        let covers = true;
+        for (const x of L.elements) {
+            if (eq(L.leq, x, L.bottom) || eq(L.leq, x, a))
+                continue;
+            if (L.leq(L.bottom, x) && L.leq(x, a)) {
+                covers = false;
+                break;
+            }
+        }
+        if (covers)
+            res.push(a);
+    }
+    return res;
+}
+/**
+ * Coatoms: elements covered by ⊤.
+ */
+function coatoms(L) {
+    const res = [];
+    for (const a of L.elements) {
+        if (eq(L.leq, a, L.top))
+            continue;
+        let covers = true;
+        for (const x of L.elements) {
+            if (eq(L.leq, x, L.top) || eq(L.leq, x, a))
+                continue;
+            if (L.leq(a, x) && L.leq(x, L.top)) {
+                covers = false;
+                break;
+            }
+        }
+        if (covers)
+            res.push(a);
+    }
+    return res;
+}
+/**
+ * Detect a sublattice isomorphic to the pentagon N5.
+ *
+ * N5 is the 5-element lattice on {⊥, a, b, c, ⊤} with:
+ *   - ⊥ < a < c < ⊤ (a chain of length 3)
+ *   - ⊥ < b < ⊤ (b incomparable to both a and c)
+ *   - a ∧ b = ⊥, a ∨ b = ⊤, c ∧ b = ⊥, c ∨ b = ⊤.
+ *
+ * Equivalent to: there exist 5 distinct elements x0 < x1 < x2 and y,
+ * with y incomparable to x1 and to x2 minus x0, top = x2 ∨ y,
+ * bottom = x0 ∧ y, and y ∨ x1 = y ∨ x2, y ∧ x1 = y ∧ x2.
+ */
+function containsPentagon(L) {
+    const els = L.elements;
+    for (const x0 of els) {
+        for (const x1 of els) {
+            // Strict x0 < x1.
+            if (eq(L.leq, x0, x1) || !L.leq(x0, x1))
+                continue;
+            for (const x2 of els) {
+                // Strict x1 < x2.
+                if (eq(L.leq, x1, x2) || !L.leq(x1, x2))
+                    continue;
+                for (const y of els) {
+                    // y distinct from x0, x1, x2 and incomparable to x1 and x2.
+                    if (eq(L.leq, y, x0) ||
+                        eq(L.leq, y, x1) ||
+                        eq(L.leq, y, x2) ||
+                        L.leq(y, x1) ||
+                        L.leq(x1, y) ||
+                        L.leq(y, x2) ||
+                        L.leq(x2, y)) {
+                        continue;
+                    }
+                    // Check N5 closure:
+                    //   y ∧ x1 = y ∧ x2 = x0
+                    //   y ∨ x1 = y ∨ x2  (this is the pentagon's top)
+                    const m1 = L.meet(y, x1);
+                    const m2 = L.meet(y, x2);
+                    const j1 = L.join(y, x1);
+                    const j2 = L.join(y, x2);
+                    if (eq(L.leq, m1, x0) && eq(L.leq, m2, x0) && eq(L.leq, j1, j2)) {
+                        return true;
+                    }
+                }
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Detect a sublattice isomorphic to the diamond M3.
+ *
+ * M3 is the 5-element lattice with one bottom, one top, and three
+ * mutually incomparable elements between, each pair joining to ⊤
+ * and meeting to ⊥.
+ */
+function containsDiamond(L) {
+    const els = L.elements;
+    for (let i = 0; i < els.length; i++) {
+        for (let j = i + 1; j < els.length; j++) {
+            for (let k = j + 1; k < els.length; k++) {
+                const a = els[i];
+                const b = els[j];
+                const c = els[k];
+                // pairwise incomparable
+                if (L.leq(a, b) || L.leq(b, a))
+                    continue;
+                if (L.leq(a, c) || L.leq(c, a))
+                    continue;
+                if (L.leq(b, c) || L.leq(c, b))
+                    continue;
+                const jab = L.join(a, b);
+                const jac = L.join(a, c);
+                const jbc = L.join(b, c);
+                const mab = L.meet(a, b);
+                const mac = L.meet(a, c);
+                const mbc = L.meet(b, c);
+                if (!eq(L.leq, jab, jac) || !eq(L.leq, jac, jbc))
+                    continue;
+                if (!eq(L.leq, mab, mac) || !eq(L.leq, mac, mbc))
+                    continue;
+                // join must be strictly above each, meet strictly below.
+                if (eq(L.leq, jab, a) || eq(L.leq, jab, b) || eq(L.leq, jab, c))
+                    continue;
+                if (eq(L.leq, mab, a) || eq(L.leq, mab, b) || eq(L.leq, mab, c))
+                    continue;
+                return true;
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Dedekind / Birkhoff structural analysis. By the two classical
+ * theorems:
+ *   modular   ⇔ pentagon-free
+ *   distributive ⇔ pentagon-free AND diamond-free
+ * We compute both algebraically and by sublattice search; the result
+ * agrees on well-formed finite lattices.
+ */
+function dedekindAnalysis(L) {
+    const pentagonFree = !containsPentagon(L);
+    const diamondFree = !containsDiamond(L);
+    // We rely on the algebraic checks as the source of truth; the
+    // sublattice flags are reported alongside for diagnostic use.
+    return {
+        distributive: isDistributive(L),
+        modular: isModular(L),
+        pentagonFree,
+        diamondFree,
+    };
+}
+// ---------------------------------------------------------------------------
+// Pre-built lattices
+// ---------------------------------------------------------------------------
+/**
+ * Power set lattice 2^S ordered by inclusion. For |S|=n this has
+ * 2^n elements; keep n small (≤ 6).
+ */
+function powerSetLattice(baseElements) {
+    const base = Array.from(new Set(baseElements));
+    const n = base.length;
+    const subsets = [];
+    for (let mask = 0; mask < 1 << n; mask++) {
+        const s = new Set();
+        for (let i = 0; i < n; i++) {
+            if (mask & (1 << i))
+                s.add(base[i]);
+        }
+        subsets.push(s);
+    }
+    const leq = (a, b) => {
+        for (const x of a)
+            if (!b.has(x))
+                return false;
+        return true;
+    };
+    const L = makeLattice(subsets, leq);
+    if (L === null)
+        throw new Error('powerSetLattice: failed to build');
+    return L;
+}
+/**
+ * Divisors of n ordered by divisibility. (Lattice for any positive n.)
+ */
+function divisibilityLattice(n) {
+    if (!Number.isInteger(n) || n < 1) {
+        throw new Error('divisibilityLattice: n must be a positive integer');
+    }
+    const divs = [];
+    for (let d = 1; d <= n; d++) {
+        if (n % d === 0)
+            divs.push(d);
+    }
+    const leq = (a, b) => b % a === 0;
+    const L = makeLattice(divs, leq);
+    if (L === null)
+        throw new Error('divisibilityLattice: failed to build');
+    return L;
+}
+/**
+ * Chain of n elements 0 < 1 < ... < n-1.
+ */
+function chain(n) {
+    if (!Number.isInteger(n) || n < 1) {
+        throw new Error('chain: n must be ≥ 1');
+    }
+    const els = [];
+    for (let i = 0; i < n; i++)
+        els.push(i);
+    const leq = (a, b) => a <= b;
+    const L = makeLattice(els, leq);
+    if (L === null)
+        throw new Error('chain: failed to build');
+    return L;
+}
+/**
+ * Pentagon N5: the classical non-modular 5-element lattice.
+ *
+ * Hasse diagram:
+ *        T
+ *       / \
+ *      c   b
+ *      |   |
+ *      a   |
+ *       \ /
+ *        B
+ */
+function pentagonN5() {
+    const els = ['B', 'a', 'c', 'b', 'T'];
+    const order = {
+        B: ['B', 'a', 'c', 'b', 'T'],
+        a: ['a', 'c', 'T'],
+        c: ['c', 'T'],
+        b: ['b', 'T'],
+        T: ['T'],
+    };
+    const leq = (x, y) => (order[x] ?? []).includes(y);
+    const L = makeLattice(els, leq);
+    if (L === null)
+        throw new Error('pentagonN5: failed to build');
+    return L;
+}
+/**
+ * Diamond M3: modular but not distributive 5-element lattice.
+ *
+ * Hasse diagram:
+ *        T
+ *      / | \
+ *     a  b  c
+ *      \ | /
+ *        B
+ */
+function diamondM3() {
+    const els = ['B', 'a', 'b', 'c', 'T'];
+    const order = {
+        B: ['B', 'a', 'b', 'c', 'T'],
+        a: ['a', 'T'],
+        b: ['b', 'T'],
+        c: ['c', 'T'],
+        T: ['T'],
+    };
+    const leq = (x, y) => (order[x] ?? []).includes(y);
+    const L = makeLattice(els, leq);
+    if (L === null)
+        throw new Error('diamondM3: failed to build');
+    return L;
+}
+//# sourceMappingURL=index.js.map

package/dist/reasoning/lattice/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/lattice/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;;;AAuEH,8BA4BC;AAOD,kCA8DC;AAKD,wCAWC;AAKD,8BAYC;AAMD,gCAOC;AAKD,wCAKC;AAMD,8BAEC;AAOD,gDAcC;AAUD,8BAQC;AAMD,sBAeC;AAKD,0BAeC;AAcD,4CAqCC;AASD,0CA4BC;AAiBD,4CAWC;AAUD,0CAkBC;AAKD,kDAYC;AAKD,sBAUC;AAcD,gCAaC;AAYD,8BAaC;AAjhBD,MAAM,EAAE,GAAG,CAAI,GAA4B,EAAE,CAAI,EAAE,CAAI,EAAW,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAE5F,MAAM,OAAO,GAAG,CAAI,CAAmB,EAAE,CAAI,EAAU,EAAE;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC,CAAC;AA6gBkB,kCAAe;AA3gBnC;;;GAGG;AACH,SAAS,WAAW,CAClB,QAA0B,EAC1B,GAA4B,EAC5B,CAAI,EACJ,CAAI;IAEJ,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,4CAA4C;IAC5C,IAAI,SAAS,GAAa,IAAI,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,IAAI,SAAS,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC9D,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,WAAW,CAClB,QAA0B,EAC1B,GAA4B,EAC5B,CAAI,EACJ,CAAI;IAEJ,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,SAAS,GAAa,IAAI,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,IAAI,SAAS,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC9D,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CAAI,QAA0B,EAAE,GAA4B;IACnF,cAAc;IACd,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACvD,qEAAqE;IACrE,qDAAqD;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,eAAe;IACf,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IACD,wBAAwB;IACxB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,WAAW,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC5D,IAAI,WAAW,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CACzB,QAA0B,EAC1B,GAA4B;IAE5B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAa,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAa,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC;YAC5C,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,CAAI,EAAU,EAAE;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAI,EAAE,CAAI,EAAK,EAAE;QAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAM,CAAC;IACzC,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAI,EAAE,CAAI,EAAK,EAAE;QAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAM,CAAC;IACzC,CAAC,CAAC;IACF,mCAAmC;IACnC,IAAI,GAAG,GAAa,IAAI,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,GAAG,GAAG,CAAC,CAAC;YACR,MAAM;QACR,CAAC;IACH,CAAC;IACD,IAAI,MAAM,GAAa,IAAI,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,MAAM,GAAG,CAAC,CAAC;YACX,MAAM;QACR,CAAC;IACH,CAAC;IACD,IAAI,GAAG,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACjD,OAAO;QACL,QAAQ,EAAE,GAAG;QACb,GAAG;QACH,IAAI;QACJ,IAAI;QACJ,GAAG;QACH,MAAM;KACP,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAgB,cAAc,CAAI,CAAmB;IACnD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,SAAS,CAAI,CAAmB;IAC9C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAE,SAAS;gBAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CAAI,CAAmB,EAAE,CAAI;IACrD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACxE,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,cAAc,CAAI,CAAmB;IACnD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;IAC9C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CAAI,CAAmB;IAC9C,OAAO,cAAc,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,SAAgB,kBAAkB,CAAI,CAAmB,EAAE,CAAI,EAAE,CAAI;IACnE,MAAM,UAAU,GAAQ,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,IAAI,GAAG,GAAa,IAAI,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzC,IAAI,GAAG,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpD,GAAG,GAAG,CAAC,CAAC;QACV,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,SAAS,CAAI,CAAmB;IAC9C,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;QACzD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,KAAK,CAAI,CAAmB;IAC1C,MAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;YAAE,SAAS;QACrC,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBAAE,SAAS;YACxD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACtC,MAAM,GAAG,KAAK,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAgB,OAAO,CAAI,CAAmB;IAC5C,MAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;YAAE,SAAS;QAClC,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBAAE,SAAS;YACrD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnC,MAAM,GAAG,KAAK,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,gBAAgB,CAAI,CAAmB;IACrD,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC;IACvB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,kBAAkB;YAClB,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;gBAAE,SAAS;YAClD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACrB,kBAAkB;gBAClB,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;oBAAE,SAAS;gBAClD,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;oBACpB,4DAA4D;oBAC5D,IACE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChB,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;wBACZ,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;wBACZ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;wBACZ,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EACZ,CAAC;wBACD,SAAS;oBACX,CAAC;oBACD,oBAAoB;oBACpB,yBAAyB;oBACzB,kDAAkD;oBAClD,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACzB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACzB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACzB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACzB,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;wBAChE,OAAO,IAAI,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,eAAe,CAAI,CAAmB;IACpD,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,wBAAwB;gBACxB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAE,SAAS;gBACzC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAE,SAAS;gBACzC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAE,SAAS;gBACzC,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;oBAAE,SAAS;gBAC3D,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;oBAAE,SAAS;gBAC3D,yDAAyD;gBACzD,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;oBAAE,SAAS;gBAC1E,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;oBAAE,SAAS;gBAC1E,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AASD;;;;;;;GAOG;AACH,SAAgB,gBAAgB,CAAI,CAAmB;IACrD,MAAM,YAAY,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACxC,8DAA8D;IAC9D,8DAA8D;IAC9D,OAAO;QACL,YAAY,EAAE,cAAc,CAAC,CAAC,CAAC;QAC/B,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;QACrB,YAAY;QACZ,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;GAGG;AACH,SAAgB,eAAe,CAAC,YAAmC;IACjE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;IAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAc,EAAE,CAAc,EAAW,EAAE;QACtD,KAAK,MAAM,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,MAAM,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACpE,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAC,CAAS;IAC3C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC3D,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACjC,IAAI,CAAC,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IACxE,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,SAAgB,KAAK,CAAC,CAAS;IAC7B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACtD,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAChC,IAAI,CAAC,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC1D,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,UAAU;IACxB,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,KAAK,GAA0C;QACnD,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;QAC5B,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;QAClB,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;QACb,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;QACb,CAAC,EAAE,CAAC,GAAG,CAAC;KACT,CAAC;IACF,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAChC,IAAI,CAAC,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAC/D,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,SAAS;IACvB,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,KAAK,GAA0C;QACnD,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;QAC5B,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;QACb,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;QACb,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;QACb,CAAC,EAAE,CAAC,GAAG,CAAC;KACT,CAAC;IACF,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAChC,IAAI,CAAC,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAC9D,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/reasoning/linear-algebra/index.d.ts

@@ -0,0 +1,69 @@
+export type Matrix = number[][];
+export type Vector = number[];
+export declare function mat(rows: number, cols: number, fill?: number): Matrix;
+export declare function zeros(rows: number, cols: number): Matrix;
+export declare function ones(rows: number, cols: number): Matrix;
+export declare function identity(n: number): Matrix;
+export declare function diagonal(entries: number[]): Matrix;
+export declare function clone(M: Matrix): Matrix;
+export declare function transpose(M: Matrix): Matrix;
+export declare function add(a: Matrix, b: Matrix): Matrix;
+export declare function sub(a: Matrix, b: Matrix): Matrix;
+export declare function scalarMul(c: number, M: Matrix): Matrix;
+export declare function multiply(a: Matrix, b: Matrix): Matrix;
+export declare function matVec(M: Matrix, v: Vector): Vector;
+export declare function dot(a: Vector, b: Vector): number;
+export declare function norm(v: Vector): number;
+export declare function normalize(v: Vector): Vector;
+export declare function cross(a: Vector, b: Vector): Vector;
+export declare function rref(M: Matrix): {
+    reduced: Matrix;
+    rank: number;
+    pivotCols: number[];
+};
+export declare function rank(M: Matrix): number;
+export declare function determinant(M: Matrix): number;
+export declare function inverse(M: Matrix): Matrix | null;
+export declare function solve(A: Matrix, b: Vector): Vector | null;
+export declare function leastSquares(A: Matrix, b: Vector): Vector;
+export interface LU {
+    L: Matrix;
+    U: Matrix;
+    P: number[];
+}
+export declare function decomposeLU(M: Matrix): LU | null;
+export declare function permutationMatrix(P: number[]): Matrix;
+export interface QR {
+    Q: Matrix;
+    R: Matrix;
+}
+export declare function decomposeQR(M: Matrix): QR;
+export interface SVD {
+    U: Matrix;
+    S: number[];
+    V: Matrix;
+}
+export declare function decomposeSVD(M: Matrix, maxIter?: number): SVD;
+export declare function powerIteration(M: Matrix, opts?: {
+    maxIter?: number;
+    eps?: number;
+}): {
+    eigenvalue: number;
+    eigenvector: Vector;
+};
+export declare function eigenvalues(M: Matrix, opts?: {
+    maxIter?: number;
+    eps?: number;
+}): number[];
+export declare function eigenvectors(M: Matrix, opts?: {
+    maxIter?: number;
+    eps?: number;
+}): {
+    values: number[];
+    vectors: Matrix;
+};
+export declare function nullSpace(M: Matrix): Vector[];
+export declare function columnSpace(M: Matrix): Vector[];
+export declare function gramSchmidt(vectors: Vector[]): Vector[];
+export declare function isLinearlyIndependent(vectors: Vector[]): boolean;
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/linear-algebra/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/linear-algebra/index.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC;AAChC,MAAM,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC;AA2D9B,wBAAgB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,MAAM,CAShE;AAED,wBAAgB,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAExD;AAED,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAM1C;AAED,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAOlD;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CASvC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAS3C;AAWD,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAShD;AAED,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAShD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAStD;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAmBrD;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAcnD;AAED,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAShD;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAOtC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAU3C;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAelD;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,EAAE,CAAA;CAAE,CAkDtF;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAEtC;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CA2C7C;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CA6BhD;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CA2BzD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAgBzD;AAED,MAAM,WAAW,EAAE;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,EAAE,CAAC;CACb;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,EAAE,GAAG,IAAI,CAgDhD;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAOrD;AAED,MAAM,WAAW,EAAE;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,EAAE,CAoCzC;AAED,MAAM,WAAW,GAAG;IAClB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,CAAC,EAAE,MAAM,CAAC;CACX;AAkED,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,SAAM,GAAG,GAAG,CAuC1D;AAED,wBAAgB,cAAc,CAC5B,CAAC,EAAE,MAAM,EACT,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5C;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAA;CAAE,CAyC7C;AAiBD,wBAAgB,WAAW,CACzB,CAAC,EAAE,MAAM,EACT,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5C,MAAM,EAAE,CAiDV;AAED,wBAAgB,YAAY,CAC1B,CAAC,EAAE,MAAM,EACT,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5C;IAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CA2BvC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAyB7C;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAY/C;AAED,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAgCvD;AAED,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,OAAO,CAuBhE"}