@stevenvo780/st-lang 4.5.1 → 4.6.0

package/dist/csp-hoare/semantics.js

@@ -0,0 +1,494 @@
+"use strict";
+// ============================================================
+// CSP Hoare — Semántica operacional (LTS) + alfabetos
+// ============================================================
+// Implementa un sistema de transición etiquetado (LTS) sobre `Process`:
+//
+//   • `nextEvents(P)` — eventos visibles ofrecidos inmediatamente (sin
+//     resolver elección interna). Para `P ⊓ Q` devolvemos la unión: ambos
+//     son alcanzables vía un paso interno (τ).
+//   • `step(P, a)` — derivada tras un evento visible. Si `a` no está en
+//     `initials(P)`, devuelve `null`. Para los operadores no-deterministas
+//     elegimos cualquier rama que ofrezca `a`.
+//
+// Para las semánticas más finas (failures) exponemos `internalResolutions`,
+// que enumera todos los estados estables (sin τ pendientes) alcanzables
+// mediante choices internos. Esto evita explorar la rama "muerta" de un
+// `P ⊓ Q` cuando solo nos interesa qué puede ofrecer una resolución dada.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SKIP = exports.STOP = void 0;
+exports.prefix = prefix;
+exports.choice = choice;
+exports.internal = internal;
+exports.parallel = parallel;
+exports.interleave = interleave;
+exports.sequence = sequence;
+exports.hide = hide;
+exports.rename = rename;
+exports.recursion = recursion;
+exports.processVar = processVar;
+exports.alphabet = alphabet;
+exports.nextEvents = nextEvents;
+exports.step = step;
+exports.internalResolutions = internalResolutions;
+const types_1 = require("./types");
+// ── Constructores cómodos ───────────────────────────────────
+exports.STOP = { kind: 'stop' };
+exports.SKIP = { kind: 'skip' };
+function prefix(event, cont) {
+    return { kind: 'prefix', event, cont };
+}
+function choice(left, right) {
+    return { kind: 'choice', left, right };
+}
+function internal(left, right) {
+    return { kind: 'internal', left, right };
+}
+function parallel(left, right, alphabet) {
+    return { kind: 'parallel', left, right, alphabet };
+}
+function interleave(left, right) {
+    return { kind: 'interleave', left, right };
+}
+function sequence(left, right) {
+    return { kind: 'sequence', left, right };
+}
+function hide(process, events) {
+    return { kind: 'hide', process, events };
+}
+function rename(process, mapping) {
+    return { kind: 'rename', process, mapping };
+}
+function recursion(name, body) {
+    return { kind: 'recursion', name, body };
+}
+function processVar(name) {
+    return { kind: 'var', name };
+}
+// ── Alfabeto sintáctico ─────────────────────────────────────
+/**
+ * Conjunto de eventos visibles mencionados sintácticamente en `p`.
+ * Los eventos renombrados aportan tanto la fuente como el destino
+ * (la fuente puede aparecer en una rama no recorrida, y el destino
+ * es lo que el entorno observa).
+ */
+function alphabet(p) {
+    const out = new Set();
+    collectAlphabet(p, out);
+    return out;
+}
+function collectAlphabet(p, out) {
+    switch (p.kind) {
+        case 'stop':
+        case 'skip':
+        case 'var':
+            return;
+        case 'prefix':
+            out.add(p.event);
+            collectAlphabet(p.cont, out);
+            return;
+        case 'choice':
+        case 'internal':
+        case 'interleave':
+        case 'sequence':
+            collectAlphabet(p.left, out);
+            collectAlphabet(p.right, out);
+            return;
+        case 'parallel':
+            collectAlphabet(p.left, out);
+            collectAlphabet(p.right, out);
+            for (const e of p.alphabet)
+                out.add(e);
+            return;
+        case 'hide':
+            collectAlphabet(p.process, out);
+            for (const e of p.events)
+                out.delete(e);
+            return;
+        case 'rename': {
+            const inner = new Set();
+            collectAlphabet(p.process, inner);
+            for (const e of inner)
+                out.add(p.mapping.get(e) ?? e);
+            return;
+        }
+        case 'recursion':
+            collectAlphabet(p.body, out);
+            return;
+    }
+}
+// ── Desplegado de recursión ─────────────────────────────────
+/**
+ * Sustituye la variable de proceso `name` por `replacement` en `p`.
+ * Es una sustitución por valor (no captura porque las variables son
+ * nombres globales del nivel de declaración).
+ */
+function substituteVar(p, name, replacement) {
+    switch (p.kind) {
+        case 'stop':
+        case 'skip':
+            return p;
+        case 'var':
+            return p.name === name ? replacement : p;
+        case 'prefix':
+            return { kind: 'prefix', event: p.event, cont: substituteVar(p.cont, name, replacement) };
+        case 'choice':
+            return {
+                kind: 'choice',
+                left: substituteVar(p.left, name, replacement),
+                right: substituteVar(p.right, name, replacement),
+            };
+        case 'internal':
+            return {
+                kind: 'internal',
+                left: substituteVar(p.left, name, replacement),
+                right: substituteVar(p.right, name, replacement),
+            };
+        case 'parallel':
+            return {
+                kind: 'parallel',
+                left: substituteVar(p.left, name, replacement),
+                right: substituteVar(p.right, name, replacement),
+                alphabet: p.alphabet,
+            };
+        case 'interleave':
+            return {
+                kind: 'interleave',
+                left: substituteVar(p.left, name, replacement),
+                right: substituteVar(p.right, name, replacement),
+            };
+        case 'sequence':
+            return {
+                kind: 'sequence',
+                left: substituteVar(p.left, name, replacement),
+                right: substituteVar(p.right, name, replacement),
+            };
+        case 'hide':
+            return {
+                kind: 'hide',
+                process: substituteVar(p.process, name, replacement),
+                events: p.events,
+            };
+        case 'rename':
+            return {
+                kind: 'rename',
+                process: substituteVar(p.process, name, replacement),
+                mapping: p.mapping,
+            };
+        case 'recursion':
+            // shadowing: si la recursión re-define la misma variable, no entrar.
+            if (p.name === name)
+                return p;
+            return { kind: 'recursion', name: p.name, body: substituteVar(p.body, name, replacement) };
+    }
+}
+/** μX.P → P[X := μX.P], un solo paso de desplegado. */
+function unfoldOnce(p) {
+    return substituteVar(p.body, p.name, p);
+}
+// ── Eventos iniciales ───────────────────────────────────────
+/**
+ * Eventos visibles que `p` puede ofrecer inmediatamente como su primer
+ * evento (tomando todas las resoluciones internas). No incluye τ (los
+ * eventos ocultos son silenciosos por construcción).
+ *
+ * Para `SKIP` reportamos el tick `✓` — termina exitosamente.
+ */
+function nextEvents(p) {
+    const out = new Set();
+    collectInitials(p, out, 0);
+    return out;
+}
+const MAX_UNFOLD_DEPTH = 64;
+function collectInitials(p, out, depth) {
+    if (depth > MAX_UNFOLD_DEPTH)
+        return; // protección contra recursión sin guarda
+    switch (p.kind) {
+        case 'stop':
+            return;
+        case 'skip':
+            out.add(types_1.TICK);
+            return;
+        case 'prefix':
+            out.add(p.event);
+            return;
+        case 'choice':
+        case 'internal':
+            collectInitials(p.left, out, depth);
+            collectInitials(p.right, out, depth);
+            return;
+        case 'parallel': {
+            const sync = new Set(p.alphabet);
+            const li = new Set();
+            const ri = new Set();
+            collectInitials(p.left, li, depth);
+            collectInitials(p.right, ri, depth);
+            for (const e of li) {
+                if (sync.has(e)) {
+                    if (ri.has(e))
+                        out.add(e);
+                }
+                else {
+                    out.add(e);
+                }
+            }
+            for (const e of ri) {
+                if (sync.has(e)) {
+                    if (li.has(e))
+                        out.add(e);
+                }
+                else {
+                    out.add(e);
+                }
+            }
+            return;
+        }
+        case 'interleave': {
+            const li = new Set();
+            const ri = new Set();
+            collectInitials(p.left, li, depth);
+            collectInitials(p.right, ri, depth);
+            // El tick solo se ofrece cuando ambos terminan; en interleave puro
+            // sigue la regla "ambos a la vez".
+            for (const e of li)
+                if (e !== types_1.TICK)
+                    out.add(e);
+            for (const e of ri)
+                if (e !== types_1.TICK)
+                    out.add(e);
+            if (li.has(types_1.TICK) && ri.has(types_1.TICK))
+                out.add(types_1.TICK);
+            return;
+        }
+        case 'sequence': {
+            const li = new Set();
+            collectInitials(p.left, li, depth);
+            for (const e of li) {
+                if (e !== types_1.TICK)
+                    out.add(e);
+            }
+            if (li.has(types_1.TICK)) {
+                collectInitials(p.right, out, depth);
+            }
+            return;
+        }
+        case 'hide': {
+            const hidden = new Set(p.events);
+            const inner = new Set();
+            collectInitials(p.process, inner, depth);
+            // Si algún evento oculto está disponible, hay un τ: avanzamos
+            // silenciosamente y recolectamos lo que se ofrece desde ahí.
+            let progressed = false;
+            for (const e of inner) {
+                if (hidden.has(e)) {
+                    const next = step(p.process, e);
+                    if (next) {
+                        collectInitials({ kind: 'hide', process: next, events: p.events }, out, depth + 1);
+                        progressed = true;
+                    }
+                }
+            }
+            // Los eventos no ocultos siguen siendo ofrecidos por la versión actual.
+            for (const e of inner) {
+                if (!hidden.has(e))
+                    out.add(e);
+            }
+            // Si solo había τ disponibles pero ninguno avanzó (caso raro), no
+            // ofrecemos nada visible — equivale a deadlock visible.
+            void progressed;
+            return;
+        }
+        case 'rename': {
+            const inner = new Set();
+            collectInitials(p.process, inner, depth);
+            for (const e of inner) {
+                if (e === types_1.TICK)
+                    out.add(types_1.TICK);
+                else
+                    out.add(p.mapping.get(e) ?? e);
+            }
+            return;
+        }
+        case 'recursion':
+            collectInitials(unfoldOnce(p), out, depth + 1);
+            return;
+        case 'var':
+            // Variable libre: no hay nada que ofrecer.
+            return;
+    }
+}
+// ── Paso operacional ────────────────────────────────────────
+/**
+ * `step(P, a)` aplica una transición visible etiquetada con `a` y devuelve
+ * el continuante, o `null` si `a` no está habilitado. Para procesos no-
+ * deterministas elegimos arbitrariamente cualquier rama que habilite `a`
+ * (eso es válido para análisis de trazas; para failures inspeccionamos
+ * todas las resoluciones aparte).
+ */
+function step(p, event) {
+    return stepRec(p, event, 0);
+}
+function stepRec(p, event, depth) {
+    if (depth > MAX_UNFOLD_DEPTH)
+        return null;
+    switch (p.kind) {
+        case 'stop':
+            return null;
+        case 'skip':
+            return event === types_1.TICK ? exports.STOP : null;
+        case 'prefix':
+            return event === p.event ? p.cont : null;
+        case 'choice':
+        case 'internal': {
+            const l = stepRec(p.left, event, depth);
+            if (l !== null)
+                return l;
+            return stepRec(p.right, event, depth);
+        }
+        case 'parallel': {
+            const sync = new Set(p.alphabet);
+            if (sync.has(event)) {
+                const l = stepRec(p.left, event, depth);
+                const r = stepRec(p.right, event, depth);
+                if (l === null || r === null)
+                    return null;
+                return { kind: 'parallel', left: l, right: r, alphabet: p.alphabet };
+            }
+            const l = stepRec(p.left, event, depth);
+            if (l !== null) {
+                return { kind: 'parallel', left: l, right: p.right, alphabet: p.alphabet };
+            }
+            const r = stepRec(p.right, event, depth);
+            if (r !== null) {
+                return { kind: 'parallel', left: p.left, right: r, alphabet: p.alphabet };
+            }
+            return null;
+        }
+        case 'interleave': {
+            if (event === types_1.TICK) {
+                // Ambos lados deben aceptar ✓ simultáneamente.
+                const l = stepRec(p.left, types_1.TICK, depth);
+                const r = stepRec(p.right, types_1.TICK, depth);
+                if (l === null || r === null)
+                    return null;
+                return exports.STOP;
+            }
+            const l = stepRec(p.left, event, depth);
+            if (l !== null)
+                return { kind: 'interleave', left: l, right: p.right };
+            const r = stepRec(p.right, event, depth);
+            if (r !== null)
+                return { kind: 'interleave', left: p.left, right: r };
+            return null;
+        }
+        case 'sequence': {
+            // Si el lado izquierdo puede terminar (ofrece ✓) y aceptamos un
+            // evento que sólo está disponible en `right`, transicionamos a `right`.
+            const initialsLeft = nextEvents(p.left);
+            if (event !== types_1.TICK && initialsLeft.has(event)) {
+                const l = stepRec(p.left, event, depth);
+                if (l !== null)
+                    return { kind: 'sequence', left: l, right: p.right };
+            }
+            if (initialsLeft.has(types_1.TICK)) {
+                // P termina silenciosamente y pasamos a Q.
+                return stepRec(p.right, event, depth + 1);
+            }
+            // Reintento por si el evento existía solo en `left` (sin tick).
+            if (event !== types_1.TICK) {
+                const l = stepRec(p.left, event, depth);
+                if (l !== null)
+                    return { kind: 'sequence', left: l, right: p.right };
+            }
+            return null;
+        }
+        case 'hide': {
+            const hidden = new Set(p.events);
+            if (hidden.has(event))
+                return null; // los ocultos no son observables
+            // Caso 1: el evento es directamente ofrecido por el cuerpo.
+            const direct = stepRec(p.process, event, depth);
+            if (direct !== null) {
+                return { kind: 'hide', process: direct, events: p.events };
+            }
+            // Caso 2: hay τ pendientes (eventos ocultos disponibles). Los
+            // disparamos silenciosamente y reintentamos.
+            const inner = nextEvents(p.process);
+            for (const eHidden of hidden) {
+                if (inner.has(eHidden)) {
+                    const after = stepRec(p.process, eHidden, depth);
+                    if (after !== null) {
+                        const wrapped = { kind: 'hide', process: after, events: p.events };
+                        const r = stepRec(wrapped, event, depth + 1);
+                        if (r !== null)
+                            return r;
+                    }
+                }
+            }
+            return null;
+        }
+        case 'rename': {
+            // Encontrar todos los eventos del cuerpo que se renombran a `event`.
+            // (Mapping puede ser muchos-a-uno.)
+            const sources = [];
+            for (const [src, dst] of p.mapping) {
+                if (dst === event)
+                    sources.push(src);
+            }
+            // Eventos no listados quedan idénticos: si event ∉ values(mapping)
+            // y event ∉ keys(mapping), `event` también es candidato literal.
+            const isMappedTarget = sources.length > 0;
+            const isMappedSource = p.mapping.has(event);
+            if (!isMappedSource)
+                sources.push(event);
+            for (const src of sources) {
+                const r = stepRec(p.process, src, depth);
+                if (r !== null) {
+                    return { kind: 'rename', process: r, mapping: p.mapping };
+                }
+            }
+            // Cuando `event` es key del mapping pero no value y no calzó nada,
+            // efectivamente está bloqueado.
+            void isMappedTarget;
+            return null;
+        }
+        case 'recursion':
+            return stepRec(unfoldOnce(p), event, depth + 1);
+        case 'var':
+            return null;
+    }
+}
+/**
+ * Enumera todos los estados "estables" alcanzables desde `p` resolviendo
+ * elecciones internas (`⊓`) y desplegando recursiones inmediatas, sin
+ * consumir eventos visibles. Útil para la semántica de failures, donde
+ * el conjunto de refusal depende de QUÉ rama interna se eligió.
+ *
+ * Devuelve procesos sin un `internal` en la raíz (después de empujarlo
+ * hacia adentro de operadores asociativos cuando aplica). El número de
+ * resoluciones es 2^(# de internals encadenados), así que limitamos a un
+ * número razonable para no explotar.
+ */
+function internalResolutions(p, limit = 64) {
+    const out = [];
+    resolveInternal(p, out, limit, 0);
+    return out;
+}
+function resolveInternal(p, out, limit, depth) {
+    if (out.length >= limit || depth > MAX_UNFOLD_DEPTH)
+        return;
+    switch (p.kind) {
+        case 'internal':
+            resolveInternal(p.left, out, limit, depth);
+            resolveInternal(p.right, out, limit, depth);
+            return;
+        case 'recursion':
+            resolveInternal(unfoldOnce(p), out, limit, depth + 1);
+            return;
+        default:
+            out.push(p);
+            return;
+    }
+}
+//# sourceMappingURL=semantics.js.map

