@stevenvo780/st-lang 4.13.0 → 4.14.1

package/dist/reasoning/hoare-logic/index.js

@@ -0,0 +1,561 @@
+"use strict";
+// ============================================================
+// ST Hoare Logic — Verificación de programas imperativos
+// ============================================================
+//
+// Lógica de Hoare para un lenguaje IMP minimal (asignación, skip,
+// secuencia, condicional, bucle). El motor calcula precondiciones
+// más débiles (weakest precondition, wp) y postcondiciones más
+// fuertes (strongest postcondition, sp), genera condiciones de
+// verificación (VCs) y las refuta por búsqueda aleatoria sobre el
+// universo entero acotado.
+//
+// Tripleta de Hoare:
+//   {P} c {Q}  ≡  ejecutar c desde un estado que cumple P deja un
+//                estado que cumple Q (corrección parcial).
+//
+// Reglas (Hoare):
+//   skip      :  {P} skip {P}
+//   assign    :  {P[E/x]} x := E {P}
+//   seq       :  {P} c1 {R}, {R} c2 {Q}  ⊢  {P} c1; c2 {Q}
+//   if        :  {P ∧ B} c1 {Q}, {P ∧ ¬B} c2 {Q}  ⊢  {P} if B then c1 else c2 {Q}
+//   while     :  {I ∧ B} c {I}  ⊢  {I} while B do c {I ∧ ¬B}
+//   weakening :  P → P', {P'} c {Q'}, Q' → Q  ⊢  {P} c {Q}
+//
+// Para `while` exigimos invariant explícito (campo `invariant`) o
+// el VC pasa a ser trivial-falso (no podemos probar terminación
+// parcial sin invariant). Las VCs se evalúan por muestreo aleatorio
+// + estados sintéticos extraídos del programa: si alguna falla,
+// devolvemos un contramodelo.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.whileS = exports.ifS = exports.assign = exports.skip = exports.le = exports.lt = exports.eq = exports.or = exports.and = exports.not = exports.binop = exports.v = exports.bool = exports.num = void 0;
+exports.seq = seq;
+exports.substitute = substitute;
+exports.freeVars = freeVars;
+exports.stmtVars = stmtVars;
+exports.evalExpr = evalExpr;
+exports.execStmt = execStmt;
+exports.wp = wp;
+exports.spExtension = spExtension;
+exports.generateVCs = generateVCs;
+exports.verifyTriple = verifyTriple;
+exports.programSwap = programSwap;
+exports.programFactorial = programFactorial;
+exports.programGCD = programGCD;
+exports.programLinearSearch = programLinearSearch;
+exports.factorial = factorial;
+exports.gcd = gcd;
+// ── Constructores de conveniencia ────────────────────────────
+/** Constructor de literal numérico IMP. */
+const num = (n) => ({ kind: 'const', value: n });
+exports.num = num;
+/** Constructor de literal booleano IMP. */
+const bool = (b) => ({ kind: 'bool', value: b });
+exports.bool = bool;
+/** Constructor de referencia a variable IMP por nombre. */
+const v = (name) => ({ kind: 'var', name });
+exports.v = v;
+/** Constructor de operación binaria IMP. */
+const binop = (op, left, right) => ({
+    kind: 'binop',
+    op,
+    left,
+    right,
+});
+exports.binop = binop;
+/** Constructor de negación de expresión IMP. */
+const not = (arg) => ({ kind: 'not', arg });
+exports.not = not;
+/** Constructor de conjunción lógica IMP: `left && right`. */
+const and = (left, right) => (0, exports.binop)('&&', left, right);
+exports.and = and;
+/** Constructor de disyunción lógica IMP: `left || right`. */
+const or = (left, right) => (0, exports.binop)('||', left, right);
+exports.or = or;
+/** Constructor de igualdad IMP: `left == right`. */
+const eq = (left, right) => (0, exports.binop)('==', left, right);
+exports.eq = eq;
+/** Constructor de menor estricto IMP: `left < right`. */
+const lt = (left, right) => (0, exports.binop)('<', left, right);
+exports.lt = lt;
+/** Constructor de menor o igual IMP: `left <= right`. */
+const le = (left, right) => (0, exports.binop)('<=', left, right);
+exports.le = le;
+/** Instrucción `skip` (no-op). */
+const skip = () => ({ kind: 'skip' });
+exports.skip = skip;
+/** Instrucción de asignación: `varName := expr`. */
+const assign = (varName, expr) => ({
+    kind: 'assign',
+    var: varName,
+    expr,
+});
+exports.assign = assign;
+/** Secuencia de instrucciones (asociativa a la derecha). Con 0 args devuelve `skip`. */
+function seq(...stmts) {
+    if (stmts.length === 0)
+        return (0, exports.skip)();
+    if (stmts.length === 1)
+        return stmts[0];
+    // Foldr para mantener asociatividad derecha estable.
+    let acc = stmts[stmts.length - 1];
+    for (let i = stmts.length - 2; i >= 0; i--) {
+        acc = { kind: 'seq', first: stmts[i], second: acc };
+    }
+    return acc;
+}
+/** Instrucción condicional `if cond then then_ else else_`. */
+const ifS = (cond, then_, else_) => ({
+    kind: 'if',
+    cond,
+    then: then_,
+    else: else_,
+});
+exports.ifS = ifS;
+/** Instrucción `while cond body` con invariante opcional para verificación. */
+const whileS = (cond, body, invariant) => ({
+    kind: 'while',
+    cond,
+    invariant,
+    body,
+});
+exports.whileS = whileS;
+// ── Sustitución sintáctica P[E/x] ────────────────────────────
+/** Sustitución sintáctica `expr[replacement/varName]` en expresiones IMP. */
+function substitute(expr, varName, replacement) {
+    switch (expr.kind) {
+        case 'const':
+        case 'bool':
+            return expr;
+        case 'var':
+            return expr.name === varName ? replacement : expr;
+        case 'binop':
+            return {
+                kind: 'binop',
+                op: expr.op,
+                left: substitute(expr.left, varName, replacement),
+                right: substitute(expr.right, varName, replacement),
+            };
+        case 'not':
+            return { kind: 'not', arg: substitute(expr.arg, varName, replacement) };
+    }
+}
+// ── Recolección de variables libres ──────────────────────────
+/** Variables libres en la expresión IMP `expr`. Acumula en `acc` (o devuelve un nuevo Set). */
+function freeVars(expr, acc = new Set()) {
+    switch (expr.kind) {
+        case 'const':
+        case 'bool':
+            return acc;
+        case 'var':
+            acc.add(expr.name);
+            return acc;
+        case 'binop':
+            freeVars(expr.left, acc);
+            freeVars(expr.right, acc);
+            return acc;
+        case 'not':
+            freeVars(expr.arg, acc);
+            return acc;
+    }
+}
+/** Variables mencionadas en la instrucción IMP `stmt` (asignadas y/o leídas). */
+function stmtVars(stmt, acc = new Set()) {
+    switch (stmt.kind) {
+        case 'skip':
+            return acc;
+        case 'assign':
+            acc.add(stmt.var);
+            freeVars(stmt.expr, acc);
+            return acc;
+        case 'seq':
+            stmtVars(stmt.first, acc);
+            stmtVars(stmt.second, acc);
+            return acc;
+        case 'if':
+            freeVars(stmt.cond, acc);
+            stmtVars(stmt.then, acc);
+            stmtVars(stmt.else, acc);
+            return acc;
+        case 'while':
+            freeVars(stmt.cond, acc);
+            if (stmt.invariant)
+                freeVars(stmt.invariant, acc);
+            stmtVars(stmt.body, acc);
+            return acc;
+    }
+}
+/** Evalúa la expresión IMP `expr` en el estado `state`. Devuelve un número o booleano. */
+function evalExpr(expr, state) {
+    switch (expr.kind) {
+        case 'const':
+            return expr.value;
+        case 'bool':
+            return expr.value;
+        case 'var': {
+            const value = state[expr.name];
+            // Variables no definidas valen 0 (estado total). Esto simplifica
+            // el muestreo aleatorio y los VCs sobre programas pequeños.
+            return value === undefined ? 0 : value;
+        }
+        case 'not': {
+            const a = evalExpr(expr.arg, state);
+            return !toBool(a);
+        }
+        case 'binop': {
+            const l = evalExpr(expr.left, state);
+            const r = evalExpr(expr.right, state);
+            switch (expr.op) {
+                case '+':
+                    return toNum(l) + toNum(r);
+                case '-':
+                    return toNum(l) - toNum(r);
+                case '*':
+                    return toNum(l) * toNum(r);
+                case '/': {
+                    const rn = toNum(r);
+                    if (rn === 0)
+                        return 0; // división por cero → 0 (estado total)
+                    return Math.trunc(toNum(l) / rn);
+                }
+                case '%': {
+                    const rn = toNum(r);
+                    if (rn === 0)
+                        return 0;
+                    return toNum(l) % rn;
+                }
+                case '<':
+                    return toNum(l) < toNum(r);
+                case '<=':
+                    return toNum(l) <= toNum(r);
+                case '>':
+                    return toNum(l) > toNum(r);
+                case '>=':
+                    return toNum(l) >= toNum(r);
+                case '==':
+                    return toNum(l) === toNum(r);
+                case '!=':
+                    return toNum(l) !== toNum(r);
+                case '&&':
+                    return toBool(l) && toBool(r);
+                case '||':
+                    return toBool(l) || toBool(r);
+            }
+        }
+    }
+}
+function toNum(v) {
+    return typeof v === 'boolean' ? (v ? 1 : 0) : v;
+}
+function toBool(v) {
+    return typeof v === 'boolean' ? v : v !== 0;
+}
+/** Ejecuta `stmt` sobre `state` con un límite de `maxSteps` pasos. Devuelve el estado final o un error. */
+function execStmt(stmt, state, maxSteps = 10_000) {
+    const counter = { steps: 0, limit: maxSteps };
+    try {
+        return execInternal(stmt, { ...state }, counter);
+    }
+    catch (err) {
+        return { error: err instanceof Error ? err.message : String(err) };
+    }
+}
+function execInternal(stmt, state, counter) {
+    if (counter.steps++ > counter.limit) {
+        throw new Error(`execStmt: límite de pasos excedido (${counter.limit})`);
+    }
+    switch (stmt.kind) {
+        case 'skip':
+            return state;
+        case 'assign': {
+            const value = evalExpr(stmt.expr, state);
+            state[stmt.var] = toNum(value);
+            return state;
+        }
+        case 'seq': {
+            execInternal(stmt.first, state, counter);
+            execInternal(stmt.second, state, counter);
+            return state;
+        }
+        case 'if': {
+            const cond = evalExpr(stmt.cond, state);
+            if (toBool(cond)) {
+                execInternal(stmt.then, state, counter);
+            }
+            else {
+                execInternal(stmt.else, state, counter);
+            }
+            return state;
+        }
+        case 'while': {
+            while (toBool(evalExpr(stmt.cond, state))) {
+                if (counter.steps++ > counter.limit) {
+                    throw new Error(`execStmt: límite de pasos excedido en while (${counter.limit})`);
+                }
+                execInternal(stmt.body, state, counter);
+            }
+            return state;
+        }
+    }
+}
+// ── Weakest precondition (wp) ────────────────────────────────
+/** Precondición más débil `wp(stmt, post)`. Para while requiere invariant anotado; sin él devuelve `false`. */
+function wp(stmt, post) {
+    switch (stmt.kind) {
+        case 'skip':
+            return post;
+        case 'assign':
+            return substitute(post, stmt.var, stmt.expr);
+        case 'seq': {
+            const after = wp(stmt.second, post);
+            return wp(stmt.first, after);
+        }
+        case 'if': {
+            const wpThen = wp(stmt.then, post);
+            const wpElse = wp(stmt.else, post);
+            // (cond → wpThen) ∧ (¬cond → wpElse)
+            return (0, exports.and)((0, exports.or)((0, exports.not)(stmt.cond), wpThen), (0, exports.or)(stmt.cond, wpElse));
+        }
+        case 'while': {
+            // Sin invariant no podemos calcular wp exacto en general.
+            // Devolvemos `false` para forzar fallo de VC explícito.
+            if (!stmt.invariant)
+                return (0, exports.bool)(false);
+            // Con invariant I la wp es simplemente I; las verificaciones
+            // adicionales (mantenimiento, salida) se generan como VCs.
+            return stmt.invariant;
+        }
+    }
+}
+// ── Strongest postcondition (sp), versión sintáctica ─────────
+//
+// Implementación pragmática: para statements sin loops devolvemos
+// una fórmula que describe el estado tras ejecutar `stmt`. Para
+// loops sin invariant cae a `true` (no informativo).
+/** Postcondición más fuerte aproximada `sp(stmt, pre)`. Para x := E cuando E no menciona x; sino devuelve `true`. */
+function spExtension(stmt, pre) {
+    switch (stmt.kind) {
+        case 'skip':
+            return pre;
+        case 'assign': {
+            // Introducimos una variable fresca para el valor previo de stmt.var:
+            //   sp(P, x := E) = ∃x'. P[x'/x] ∧ x = E[x'/x]
+            // Como no soportamos cuantificadores, aproximamos por la
+            // post-substitución del valor nuevo cuando E no menciona x.
+            // Si E menciona x, devolvemos `true` (no informativo).
+            const eVars = freeVars(stmt.expr);
+            if (!eVars.has(stmt.var)) {
+                return (0, exports.and)(pre, (0, exports.eq)((0, exports.v)(stmt.var), stmt.expr));
+            }
+            return (0, exports.bool)(true);
+        }
+        case 'seq':
+            return spExtension(stmt.second, spExtension(stmt.first, pre));
+        case 'if': {
+            const spThen = spExtension(stmt.then, (0, exports.and)(pre, stmt.cond));
+            const spElse = spExtension(stmt.else, (0, exports.and)(pre, (0, exports.not)(stmt.cond)));
+            return (0, exports.or)(spThen, spElse);
+        }
+        case 'while':
+            // Saliendo de un while, vale (I ∧ ¬cond) si hay invariant.
+            if (stmt.invariant)
+                return (0, exports.and)(stmt.invariant, (0, exports.not)(stmt.cond));
+            return (0, exports.bool)(true);
+    }
+}
+// ── Generación de condiciones de verificación (VCs) ──────────
+/** Genera las condiciones de verificación (VCs) para la tripla de Hoare: pre, wp global y VCs de loops. */
+function generateVCs(triple) {
+    const vcs = [];
+    // VC global: pre → wp(stmt, post)
+    vcs.push(implies(triple.pre, wp(triple.stmt, triple.post)));
+    collectLoopVCs(triple.stmt, triple.post, vcs);
+    return vcs;
+}
+function implies(p, q) {
+    return (0, exports.or)((0, exports.not)(p), q);
+}
+function collectLoopVCs(stmt, post, out) {
+    switch (stmt.kind) {
+        case 'skip':
+        case 'assign':
+            return;
+        case 'seq':
+            collectLoopVCs(stmt.first, wp(stmt.second, post), out);
+            collectLoopVCs(stmt.second, post, out);
+            return;
+        case 'if':
+            collectLoopVCs(stmt.then, post, out);
+            collectLoopVCs(stmt.else, post, out);
+            return;
+        case 'while': {
+            if (!stmt.invariant) {
+                // VC trivialmente falso: no hay invariant.
+                out.push((0, exports.bool)(false));
+                return;
+            }
+            const I = stmt.invariant;
+            // Mantenimiento: (I ∧ cond) → wp(body, I)
+            out.push(implies((0, exports.and)(I, stmt.cond), wp(stmt.body, I)));
+            // Salida: (I ∧ ¬cond) → post (sólo si este while es el último
+            // step antes de la post). Para keep it simple, lo generamos
+            // siempre — es una condición necesaria local en el contexto del
+            // VC global, no redundante.
+            out.push(implies((0, exports.and)(I, (0, exports.not)(stmt.cond)), post));
+            // Recurse sobre el body por loops anidados.
+            collectLoopVCs(stmt.body, I, out);
+            return;
+        }
+    }
+}
+/** Verifica la tripla `{pre} stmt {post}` por muestreo aleatorio de estados. */
+function verifyTriple(triple, opts = {}) {
+    const samples = opts.samples ?? 200;
+    const range = opts.range ?? [-5, 10];
+    const vcs = generateVCs(triple);
+    const vars = new Set();
+    freeVars(triple.pre, vars);
+    freeVars(triple.post, vars);
+    stmtVars(triple.stmt, vars);
+    const varNames = [...vars];
+    const rand = makeRandom(opts.seed);
+    const failures = [];
+    // Determinismo: incluimos estados "corner": todos 0, todos 1, todos -1.
+    const cornerStates = [];
+    for (const c of [0, 1, -1, range[0], range[1]]) {
+        const st = {};
+        for (const name of varNames)
+            st[name] = c;
+        cornerStates.push(st);
+    }
+    const allSeed = [...cornerStates, ...(opts.seedStates ?? [])];
+    for (const vc of vcs) {
+        let counterexample;
+        // VCs literalmente `false` se reportan como fallo sintáctico sin
+        // necesidad de muestrear.
+        if (vc.kind === 'bool' && vc.value === false) {
+            failures.push({ vc });
+            continue;
+        }
+        // 1) corner + seed states
+        for (const st of allSeed) {
+            if (!evalVC(vc, st)) {
+                counterexample = st;
+                break;
+            }
+        }
+        // 2) random sampling
+        if (counterexample === undefined) {
+            for (let i = 0; i < samples; i++) {
+                const st = {};
+                for (const name of varNames) {
+                    st[name] = randIntInRange(rand, range[0], range[1]);
+                }
+                if (!evalVC(vc, st)) {
+                    counterexample = st;
+                    break;
+                }
+            }
+        }
+        if (counterexample !== undefined) {
+            failures.push({ vc, state: counterexample });
+        }
+    }
+    return { valid: failures.length === 0, vcs, failures };
+}
+function evalVC(vc, state) {
+    return toBool(evalExpr(vc, state));
+}
+function makeRandom(seed) {
+    if (seed === undefined)
+        return Math.random;
+    // Mulberry32 — pequeño PRNG determinista.
+    let s = seed >>> 0;
+    return () => {
+        s = (s + 0x6d2b79f5) >>> 0;
+        let t = s;
+        t = Math.imul(t ^ (t >>> 15), t | 1);
+        t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+function randIntInRange(rand, lo, hi) {
+    return Math.floor(rand() * (hi - lo + 1)) + lo;
+}
+// ── Programas estándar de la literatura ──────────────────────
+/**
+ * Swap x ↔ y vía variable temporal `t`.
+ *   t := x; x := y; y := t
+ * Tripleta canónica: {x = a ∧ y = b} swap {x = b ∧ y = a}
+ */
+function programSwap() {
+    return seq((0, exports.assign)('t', (0, exports.v)('x')), (0, exports.assign)('x', (0, exports.v)('y')), (0, exports.assign)('y', (0, exports.v)('t')));
+}
+/**
+ * Factorial:  r := 1; k := 0; while k < n do { k := k+1; r := r * k }
+ * Tripleta:   {n = N ∧ N ≥ 0} fact {r = N!}
+ * Invariant:  k ≤ n ∧ r = k!  (codificable como r = k!, k entre 0 y n)
+ *
+ * Como la lógica de Hoare aquí no tiene factorial nativo, exponemos el
+ * código y el invariant en forma `r > 0 ∧ k ≤ n` (suficiente para
+ * los tests de mantenimiento sintácticos con muestreo: el ejecutor
+ * confirma corrección concreta para n pequeños).
+ */
+function programFactorial() {
+    const body = seq((0, exports.assign)('k', (0, exports.binop)('+', (0, exports.v)('k'), (0, exports.num)(1))), (0, exports.assign)('r', (0, exports.binop)('*', (0, exports.v)('r'), (0, exports.v)('k'))));
+    const invariant = (0, exports.and)((0, exports.le)((0, exports.v)('k'), (0, exports.v)('n')), (0, exports.binop)('>=', (0, exports.v)('r'), (0, exports.num)(1)));
+    return seq((0, exports.assign)('r', (0, exports.num)(1)), (0, exports.assign)('k', (0, exports.num)(0)), (0, exports.whileS)((0, exports.binop)('<', (0, exports.v)('k'), (0, exports.v)('n')), body, invariant));
+}
+/**
+ * GCD por algoritmo de Euclides con restas:
+ *   while x != y do { if x > y then x := x - y else y := y - x }
+ * Invariant: gcd(x, y) = gcd(a, b). Como no tenemos gcd nativo,
+ * usamos como invariant `x ≥ 1 ∧ y ≥ 1` (mantenido por restas
+ * positivas cuando x ≠ y y ambos positivos al entrar).
+ */
+function programGCD() {
+    const body = (0, exports.ifS)((0, exports.binop)('>', (0, exports.v)('x'), (0, exports.v)('y')), (0, exports.assign)('x', (0, exports.binop)('-', (0, exports.v)('x'), (0, exports.v)('y'))), (0, exports.assign)('y', (0, exports.binop)('-', (0, exports.v)('y'), (0, exports.v)('x'))));
+    const invariant = (0, exports.and)((0, exports.binop)('>=', (0, exports.v)('x'), (0, exports.num)(1)), (0, exports.binop)('>=', (0, exports.v)('y'), (0, exports.num)(1)));
+    return (0, exports.whileS)((0, exports.binop)('!=', (0, exports.v)('x'), (0, exports.v)('y')), body, invariant);
+}
+/**
+ * Búsqueda lineal:
+ *   i := 0; found := 0;
+ *   while i < n && found == 0 do {
+ *     if a == target then found := 1 else skip;
+ *     i := i + 1
+ *   }
+ * Modelo simplificado: `a` representa el elemento actual (no un array;
+ * el AST de IMP no tiene arrays). Sirve como esqueleto pedagógico
+ * para discutir el invariant `i ≤ n` y la post `found == 1 ∨ i == n`.
+ */
+function programLinearSearch() {
+    const body = seq((0, exports.ifS)((0, exports.eq)((0, exports.v)('a'), (0, exports.v)('target')), (0, exports.assign)('found', (0, exports.num)(1)), (0, exports.skip)()), (0, exports.assign)('i', (0, exports.binop)('+', (0, exports.v)('i'), (0, exports.num)(1))));
+    const invariant = (0, exports.and)((0, exports.le)((0, exports.v)('i'), (0, exports.v)('n')), (0, exports.or)((0, exports.eq)((0, exports.v)('found'), (0, exports.num)(0)), (0, exports.eq)((0, exports.v)('found'), (0, exports.num)(1))));
+    return seq((0, exports.assign)('i', (0, exports.num)(0)), (0, exports.assign)('found', (0, exports.num)(0)), (0, exports.whileS)((0, exports.and)((0, exports.binop)('<', (0, exports.v)('i'), (0, exports.v)('n')), (0, exports.eq)((0, exports.v)('found'), (0, exports.num)(0))), body, invariant));
+}
+// ── Helper: cómputo factorial concreto (para los tests) ──────
+/** Calcula el factorial de `n` en enteros (JavaScript). Solo para tests. */
+function factorial(n) {
+    let r = 1;
+    for (let k = 1; k <= n; k++)
+        r *= k;
+    return r;
+}
+/** Máximo común divisor de `a` y `b` (Euclides). Solo para tests. */
+function gcd(a, b) {
+    let x = Math.abs(a);
+    let y = Math.abs(b);
+    if (x === 0)
+        return y;
+    if (y === 0)
+        return x;
+    while (x !== y) {
+        if (x > y)
+            x -= y;
+        else
+            y -= x;
+    }
+    return x;
+}
+//# sourceMappingURL=index.js.map

package/dist/reasoning/hoare-logic/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/hoare-logic/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yDAAyD;AACzD,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,kEAAkE;AAClE,+DAA+D;AAC/D,+DAA+D;AAC/D,kEAAkE;AAClE,2BAA2B;AAC3B,EAAE;AACF,qBAAqB;AACrB,kEAAkE;AAClE,2DAA2D;AAC3D,EAAE;AACF,kBAAkB;AAClB,8BAA8B;AAC9B,qCAAqC;AACrC,2DAA2D;AAC3D,kFAAkF;AAClF,6DAA6D;AAC7D,2DAA2D;AAC3D,EAAE;AACF,kEAAkE;AAClE,gEAAgE;AAChE,oEAAoE;AACpE,gEAAgE;AAChE,8BAA8B;;;AAgF9B,kBASC;AAmBD,gCAiBC;AAKD,4BAgBC;AAGD,4BAuBC;AAQD,4BAuDC;AAgBD,4BAWC;AA+CD,gBAyBC;AASD,kCA4BC;AAKD,kCAMC;AA6DD,oCA2DC;AA8BD,kCAEC;AAYD,4CAWC;AASD,gCAQC;AAaD,kDAWC;AAKD,8BAIC;AAGD,kBAUC;AAjkBD,gEAAgE;AAEhE,2CAA2C;AACpC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAA5D,QAAA,GAAG,OAAyD;AACzE,2CAA2C;AACpC,MAAM,IAAI,GAAG,CAAC,CAAU,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAA7D,QAAA,IAAI,QAAyD;AAC1E,2DAA2D;AACpD,MAAM,CAAC,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAAvD,QAAA,CAAC,KAAsD;AACpE,4CAA4C;AACrC,MAAM,KAAK,GAAG,CAAC,EAAY,EAAE,IAAa,EAAE,KAAc,EAAW,EAAE,CAAC,CAAC;IAC9E,IAAI,EAAE,OAAO;IACb,EAAE;IACF,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AALU,QAAA,KAAK,SAKf;AACH,gDAAgD;AACzC,MAAM,GAAG,GAAG,CAAC,GAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;AAAxD,QAAA,GAAG,OAAqD;AACrE,6DAA6D;AACtD,MAAM,GAAG,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE,CAAC,IAAA,aAAK,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAA3E,QAAA,GAAG,OAAwE;AACxF,6DAA6D;AACtD,MAAM,EAAE,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE,CAAC,IAAA,aAAK,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAA1E,QAAA,EAAE,MAAwE;AACvF,oDAAoD;AAC7C,MAAM,EAAE,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE,CAAC,IAAA,aAAK,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAA1E,QAAA,EAAE,MAAwE;AACvF,yDAAyD;AAClD,MAAM,EAAE,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE,CAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAAzE,QAAA,EAAE,MAAuE;AACtF,yDAAyD;AAClD,MAAM,EAAE,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE,CAAC,IAAA,aAAK,EAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAA1E,QAAA,EAAE,MAAwE;AAEvF,kCAAkC;AAC3B,MAAM,IAAI,GAAG,GAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;AAAzC,QAAA,IAAI,QAAqC;AACtD,oDAAoD;AAC7C,MAAM,MAAM,GAAG,CAAC,OAAe,EAAE,IAAa,EAAW,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,QAAQ;IACd,GAAG,EAAE,OAAO;IACZ,IAAI;CACL,CAAC,CAAC;AAJU,QAAA,MAAM,UAIhB;AACH,wFAAwF;AACxF,SAAgB,GAAG,CAAC,GAAG,KAAgB;IACrC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAA,YAAI,GAAE,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IACxC,qDAAqD;IACrD,IAAI,GAAG,GAAY,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,GAAG,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IACtD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AACD,+DAA+D;AACxD,MAAM,GAAG,GAAG,CAAC,IAAa,EAAE,KAAc,EAAE,KAAc,EAAW,EAAE,CAAC,CAAC;IAC9E,IAAI,EAAE,IAAI;IACV,IAAI;IACJ,IAAI,EAAE,KAAK;IACX,IAAI,EAAE,KAAK;CACZ,CAAC,CAAC;AALU,QAAA,GAAG,OAKb;AACH,+EAA+E;AACxE,MAAM,MAAM,GAAG,CAAC,IAAa,EAAE,IAAa,EAAE,SAAmB,EAAW,EAAE,CAAC,CAAC;IACrF,IAAI,EAAE,OAAO;IACb,IAAI;IACJ,SAAS;IACT,IAAI;CACL,CAAC,CAAC;AALU,QAAA,MAAM,UAKhB;AAEH,gEAAgE;AAEhE,6EAA6E;AAC7E,SAAgB,UAAU,CAAC,IAAa,EAAE,OAAe,EAAE,WAAoB;IAC7E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,OAAO,CAAC;QACb,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC;QACpD,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC;gBACjD,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC;aACpD,CAAC;QACJ,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;IAC5E,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE,+FAA+F;AAC/F,SAAgB,QAAQ,CAAC,IAAa,EAAE,MAAmB,IAAI,GAAG,EAAE;IAClE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,OAAO,CAAC;QACb,KAAK,MAAM;YACT,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,OAAO,GAAG,CAAC;QACb,KAAK,OAAO;YACV,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC1B,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED,iFAAiF;AACjF,SAAgB,QAAQ,CAAC,IAAa,EAAE,MAAmB,IAAI,GAAG,EAAE;IAClE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAC3B,OAAO,GAAG,CAAC;QACb,KAAK,IAAI;YACP,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,OAAO,GAAG,CAAC;QACb,KAAK,OAAO;YACV,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,IAAI,IAAI,CAAC,SAAS;gBAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAClD,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAOD,0FAA0F;AAC1F,SAAgB,QAAQ,CAAC,IAAa,EAAE,KAAY;IAClD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,KAAK,MAAM;YACT,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,iEAAiE;YACjE,4DAA4D;YAC5D,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACzC,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACpC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACtC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;gBAChB,KAAK,GAAG;oBACN,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,GAAG;oBACN,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,GAAG;oBACN,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,GAAG,CAAC,CAAC,CAAC;oBACT,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACpB,IAAI,EAAE,KAAK,CAAC;wBAAE,OAAO,CAAC,CAAC,CAAC,uCAAuC;oBAC/D,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;gBACnC,CAAC;gBACD,KAAK,GAAG,CAAC,CAAC,CAAC;oBACT,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACpB,IAAI,EAAE,KAAK,CAAC;wBAAE,OAAO,CAAC,CAAC;oBACvB,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACvB,CAAC;gBACD,KAAK,GAAG;oBACN,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,IAAI;oBACP,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC9B,KAAK,GAAG;oBACN,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,IAAI;oBACP,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC9B,KAAK,IAAI;oBACP,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC/B,KAAK,IAAI;oBACP,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC/B,KAAK,IAAI;oBACP,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;gBAChC,KAAK,IAAI;oBACP,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,KAAK,CAAC,CAAmB;IAChC,OAAO,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,MAAM,CAAC,CAAmB;IACjC,OAAO,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAC9C,CAAC;AAOD,2GAA2G;AAC3G,SAAgB,QAAQ,CACtB,IAAa,EACb,KAAY,EACZ,WAAmB,MAAM;IAEzB,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IAC9C,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC;IACnD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,EAAE,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;IACrE,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CACnB,IAAa,EACb,KAAY,EACZ,OAAyC;IAEzC,IAAI,OAAO,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CAAC,uCAAuC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;IAC3E,CAAC;IACD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,KAAK,CAAC;QACf,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/B,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACzC,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACxC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjB,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;oBACpC,MAAM,IAAI,KAAK,CAAC,gDAAgD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;gBACpF,CAAC;gBACD,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE,+GAA+G;AAC/G,SAAgB,EAAE,CAAC,IAAa,EAAE,IAAa;IAC7C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACpC,OAAO,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACnC,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACnC,qCAAqC;YACrC,OAAO,IAAA,WAAG,EAAC,IAAA,UAAE,EAAC,IAAA,WAAG,EAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,EAAE,IAAA,UAAE,EAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,0DAA0D;YAC1D,wDAAwD;YACxD,IAAI,CAAC,IAAI,CAAC,SAAS;gBAAE,OAAO,IAAA,YAAI,EAAC,KAAK,CAAC,CAAC;YACxC,6DAA6D;YAC7D,2DAA2D;YAC3D,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,EAAE;AACF,kEAAkE;AAClE,gEAAgE;AAChE,qDAAqD;AAErD,qHAAqH;AACrH,SAAgB,WAAW,CAAC,IAAa,EAAE,GAAY;IACrD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,qEAAqE;YACrE,+CAA+C;YAC/C,yDAAyD;YACzD,4DAA4D;YAC5D,uDAAuD;YACvD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,OAAO,IAAA,WAAG,EAAC,GAAG,EAAE,IAAA,UAAE,EAAC,IAAA,SAAC,EAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;YACD,OAAO,IAAA,YAAI,EAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,KAAK,KAAK;YACR,OAAO,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QAChE,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,WAAG,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3D,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,WAAG,EAAC,GAAG,EAAE,IAAA,WAAG,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChE,OAAO,IAAA,UAAE,EAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC5B,CAAC;QACD,KAAK,OAAO;YACV,2DAA2D;YAC3D,IAAI,IAAI,CAAC,SAAS;gBAAE,OAAO,IAAA,WAAG,EAAC,IAAI,CAAC,SAAS,EAAE,IAAA,WAAG,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/D,OAAO,IAAA,YAAI,EAAC,IAAI,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE,2GAA2G;AAC3G,SAAgB,WAAW,CAAC,MAAmB;IAC7C,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,kCAAkC;IAClC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,cAAc,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9C,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,CAAU,EAAE,CAAU;IACrC,OAAO,IAAA,UAAE,EAAC,IAAA,WAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvB,CAAC;AAED,SAAS,cAAc,CAAC,IAAa,EAAE,IAAa,EAAE,GAAc;IAClE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,OAAO;QACT,KAAK,KAAK;YACR,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YACvD,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACvC,OAAO;QACT,KAAK,IAAI;YACP,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,OAAO;QACT,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACpB,2CAA2C;gBAC3C,GAAG,CAAC,IAAI,CAAC,IAAA,YAAI,EAAC,KAAK,CAAC,CAAC,CAAC;gBACtB,OAAO;YACT,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;YACzB,0CAA0C;YAC1C,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAA,WAAG,EAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACvD,8DAA8D;YAC9D,4DAA4D;YAC5D,gEAAgE;YAChE,4BAA4B;YAC5B,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAA,WAAG,EAAC,CAAC,EAAE,IAAA,WAAG,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YAChD,4CAA4C;YAC5C,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAClC,OAAO;QACT,CAAC;IACH,CAAC;AACH,CAAC;AAsBD,gFAAgF;AAChF,SAAgB,YAAY,CAAC,MAAmB,EAAE,OAAsB,EAAE;IACxE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,GAAG,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAEhC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC3B,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5B,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5B,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAE3B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,QAAQ,GAA0C,EAAE,CAAC;IAE3D,wEAAwE;IACxE,MAAM,YAAY,GAAY,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,MAAM,EAAE,GAAU,EAAE,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,QAAQ;YAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC;IAE9D,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,cAAiC,CAAC;QACtC,iEAAiE;QACjE,0BAA0B;QAC1B,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,IAAI,EAAE,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;YAC7C,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,SAAS;QACX,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBACpB,cAAc,GAAG,EAAE,CAAC;gBACpB,MAAM;YACR,CAAC;QACH,CAAC;QACD,qBAAqB;QACrB,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,EAAE,GAAU,EAAE,CAAC;gBACrB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,EAAE,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtD,CAAC;gBACD,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;oBACpB,cAAc,GAAG,EAAE,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;AACzD,CAAC;AAED,SAAS,MAAM,CAAC,EAAW,EAAE,KAAY;IACvC,OAAO,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,UAAU,CAAC,IAAa;IAC/B,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,MAAM,CAAC;IAC3C,0CAA0C;IAC1C,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;IACnB,OAAO,GAAG,EAAE;QACV,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,IAAkB,EAAE,EAAU,EAAE,EAAU;IAChE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AACjD,CAAC;AAED,gEAAgE;AAEhE;;;;GAIG;AACH,SAAgB,WAAW;IACzB,OAAO,GAAG,CAAC,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,gBAAgB;IAC9B,MAAM,IAAI,GAAG,GAAG,CACd,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EACvC,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CACxC,CAAC;IACF,MAAM,SAAS,GAAG,IAAA,WAAG,EAAC,IAAA,UAAE,EAAC,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,aAAK,EAAC,IAAI,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,OAAO,GAAG,CACR,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,EACnB,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,EACnB,IAAA,cAAM,EAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CACpD,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,UAAU;IACxB,MAAM,IAAI,GAAG,IAAA,WAAG,EACd,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAC1B,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,CAAC,EACvC,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CACxC,CAAC;IACF,MAAM,SAAS,GAAG,IAAA,WAAG,EAAC,IAAA,aAAK,EAAC,IAAI,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,aAAK,EAAC,IAAI,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,OAAO,IAAA,cAAM,EAAC,IAAA,aAAK,EAAC,IAAI,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,mBAAmB;IACjC,MAAM,IAAI,GAAG,GAAG,CACd,IAAA,WAAG,EAAC,IAAA,UAAE,EAAC,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,QAAQ,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,OAAO,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,YAAI,GAAE,CAAC,EAC7D,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CACxC,CAAC;IACF,MAAM,SAAS,GAAG,IAAA,WAAG,EAAC,IAAA,UAAE,EAAC,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,UAAE,EAAC,IAAA,UAAE,EAAC,IAAA,SAAC,EAAC,OAAO,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,UAAE,EAAC,IAAA,SAAC,EAAC,OAAO,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,OAAO,GAAG,CACR,IAAA,cAAM,EAAC,GAAG,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,EACnB,IAAA,cAAM,EAAC,OAAO,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,EACvB,IAAA,cAAM,EAAC,IAAA,WAAG,EAAC,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,EAAE,IAAA,SAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,UAAE,EAAC,IAAA,SAAC,EAAC,OAAO,CAAC,EAAE,IAAA,WAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CACjF,CAAC;AACJ,CAAC;AAED,gEAAgE;AAEhE,4EAA4E;AAC5E,SAAgB,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,CAAC,CAAC;IACpC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,qEAAqE;AACrE,SAAgB,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACf,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,CAAC,CAAC;;YACb,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/reasoning/hyperreal/index.d.ts

@@ -1,13 +1,30 @@
+/**
+ * A first-order hyperreal number `standard + infinitesimal · ε`,
+ * where ε is a formal infinitesimal (ε² ≈ 0).
+ */
 export interface Hyperreal {
     readonly standard: number;
     readonly infinitesimal: number;
 }
+/**
+ * Constructs a {@link Hyperreal} from its standard and optional infinitesimal parts.
+ * `hr(x)` produces the standard real `x + 0ε`.
+ */
 export declare function hr(standard: number, infinitesimal?: number): Hyperreal;
+/** The hyperreal zero: 0 + 0ε. */
 export declare const HR_ZERO: Hyperreal;
+/** The hyperreal one: 1 + 0ε. */
 export declare const HR_ONE: Hyperreal;
+/** The formal infinitesimal ε: 0 + 1ε. */
 export declare const HR_EPSILON: Hyperreal;
+/** Returns `a + b` (component-wise addition). */
 export declare function add(a: Hyperreal, b: Hyperreal): Hyperreal;
+/** Returns `a - b` (component-wise subtraction). */
 export declare function sub(a: Hyperreal, b: Hyperreal): Hyperreal;
+/**
+ * Returns `a * b`, discarding O(ε²) terms:
+ * `(a.s + a.i ε)(b.s + b.i ε) = a.s·b.s + (a.s·b.i + a.i·b.s)·ε`.
+ */
 export declare function mul(a: Hyperreal, b: Hyperreal): Hyperreal;
 /**
  * Compara dos hiperreales lexicográficamente: primero la parte estándar,
@@ -18,17 +35,29 @@ export declare function mul(a: Hyperreal, b: Hyperreal): Hyperreal;
  * porque su magnitud es de orden O(1) en el coeficiente.
  */
 export declare function compare(a: Hyperreal, b: Hyperreal): -1 | 0 | 1;
+/** Returns `true` when `a` and `b` are equal under the lexicographic order. */
 export declare function eq(a: Hyperreal, b: Hyperreal): boolean;
+/** Returns `true` when `a < b` in the hyperreal order. */
 export declare function lt(a: Hyperreal, b: Hyperreal): boolean;
+/** Returns `true` when `a > b` in the hyperreal order. */
 export declare function gt(a: Hyperreal, b: Hyperreal): boolean;
+/** Probabilistic AND: `p ∧ q = p · q`. */
 export declare function hrAnd(p: Hyperreal, q: Hyperreal): Hyperreal;
+/** Probabilistic OR (inclusion-exclusion): `p ∨ q = p + q − p·q`. */
 export declare function hrOr(p: Hyperreal, q: Hyperreal): Hyperreal;
+/** Probabilistic NOT: `¬p = 1 − p`. */
 export declare function hrNot(p: Hyperreal): Hyperreal;
+/** Probabilistic implication: `p → q = ¬p ∨ q`. */
 export declare function hrImplies(p: Hyperreal, q: Hyperreal): Hyperreal;
+/** A closed interval `[lower, upper]` of hyperreal probabilities. */
 export interface UncertaintyBound {
     readonly lower: Hyperreal;
     readonly upper: Hyperreal;
 }
+/**
+ * Constructs a validated {@link UncertaintyBound}.
+ * @throws When `lower > upper` in the hyperreal order.
+ */
 export declare function bound(lower: Hyperreal, upper: Hyperreal): UncertaintyBound;
 /**
  * Propaga una operación lógica sobre cotas de incertidumbre.
@@ -41,5 +70,6 @@ export declare function bound(lower: Hyperreal, upper: Hyperreal): UncertaintyBo
  *   en q ⇒ lower = (upper_p → lower_q), upper = (lower_p → upper_q).
  */
 export declare function propagate(b: UncertaintyBound, op: 'and' | 'or' | 'not' | 'implies', other?: UncertaintyBound): UncertaintyBound;
+/** Returns a human-readable string like `"0.9 + 3ε"` or `"1"` (when infinitesimal is 0). */
 export declare function hrToString(x: Hyperreal): string;
 //# sourceMappingURL=index.d.ts.map