package/dist/csp-hoare/semantics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantics.js","sourceRoot":"","sources":["../../src/csp-hoare/semantics.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,+DAA+D;AAC/D,wEAAwE;AACxE,EAAE;AACF,uEAAuE;AACvE,0EAA0E;AAC1E,+CAA+C;AAC/C,wEAAwE;AACxE,2EAA2E;AAC3E,+CAA+C;AAC/C,EAAE;AACF,4EAA4E;AAC5E,wEAAwE;AACxE,wEAAwE;AACxE,0EAA0E;AAC1E,+DAA+D;;;AAU/D,wBAEC;AACD,wBAEC;AACD,4BAEC;AACD,4BAEC;AACD,gCAEC;AACD,4BAEC;AACD,oBAEC;AACD,wBAEC;AACD,8BAEC;AACD,gCAEC;AAUD,4BAIC;AAwHD,gCAIC;AAqHD,oBAEC;AAqID,kDAIC;AA9aD,mCAA+B;AAE/B,+DAA+D;AAElD,QAAA,IAAI,GAAY,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AACjC,QAAA,IAAI,GAAY,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAE9C,SAAgB,MAAM,CAAC,KAAY,EAAE,IAAa;IAChD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACzC,CAAC;AACD,SAAgB,MAAM,CAAC,IAAa,EAAE,KAAc;IAClD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzC,CAAC;AACD,SAAgB,QAAQ,CAAC,IAAa,EAAE,KAAc;IACpD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC3C,CAAC;AACD,SAAgB,QAAQ,CAAC,IAAa,EAAE,KAAc,EAAE,QAAiB;IACvE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACrD,CAAC;AACD,SAAgB,UAAU,CAAC,IAAa,EAAE,KAAc;IACtD,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC7C,CAAC;AACD,SAAgB,QAAQ,CAAC,IAAa,EAAE,KAAc;IACpD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC3C,CAAC;AACD,SAAgB,IAAI,CAAC,OAAgB,EAAE,MAAe;IACpD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC3C,CAAC;AACD,SAAgB,MAAM,CAAC,OAAgB,EAAE,OAA0B;IACjE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC9C,CAAC;AACD,SAAgB,SAAS,CAAC,IAAY,EAAE,IAAa;IACnD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC3C,CAAC;AACD,SAAgB,UAAU,CAAC,IAAY;IACrC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC/B,CAAC;AAED,+DAA+D;AAE/D;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,CAAU;IACjC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAS,CAAC;IAC7B,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CAAC,CAAU,EAAE,GAAe;IAClD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,KAAK;YACR,OAAO;QACT,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjB,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,OAAO;QACT,KAAK,QAAQ,CAAC;QACd,KAAK,UAAU,CAAC;QAChB,KAAK,YAAY,CAAC;QAClB,KAAK,UAAU;YACb,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9B,OAAO;QACT,KAAK,UAAU;YACb,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvC,OAAO;QACT,KAAK,MAAM;YACT,eAAe,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAChC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM;gBAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxC,OAAO;QACT,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,IAAI,GAAG,EAAS,CAAC;YAC/B,eAAe,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACtD,OAAO;QACT,CAAC;QACD,KAAK,WAAW;YACd,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,OAAO;IACX,CAAC;AACH,CAAC;AAED,+DAA+D;AAE/D;;;;GAIG;AACH,SAAS,aAAa,CAAC,CAAU,EAAE,IAAY,EAAE,WAAoB;IACnE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM;YACT,OAAO,CAAC,CAAC;QACX,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,KAAK,QAAQ;YACX,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;QAC5F,KAAK,QAAQ;YACX,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC;gBAC9C,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC;aACjD,CAAC;QACJ,KAAK,UAAU;YACb,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC;gBAC9C,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC;aACjD,CAAC;QACJ,KAAK,UAAU;YACb,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC;gBAC9C,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC;gBAChD,QAAQ,EAAE,CAAC,CAAC,QAAQ;aACrB,CAAC;QACJ,KAAK,YAAY;YACf,OAAO;gBACL,IAAI,EAAE,YAAY;gBAClB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC;gBAC9C,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC;aACjD,CAAC;QACJ,KAAK,UAAU;YACb,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC;gBAC9C,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC;aACjD,CAAC;QACJ,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC;gBACpD,MAAM,EAAE,CAAC,CAAC,MAAM;aACjB,CAAC;QACJ,KAAK,QAAQ;YACX,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC;gBACpD,OAAO,EAAE,CAAC,CAAC,OAAO;aACnB,CAAC;QACJ,KAAK,WAAW;YACd,qEAAqE;YACrE,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC9B,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;IAC/F,CAAC;AACH,CAAC;AAED,uDAAuD;AACvD,SAAS,UAAU,CAAC,CAAkC;IACpD,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED,+DAA+D;AAE/D;;;;;;GAMG;AACH,SAAgB,UAAU,CAAC,CAAU;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAS,CAAC;IAC7B,eAAe,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC3B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B,SAAS,eAAe,CAAC,CAAU,EAAE,GAAe,EAAE,KAAa;IACjE,IAAI,KAAK,GAAG,gBAAgB;QAAE,OAAO,CAAC,yCAAyC;IAC/E,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO;QACT,KAAK,MAAM;YACT,GAAG,CAAC,GAAG,CAAC,YAAI,CAAC,CAAC;YACd,OAAO;QACT,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjB,OAAO;QACT,KAAK,QAAQ,CAAC;QACd,KAAK,UAAU;YACb,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YACpC,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YACrC,OAAO;QACT,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAS,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAS,CAAC;YAC5B,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACnC,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACpC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC5B,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC5B,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;YACD,OAAO;QACT,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,EAAE,GAAG,IAAI,GAAG,EAAS,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAS,CAAC;YAC5B,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACnC,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACpC,mEAAmE;YACnE,mCAAmC;YACnC,KAAK,MAAM,CAAC,IAAI,EAAE;gBAAE,IAAI,CAAC,KAAK,YAAI;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/C,KAAK,MAAM,CAAC,IAAI,EAAE;gBAAE,IAAI,CAAC,KAAK,YAAI;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAI,EAAE,CAAC,GAAG,CAAC,YAAI,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,YAAI,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,YAAI,CAAC,CAAC;YAChD,OAAO;QACT,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,IAAI,GAAG,EAAS,CAAC;YAC5B,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC,KAAK,YAAI;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC;YACD,IAAI,EAAE,CAAC,GAAG,CAAC,YAAI,CAAC,EAAE,CAAC;gBACjB,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YACvC,CAAC;YACD,OAAO;QACT,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAS,CAAC;YAC/B,eAAe,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACzC,8DAA8D;YAC9D,6DAA6D;YAC7D,IAAI,UAAU,GAAG,KAAK,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;oBAChC,IAAI,IAAI,EAAE,CAAC;wBACT,eAAe,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;wBACnF,UAAU,GAAG,IAAI,CAAC;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,wEAAwE;YACxE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;YACD,kEAAkE;YAClE,wDAAwD;YACxD,KAAK,UAAU,CAAC;YAChB,OAAO;QACT,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,IAAI,GAAG,EAAS,CAAC;YAC/B,eAAe,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,YAAI;oBAAE,GAAG,CAAC,GAAG,CAAC,YAAI,CAAC,CAAC;;oBACzB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACtC,CAAC;YACD,OAAO;QACT,CAAC;QACD,KAAK,WAAW;YACd,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/C,OAAO;QACT,KAAK,KAAK;YACR,2CAA2C;YAC3C,OAAO;IACX,CAAC;AACH,CAAC;AAED,+DAA+D;AAE/D;;;;;;GAMG;AACH,SAAgB,IAAI,CAAC,CAAU,EAAE,KAAY;IAC3C,OAAO,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,OAAO,CAAC,CAAU,EAAE,KAAY,EAAE,KAAa;IACtD,IAAI,KAAK,GAAG,gBAAgB;QAAE,OAAO,IAAI,CAAC;IAC1C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,MAAM;YACT,OAAO,KAAK,KAAK,YAAI,CAAC,CAAC,CAAC,YAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACtC,KAAK,QAAQ;YACX,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3C,KAAK,QAAQ,CAAC;QACd,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YACzB,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACjC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACzC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;oBAAE,OAAO,IAAI,CAAC;gBAC1C,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;YACvE,CAAC;YACD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC7E,CAAC;YACD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC5E,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,KAAK,YAAI,EAAE,CAAC;gBACnB,+CAA+C;gBAC/C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,YAAI,EAAE,KAAK,CAAC,CAAC;gBACvC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,YAAI,EAAE,KAAK,CAAC,CAAC;gBACxC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;oBAAE,OAAO,IAAI,CAAC;gBAC1C,OAAO,YAAI,CAAC;YACd,CAAC;YACD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;YACvE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACtE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,gEAAgE;YAChE,wEAAwE;YACxE,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,KAAK,KAAK,YAAI,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACxC,IAAI,CAAC,KAAK,IAAI;oBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;YACvE,CAAC;YACD,IAAI,YAAY,CAAC,GAAG,CAAC,YAAI,CAAC,EAAE,CAAC;gBAC3B,2CAA2C;gBAC3C,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,gEAAgE;YAChE,IAAI,KAAK,KAAK,YAAI,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACxC,IAAI,CAAC,KAAK,IAAI;oBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;YACvE,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACjC,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC,CAAC,iCAAiC;YACrE,4DAA4D;YAC5D,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAChD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;YAC7D,CAAC;YACD,8DAA8D;YAC9D,6CAA6C;YAC7C,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACpC,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;gBAC7B,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACvB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;oBACjD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;wBACnB,MAAM,OAAO,GAAY,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;wBAC5E,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;wBAC7C,IAAI,CAAC,KAAK,IAAI;4BAAE,OAAO,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,qEAAqE;YACrE,oCAAoC;YACpC,MAAM,OAAO,GAAY,EAAE,CAAC;YAC5B,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBACnC,IAAI,GAAG,KAAK,KAAK;oBAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACvC,CAAC;YACD,mEAAmE;YACnE,iEAAiE;YACjE,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1C,MAAM,cAAc,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,CAAC,cAAc;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEzC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBACzC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;oBACf,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC5D,CAAC;YACH,CAAC;YACD,mEAAmE;YACnE,gCAAgC;YAChC,KAAK,cAAc,CAAC;YACpB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,WAAW;YACd,OAAO,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAClD,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,mBAAmB,CAAC,CAAU,EAAE,KAAK,GAAG,EAAE;IACxD,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,eAAe,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAClC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CAAC,CAAU,EAAE,GAAc,EAAE,KAAa,EAAE,KAAa;IAC/E,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK,IAAI,KAAK,GAAG,gBAAgB;QAAE,OAAO;IAC5D,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU;YACb,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3C,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAC5C,OAAO;QACT,KAAK,WAAW;YACd,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACtD,OAAO;QACT;YACE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,OAAO;IACX,CAAC;AACH,CAAC"}

package/dist/csp-hoare/types.d.ts

@@ -0,0 +1,60 @@
+export type Event = string;
+export type Process = {
+    kind: 'stop';
+} | {
+    kind: 'skip';
+} | {
+    kind: 'prefix';
+    event: Event;
+    cont: Process;
+} | {
+    kind: 'choice';
+    left: Process;
+    right: Process;
+} | {
+    kind: 'internal';
+    left: Process;
+    right: Process;
+} | {
+    kind: 'parallel';
+    left: Process;
+    right: Process;
+    alphabet: Event[];
+} | {
+    kind: 'interleave';
+    left: Process;
+    right: Process;
+} | {
+    kind: 'sequence';
+    left: Process;
+    right: Process;
+} | {
+    kind: 'hide';
+    process: Process;
+    events: Event[];
+} | {
+    kind: 'rename';
+    process: Process;
+    mapping: Map<Event, Event>;
+} | {
+    kind: 'recursion';
+    name: string;
+    body: Process;
+} | {
+    kind: 'var';
+    name: string;
+};
+/** Una traza es una secuencia finita de eventos visibles observados. */
+export type Trace = Event[];
+/**
+ * Failure (failures-semantics): la traza `trace` es observable y, tras ella,
+ * el proceso PUEDE rehusar cualquier subconjunto de `refusal` (en alguna
+ * resolución del no-determinismo interno).
+ */
+export interface FailurePair {
+    trace: Trace;
+    refusal: Set<Event>;
+}
+/** Evento especial que marca la terminación exitosa (✓ / "tick"). */
+export declare const TICK: Event;
+//# sourceMappingURL=types.d.ts.map

package/dist/csp-hoare/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/csp-hoare/types.ts"],"names":[],"mappings":"AA0BA,MAAM,MAAM,KAAK,GAAG,MAAM,CAAC;AAE3B,MAAM,MAAM,OAAO,GACf;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACjD;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,KAAK,EAAE,CAAA;CAAE,GACtE;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,KAAK,EAAE,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;CAAE,GAChE;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAElC,wEAAwE;AACxE,MAAM,MAAM,KAAK,GAAG,KAAK,EAAE,CAAC;AAE5B;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,KAAK,CAAC;IACb,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;CACrB;AAED,qEAAqE;AACrE,eAAO,MAAM,IAAI,EAAE,KAAW,CAAC"}

package/dist/csp-hoare/types.js

@@ -0,0 +1,31 @@
+"use strict";
+// ============================================================
+// CSP Hoare — Tipos del cálculo de procesos secuenciales comunicantes
+// ============================================================
+// Comunicating Sequential Processes (Hoare 1978/1985): procesos que
+// se sincronizan mediante eventos atómicos compartidos. Diferente del
+// π-cálculo: los eventos NO transportan valores; lo que importa es la
+// ocurrencia sincronizada del nombre.
+//
+// Operadores estándar:
+//   STOP            — proceso muerto, no acepta nada.
+//   SKIP            — termina exitosamente (evento ✓ implícito).
+//   a → P           — prefijo: ejecuta el evento `a`, luego se comporta como P.
+//   P □ Q           — elección externa: el entorno decide entre los primeros
+//                     eventos ofrecidos por P y Q.
+//   P ⊓ Q           — elección interna: el proceso decide; el entorno solo
+//                     ve el resultado. Introduce no-determinismo.
+//   P |[A]| Q       — paralelo sincronizado: los eventos en A deben darse en
+//                     ambos lados simultáneamente; los demás se entrelazan.
+//   P ||| Q         — entrelazado puro (paralelo con alfabeto vacío).
+//   P ; Q           — composición secuencial: Q comienza cuando P termina (SKIP).
+//   P \ A           — ocultación: los eventos en A se vuelven internos (τ).
+//   P[f]            — renombrado funcional de eventos.
+//   μ X . P         — recursión: el proceso se reescribe a sí mismo.
+//   X               — variable de proceso (referencia a μ).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TICK = void 0;
+/** Evento especial que marca la terminación exitosa (✓ / "tick"). */
+exports.TICK = '✓';
+//# sourceMappingURL=types.js.map

package/dist/csp-hoare/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/csp-hoare/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sEAAsE;AACtE,+DAA+D;AAC/D,oEAAoE;AACpE,sEAAsE;AACtE,sEAAsE;AACtE,sCAAsC;AACtC,EAAE;AACF,uBAAuB;AACvB,sDAAsD;AACtD,iEAAiE;AACjE,gFAAgF;AAChF,6EAA6E;AAC7E,mDAAmD;AACnD,2EAA2E;AAC3E,kEAAkE;AAClE,6EAA6E;AAC7E,4EAA4E;AAC5E,sEAAsE;AACtE,kFAAkF;AAClF,4EAA4E;AAC5E,uDAAuD;AACvD,qEAAqE;AACrE,4DAA4D;AAC5D,+DAA+D;;;AA+B/D,qEAAqE;AACxD,QAAA,IAAI,GAAU,GAAG,CAAC"}

package/dist/game-theory/common-games.d.ts

@@ -0,0 +1,50 @@
+import type { NormalFormGame } from './types';
+/**
+ * Prisoner's dilemma. Estrategias: 0=cooperate, 1=defect.
+ * Pagos típicos (T > R > P > S):
+ *   T=5, R=3, P=1, S=0
+ *
+ *           C       D
+ *      C  (3,3)  (0,5)
+ *      D  (5,0)  (1,1)
+ *
+ * Único Nash: (D, D) con payoff (1, 1).
+ */
+export declare function prisonersDilemma(): NormalFormGame;
+/**
+ * Rock-Paper-Scissors (zero-sum). Estrategias: 0=R, 1=P, 2=S.
+ * Único Nash: (1/3, 1/3, 1/3) por jugador, payoff (0, 0).
+ */
+export declare function rockPaperScissors(): NormalFormGame;
+/**
+ * Battle of the sexes. Dos jugadores prefieren coordinar pero
+ * en cosas distintas. Estrategias: 0=Opera, 1=Football.
+ *
+ *           O       F
+ *      O  (2,1)  (0,0)
+ *      F  (0,0)  (1,2)
+ *
+ * Tres Nash: (O,O), (F,F), mixto.
+ */
+export declare function battleOfSexes(): NormalFormGame;
+/**
+ * Matching pennies (zero-sum). Estrategias: 0=H, 1=T.
+ *
+ *           H        T
+ *      H  ( 1,-1) (-1, 1)
+ *      T  (-1, 1) ( 1,-1)
+ *
+ * Único Nash: (1/2, 1/2).
+ */
+export declare function matchingPennies(): NormalFormGame;
+/**
+ * Coordination "stag hunt". Estrategias: 0=Stag, 1=Hare.
+ *
+ *           S       H
+ *      S  (4,4)  (0,3)
+ *      H  (3,0)  (2,2)
+ *
+ * Nash puros: (S,S) y (H,H); además uno mixto.
+ */
+export declare function stagHunt(): NormalFormGame;
+//# sourceMappingURL=common-games.d.ts.map

package/dist/game-theory/common-games.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"common-games.d.ts","sourceRoot":"","sources":["../../src/game-theory/common-games.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAG9C;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,IAAI,cAAc,CAUjD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,IAAI,cAAc,CAYlD;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,IAAI,cAAc,CAU9C;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,IAAI,cAAc,CAUhD;AAED;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,IAAI,cAAc,CAUzC"}