botmux 2.93.1 → 2.94.0

package/dist/workflows/v3/orchestrator.js

@@ -0,0 +1,417 @@
+/**
+ * v3 orchestrator — pure decision layer.
+ *
+ * Mirrors v0.2's `orchestrator.ts` pattern: a pure function maps the current
+ * run state + DAG to a list of action descriptors.  The runtime (`runtime.ts`)
+ * owns every side effect — journal/STATE writes, ephemeral-worker dispatch via
+ * `runNode`, humanGate card posting — and the per-bot/per-CLI/global
+ * concurrency caps.  Keeping the decision pure makes the critical-path
+ * semantics testable without spawning workers or touching the filesystem.
+ *
+ * MVP scope: static DAG, fail-fast.  No loops / decisions / dynamic expand
+ * (those are deferred — design Q3/§7).  Gate set is frozen at authoring time;
+ * the orchestrator never invents or skips a gate (design Q10).
+ */
+import { isLoopNode, loopInstanceId, topologicalOrder } from './dag.js';
+// ─── Decision function ──────────────────────────────────────────────────────
+/**
+ * Pure decision: given the current `state`, return every action that can be
+ * taken *now*.  The runtime applies concurrency caps by acting on a prefix of
+ * the returned dispatch actions and re-invoking on the next tick — this
+ * function intentionally returns ALL ready dispatches (it does not throttle).
+ *
+ * Ordering follows topological order so callers see deps-ready nodes first.
+ * Fail-fast: the moment any node is `failed`, the only action is
+ * `completeRunFailed` (in-flight peers are torn down by the runtime / cancel).
+ * When no dispatch is possible and nothing is pending, the run is complete.
+ */
+export function decideNext(dag, state, loops = new Map(), edges = new Map(), instances = new Map()) {
+    const order = topologicalOrder(dag);
+    const nodes = new Map(dag.nodes.map((n) => [n.id, n]));
+    // Fail-fast sweep first: a single failed node ends the run.  Pick the
+    // earliest in topo order for a deterministic `failedNodeId`.  `failed`
+    // (infrastructure, needs intervention) takes priority over `blocked`
+    // (contract failure, retryable) when both exist.  Loop body instances are
+    // swept too — only the CURRENT iteration can be non-done (a decision is
+    // only ever recorded once the whole iteration completed).
+    for (const id of order) {
+        const node = nodes.get(id);
+        for (const sweepId of [id, ...currentInstanceIds(node, loops)]) {
+            if (st(state, sweepId).status === 'failed' &&
+                (sweepId !== id || isFailureRelevant(id, dag, state, edges))) {
+                return [{ kind: 'completeRunFailed', failedNodeId: sweepId }];
+            }
+        }
+    }
+    for (const id of order) {
+        const node = nodes.get(id);
+        for (const sweepId of [id, ...currentInstanceIds(node, loops)]) {
+            if (st(state, sweepId).status === 'blocked' &&
+                (sweepId !== id || isFailureRelevant(id, dag, state, edges))) {
+                return [{ kind: 'completeRunBlocked', blockedNodeId: sweepId }];
+            }
+        }
+    }
+    const actions = [];
+    let pending = 0; // nodes not yet terminal — gates the success sweep
+    for (const id of order) {
+        const node = nodes.get(id);
+        const s = st(state, id);
+        if (isAcceptableTerminal(id, s.status, dag, state, edges))
+            continue;
+        if (isLoopNode(node)) {
+            pending++;
+            const ls = loops.get(id);
+            if (!ls) {
+                const readiness = readinessFor(node, state, edges);
+                if (readiness.kind === 'wait')
+                    continue;
+                if (readiness.kind === 'resolveEdge') {
+                    actions.push({ kind: 'resolveEdge', from: readiness.from, to: id });
+                    continue;
+                }
+                if (readiness.kind === 'skip') {
+                    actions.push({ kind: 'skipNode', nodeId: id, detail: readiness.detail });
+                    continue;
+                }
+                // Not started: deps/trigger satisfied, start the composite node.
+                actions.push({ kind: 'startLoop', loopId: id });
+                continue;
+            }
+            if (ls.iteration === 0) {
+                actions.push({ kind: 'startLoopIteration', loopId: id, iteration: 1 });
+                continue;
+            }
+            if (ls.decided) {
+                if (ls.lastDecision === 'exit') {
+                    actions.push({ kind: 'completeLoop', loopId: id, iteration: ls.iteration });
+                }
+                else if (ls.lastDecision === 'continue' ||
+                    // After an exhausted-block, a grant re-opens exactly one round.  An
+                    // exhausted loop WITHOUT a pending grant never reaches here — its
+                    // node status is 'blocked' and the sweep above already returned.
+                    (ls.lastDecision === 'exhausted' && ls.pendingGrant)) {
+                    actions.push({ kind: 'startLoopIteration', loopId: id, iteration: ls.iteration + 1 });
+                }
+                continue;
+            }
+            // Undecided current iteration: schedule the body like a mini-DAG over
+            // instance ids; once every body instance is done, ask for the decision.
+            const bodyOrder = topologicalOrder({ runId: id, nodes: node.body.nodes });
+            const bodyById = new Map(node.body.nodes.map((b) => [b.id, b]));
+            let allDone = true;
+            for (const bodyId of bodyOrder) {
+                const instId = loopInstanceId(id, ls.iteration, bodyId);
+                const bs = st(state, instId);
+                if (bs.status === 'done')
+                    continue;
+                allDone = false;
+                if (bs.status === 'running' || bs.status === 'gateWaiting')
+                    continue;
+                const bodyDef = bodyById.get(bodyId);
+                const depsOk = bodyDef.depends.every((dep) => st(state, loopInstanceId(id, ls.iteration, dep.from)).status === 'done');
+                if (!depsOk)
+                    continue;
+                actions.push({
+                    kind: 'dispatchWork',
+                    nodeId: instId,
+                    loop: { loopId: id, iteration: ls.iteration, bodyNodeId: bodyId },
+                });
+            }
+            if (allDone) {
+                actions.push({ kind: 'evaluateLoopIteration', loopId: id, iteration: ls.iteration });
+            }
+            continue;
+        }
+        // In-flight: a dispatched worker or an open gate. Nothing to emit; the
+        // node is still pending completion.
+        if (s.status === 'running' || s.status === 'gateWaiting') {
+            pending++;
+            continue;
+        }
+        // s.status === 'pending'
+        pending++;
+        const readiness = readinessFor(node, state, edges);
+        if (readiness.kind === 'wait')
+            continue;
+        if (readiness.kind === 'resolveEdge') {
+            actions.push({ kind: 'resolveEdge', from: readiness.from, to: id });
+            continue;
+        }
+        if (readiness.kind === 'skip') {
+            actions.push({ kind: 'skipNode', nodeId: id, detail: readiness.detail });
+            continue;
+        }
+        if (node.humanGate && !s.gateCleared) {
+            // The gate belongs to the instance that will run on approval — same
+            // id resolution as dispatchWork (constraint 6), so gate + work share it.
+            actions.push({ kind: 'dispatchGate', nodeId: id, instanceId: s.effectiveInstanceId ?? nextInstanceId(id, instances) });
+            continue;
+        }
+        // Every plain-node dispatch runs under a runtime instance (constraint 4 +
+        // design rule: 首派也要 #001).  decideNext — not the runtime — owns the id:
+        //   - blocked / human-ask RETRY stays in the SAME instance (constraint 5):
+        //     the node still carries `effectiveInstanceId`, so reuse it (the retry
+        //     is a new attempt INSIDE it, e.g. A#001/attempts/002).
+        //   - first dispatch (no effective) → #001; a revisit re-dispatch (supersede
+        //     cleared the effective) → next #NNN from state.instances.
+        // (loop body dispatches use loopInstanceId, handled above.)
+        const instanceId = s.effectiveInstanceId ?? nextInstanceId(id, instances);
+        actions.push({
+            kind: 'dispatchWork',
+            nodeId: id,
+            instanceId,
+            ...(readiness.omitted ? { omitted: readiness.omitted } : {}),
+        });
+        for (const loser of readiness.earlyLosers ?? []) {
+            if (canCancelLoser(loser, id, dag, state, edges)) {
+                actions.push({
+                    kind: 'cancelNode',
+                    nodeId: loser,
+                    byNodeId: id,
+                    detail: `early-release loser for "${id}"`,
+                });
+            }
+        }
+    }
+    if (actions.length === 0 && pending === 0) {
+        const sinks = findSinks(dag);
+        if (sinks.some((id) => st(state, id).status === 'done')) {
+            return [{ kind: 'completeRunSucceeded' }];
+        }
+        return [{
+                kind: 'completeRunFailed',
+                reason: 'allSinksSkipped',
+                detail: sinkOmissionDetail(sinks, state),
+            }];
+    }
+    return actions;
+}
+function readinessFor(node, state, edges) {
+    if (node.depends.length === 0)
+        return { kind: 'ready' };
+    const activities = node.depends.map((dep) => {
+        const source = st(state, dep.from);
+        if (source.status === 'done') {
+            if (!dep.when)
+                return { kind: 'active', from: dep.from };
+            const edge = edges.get(currentEdgeKey(dep.from, node.id, state));
+            if (!edge)
+                return { kind: 'unresolved', from: dep.from };
+            return edge.active
+                ? { kind: 'active', from: dep.from }
+                : { kind: 'inactive', from: dep.from, reason: 'edgeInactive' };
+        }
+        if (source.status === 'skipped')
+            return { kind: 'inactive', from: dep.from, reason: 'sourceSkipped' };
+        if (source.status === 'cancelled')
+            return { kind: 'inactive', from: dep.from, reason: 'sourceCancelled' };
+        return { kind: 'unsettled', from: dep.from };
+    });
+    const active = activities.filter((a) => a.kind === 'active').length;
+    const triggerRule = node.triggerRule ?? 'all_success';
+    const required = triggerRule === 'all_success' ? node.depends.length
+        : triggerRule === 'one_success' ? 1
+            : triggerRule.quorum;
+    if (triggerRule === 'all_success') {
+        if (activities.some((a) => a.kind === 'unsettled'))
+            return { kind: 'wait' };
+        const unresolved = firstUnresolved(activities);
+        if (unresolved)
+            return { kind: 'resolveEdge', from: unresolved.from };
+    }
+    else if (active < required) {
+        const unresolved = firstUnresolved(activities);
+        if (unresolved)
+            return { kind: 'resolveEdge', from: unresolved.from };
+    }
+    const maybe = activities.filter((a) => a.kind === 'unsettled' || a.kind === 'unresolved').length;
+    if (active >= required) {
+        const omitted = activities
+            .filter((a) => a.kind !== 'active')
+            .map((a) => ({
+            from: a.from,
+            reason: a.kind === 'inactive' ? a.reason : 'earlyRelease',
+        }));
+        const earlyLosers = activities
+            .filter((a) => a.kind === 'unsettled')
+            .map((a) => a.from);
+        return {
+            kind: 'ready',
+            ...(omitted.length > 0 ? { omitted } : {}),
+            ...(earlyLosers.length > 0 ? { earlyLosers } : {}),
+        };
+    }
+    if (active + maybe >= required)
+        return { kind: 'wait' };
+    const detail = activities
+        .map((a, idx) => {
+        const dep = node.depends[idx];
+        if (a.kind === 'active')
+            return `${dep.from}:active`;
+        if (a.kind === 'inactive')
+            return `${dep.from}:inactive(${a.reason})`;
+        return `${dep.from}:${a.kind}`;
+    })
+        .join(', ');
+    return { kind: 'skip', detail: `triggerRule=${JSON.stringify(triggerRule)} unsatisfied; ${detail}` };
+}
+function firstUnresolved(activities) {
+    return activities.find((a) => a.kind === 'unresolved');
+}
+/** The edge key for the source's CURRENT effective instance — mirrors the key
+ *  materialize stores edgeResolved under (verdict bound to SOURCE instance, per code
+ *  review).  A source revisit (`A#001`→`A#002`) reads a fresh `A#002->B`, never
+ *  the superseded `A#001->B`.  Target is keyed by nodeId (it has no instance at
+ *  edge-resolve time); a target-only revisit reusing the verdict is a known,
+ *  documented limitation. */
+function currentEdgeKey(from, to, state) {
+    const fromInst = st(state, from).effectiveInstanceId ?? from;
+    return `${fromInst}->${to}`;
+}
+/** The CURRENT iteration's expanded instance ids of a loop node (empty for
+ *  plain nodes / unstarted loops) — the sweep surface for failed/blocked. */
+function currentInstanceIds(node, loops) {
+    if (!isLoopNode(node))
+        return [];
+    const ls = loops.get(node.id);
+    if (!ls || ls.iteration === 0)
+        return [];
+    return node.body.nodes.map((b) => loopInstanceId(node.id, ls.iteration, b.id));
+}
+function isAcceptableTerminal(id, status, dag, state, edges) {
+    if (status === 'done' || status === 'skipped' || status === 'cancelled')
+        return true;
+    if (status === 'failed' || status === 'blocked')
+        return !isFailureRelevant(id, dag, state, edges);
+    return false;
+}
+function canCancelLoser(candidateId, byNodeId, dag, state, edges) {
+    const candidate = dag.nodes.find((n) => n.id === candidateId);
+    if (!candidate || isLoopNode(candidate))
+        return false;
+    const status = st(state, candidateId).status;
+    if (status !== 'pending' && status !== 'gateWaiting' && status !== 'running')
+        return false;
+    for (const downstream of downstreamsOf(candidateId, dag)) {
+        const ds = st(state, downstream.id).status;
+        if (terminalStatus(ds))
+            continue;
+        if (downstream.id === byNodeId)
+            continue;
+        if (isSatisfiedWithoutSource(downstream, candidateId, state, edges))
+            continue;
+        if (isImpossibleNow(downstream, state, edges))
+            continue;
+        return false;
+    }
+    return true;
+}
+function isFailureRelevant(failedNodeId, dag, state, edges) {
+    const downstreams = downstreamsOf(failedNodeId, dag);
+    if (downstreams.length === 0)
+        return true;
+    for (const downstream of downstreams) {
+        const ds = st(state, downstream.id).status;
+        if (terminalStatus(ds))
+            continue;
+        if (!isSatisfiedWithoutSource(downstream, failedNodeId, state, edges))
+            return true;
+    }
+    return false;
+}
+function isSatisfiedWithoutSource(node, ignoredSourceId, state, edges) {
+    const activities = node.depends
+        .filter((dep) => dep.from !== ignoredSourceId)
+        .map((dep) => edgeActivityFor(dep.from, node.id, dep.when !== undefined, state, edges));
+    const active = activities.filter((a) => a.kind === 'active').length;
+    return active >= requiredFor(node);
+}
+function isImpossibleNow(node, state, edges) {
+    const activities = node.depends.map((dep) => edgeActivityFor(dep.from, node.id, dep.when !== undefined, state, edges));
+    const active = activities.filter((a) => a.kind === 'active').length;
+    const maybe = activities.filter((a) => a.kind === 'unsettled' || a.kind === 'unresolved').length;
+    return active + maybe < requiredFor(node);
+}
+function edgeActivityFor(from, to, conditional, state, edges) {
+    const source = st(state, from);
+    if (source.status === 'done') {
+        if (!conditional)
+            return { kind: 'active', from };
+        const edge = edges.get(currentEdgeKey(from, to, state));
+        if (!edge)
+            return { kind: 'unresolved', from };
+        return edge.active
+            ? { kind: 'active', from }
+            : { kind: 'inactive', from, reason: 'edgeInactive' };
+    }
+    if (source.status === 'skipped')
+        return { kind: 'inactive', from, reason: 'sourceSkipped' };
+    if (source.status === 'cancelled')
+        return { kind: 'inactive', from, reason: 'sourceCancelled' };
+    return { kind: 'unsettled', from };
+}
+function requiredFor(node) {
+    const triggerRule = node.triggerRule ?? 'all_success';
+    return triggerRule === 'all_success' ? node.depends.length
+        : triggerRule === 'one_success' ? 1
+            : triggerRule.quorum;
+}
+function downstreamsOf(nodeId, dag) {
+    return dag.nodes.filter((n) => n.depends.some((dep) => dep.from === nodeId));
+}
+function terminalStatus(status) {
+    return status === 'done' ||
+        status === 'skipped' ||
+        status === 'cancelled' ||
+        status === 'failed' ||
+        status === 'blocked' ||
+        // A superseded INSTANCE is settled (it won't change); the DEFINITION node
+        // re-dispatches under a fresh instance, but that is tracked at the node
+        // level (effectiveInstanceId), not by this per-instance status.
+        status === 'superseded';
+}
+function sinkOmissionDetail(sinks, state) {
+    let skipped = 0;
+    let cancelled = 0;
+    for (const id of sinks) {
+        const status = st(state, id).status;
+        if (status === 'skipped')
+            skipped++;
+        if (status === 'cancelled')
+            cancelled++;
+    }
+    return `${skipped} skipped, ${cancelled} cancelled`;
+}
+/** Sink nodes — no other node depends on them.  Their products are the run's
+ *  output.  Pure helper for the runtime's success path. */
+export function findSinks(dag) {
+    const referenced = new Set();
+    for (const node of dag.nodes)
+        for (const dep of node.depends)
+            referenced.add(dep.from);
+    return dag.nodes.map((n) => n.id).filter((id) => !referenced.has(id));
+}
+function st(state, id) {
+    return state.get(id) ?? { status: 'pending' };
+}
+/** The next runtime instance id for a definition node, computed from every
+ *  instance that has EVER appeared for it (`running/done/blocked/superseded`,
+ *  per code review — not just the effective/terminal ones, else a re-dispatch
+ *  could collide with an existing `A#002`).  First dispatch (no instances) →
+ *  `#001`; a revisit re-dispatch → `#002`, … — instance is the real runtime
+ *  node, so EVERY plain-node dispatch gets one (design rule: 首派也要 #001).  Instance
+ *  ids are `<nodeId>#NNN`, zero-padded to mirror attempt `001`. */
+function nextInstanceId(nodeId, instances) {
+    const prefix = `${nodeId}#`;
+    let max = 0;
+    for (const instanceId of instances.keys()) {
+        if (!instanceId.startsWith(prefix))
+            continue;
+        const n = Number.parseInt(instanceId.slice(prefix.length), 10);
+        if (Number.isFinite(n) && n > max)
+            max = n;
+    }
+    return `${prefix}${String(max + 1).padStart(3, '0')}`;
+}
+//# sourceMappingURL=orchestrator.js.map

package/dist/workflows/v3/orchestrator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"orchestrator.js","sourceRoot":"","sources":["../../../src/workflows/v3/orchestrator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,gBAAgB,EAA2B,MAAM,UAAU,CAAC;AAoHjG,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CACxB,GAAU,EACV,KAAiB,EACjB,QAAwB,IAAI,GAAG,EAAE,EACjC,QAAwB,IAAI,GAAG,EAAE,EACjC,YAAwB,IAAI,GAAG,EAAE;IAEjC,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvD,sEAAsE;IACtE,uEAAuE;IACvE,qEAAqE;IACrE,0EAA0E;IAC1E,wEAAwE;IACxE,0DAA0D;IAC1D,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC5B,KAAK,MAAM,OAAO,IAAI,CAAC,EAAE,EAAE,GAAG,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YAC/D,IACE,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ;gBACtC,CAAC,OAAO,KAAK,EAAE,IAAI,iBAAiB,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,EAC5D,CAAC;gBACD,OAAO,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC5B,KAAK,MAAM,OAAO,IAAI,CAAC,EAAE,EAAE,GAAG,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YAC/D,IACE,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,MAAM,KAAK,SAAS;gBACvC,CAAC,OAAO,KAAK,EAAE,IAAI,iBAAiB,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,EAC5D,CAAC;gBACD,OAAO,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAe,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,mDAAmD;IAEpE,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAExB,IAAI,oBAAoB,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC;YAAE,SAAS;QAEpE,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACnD,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM;oBAAE,SAAS;gBACxC,IAAI,SAAS,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;oBACrC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACpE,SAAS;gBACX,CAAC;gBACD,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;oBACzE,SAAS;gBACX,CAAC;gBACD,iEAAiE;gBACjE,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;gBAChD,SAAS;YACX,CAAC;YACD,IAAI,EAAE,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;gBACvE,SAAS;YACX,CAAC;YACD,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;gBACf,IAAI,EAAE,CAAC,YAAY,KAAK,MAAM,EAAE,CAAC;oBAC/B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC9E,CAAC;qBAAM,IACL,EAAE,CAAC,YAAY,KAAK,UAAU;oBAC9B,oEAAoE;oBACpE,kEAAkE;oBAClE,iEAAiE;oBACjE,CAAC,EAAE,CAAC,YAAY,KAAK,WAAW,IAAI,EAAE,CAAC,YAAY,CAAC,EACpD,CAAC;oBACD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxF,CAAC;gBACD,SAAS;YACX,CAAC;YACD,sEAAsE;YACtE,wEAAwE;YACxE,MAAM,SAAS,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAChE,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;gBACxD,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7B,IAAI,EAAE,CAAC,MAAM,KAAK,MAAM;oBAAE,SAAS;gBACnC,OAAO,GAAG,KAAK,CAAC;gBAChB,IAAI,EAAE,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,CAAC,MAAM,KAAK,aAAa;oBAAE,SAAS;gBACrE,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBACtC,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAClC,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CACjF,CAAC;gBACF,IAAI,CAAC,MAAM;oBAAE,SAAS;gBACtB,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,cAAc;oBACpB,MAAM,EAAE,MAAM;oBACd,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE;iBAClE,CAAC,CAAC;YACL,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC;YACvF,CAAC;YACD,SAAS;QACX,CAAC;QAED,uEAAuE;QACvE,oCAAoC;QACpC,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;YACzD,OAAO,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QAED,yBAAyB;QACzB,OAAO,EAAE,CAAC;QACV,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACnD,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QACxC,IAAI,SAAS,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACrC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,SAAS;QACX,CAAC;QACD,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;YACzE,SAAS;QACX,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACrC,oEAAoE;YACpE,yEAAyE;YACzE,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC,mBAAmB,IAAI,cAAc,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YACvH,SAAS;QACX,CAAC;QACD,0EAA0E;QAC1E,wEAAwE;QACxE,2EAA2E;QAC3E,2EAA2E;QAC3E,4DAA4D;QAC5D,6EAA6E;QAC7E,+DAA+D;QAC/D,4DAA4D;QAC5D,MAAM,UAAU,GAAG,CAAC,CAAC,mBAAmB,IAAI,cAAc,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC1E,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,EAAE;YACV,UAAU;YACV,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D,CAAC,CAAC;QACH,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YAChD,IAAI,cAAc,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBACjD,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,YAAY;oBAClB,MAAM,EAAE,KAAK;oBACb,QAAQ,EAAE,EAAE;oBACZ,MAAM,EAAE,4BAA4B,EAAE,GAAG;iBAC1C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;YACxD,OAAO,CAAC,EAAE,IAAI,EAAE,sBAAsB,EAAE,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,CAAC;gBACN,IAAI,EAAE,mBAAmB;gBACzB,MAAM,EAAE,iBAAiB;gBACzB,MAAM,EAAE,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC;aACzC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAcD,SAAS,YAAY,CAAC,IAAY,EAAE,KAAiB,EAAE,KAAqB;IAC1E,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IACxD,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAgB,EAAE;QACxD,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;YACzD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;YACjE,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;YACzD,OAAO,IAAI,CAAC,MAAM;gBAChB,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;gBACpC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;QACtG,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;QAC1G,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;IACpE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,aAAa,CAAC;IACtD,MAAM,QAAQ,GACZ,WAAW,KAAK,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM;QACnD,CAAC,CAAC,WAAW,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC;IAEvB,IAAI,WAAW,KAAK,aAAa,EAAE,CAAC;QAClC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAC5E,MAAM,UAAU,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,IAAI,UAAU;YAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC;IACxE,CAAC;SAAM,IAAI,MAAM,GAAG,QAAQ,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,IAAI,UAAU;YAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,MAAM,CAAC;IACjG,IAAI,MAAM,IAAI,QAAQ,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,UAAU;aACvB,MAAM,CAAC,CAAC,CAAC,EAAkD,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC;aAClF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,MAAM,EAAE,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,cAAuB;SACnE,CAAC,CAAC,CAAC;QACN,MAAM,WAAW,GAAG,UAAU;aAC3B,MAAM,CAAC,CAAC,CAAC,EAAqD,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC;aACxF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO;YACL,IAAI,EAAE,OAAO;YACb,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnD,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,GAAG,KAAK,IAAI,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAExD,MAAM,MAAM,GAAG,UAAU;SACtB,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;QACd,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,GAAG,GAAG,CAAC,IAAI,SAAS,CAAC;QACrD,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;YAAE,OAAO,GAAG,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,MAAM,GAAG,CAAC;QACtE,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACjC,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,iBAAiB,MAAM,EAAE,EAAE,CAAC;AACvG,CAAC;AAED,SAAS,eAAe,CAAC,UAA0B;IACjD,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAsD,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;AAC7G,CAAC;AAED;;;;;6BAK6B;AAC7B,SAAS,cAAc,CAAC,IAAY,EAAE,EAAU,EAAE,KAAiB;IACjE,MAAM,QAAQ,GAAG,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,mBAAmB,IAAI,IAAI,CAAC;IAC7D,OAAO,GAAG,QAAQ,KAAK,EAAE,EAAE,CAAC;AAC9B,CAAC;AAED;6EAC6E;AAC7E,SAAS,kBAAkB,CAAC,IAAY,EAAE,KAAqB;IAC7D,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACjC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9B,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,SAAS,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACzC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,oBAAoB,CAC3B,EAAU,EACV,MAAoB,EACpB,GAAU,EACV,KAAiB,EACjB,KAAqB;IAErB,IAAI,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,WAAW;QAAE,OAAO,IAAI,CAAC;IACrF,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,CAAC,iBAAiB,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAClG,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,cAAc,CACrB,WAAmB,EACnB,QAAgB,EAChB,GAAU,EACV,KAAiB,EACjB,KAAqB;IAErB,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC;IAC9D,IAAI,CAAC,SAAS,IAAI,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IACtD,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,MAAM,CAAC;IAC7C,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,aAAa,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAE3F,KAAK,MAAM,UAAU,IAAI,aAAa,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,CAAC;QACzD,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;QAC3C,IAAI,cAAc,CAAC,EAAE,CAAC;YAAE,SAAS;QACjC,IAAI,UAAU,CAAC,EAAE,KAAK,QAAQ;YAAE,SAAS;QACzC,IAAI,wBAAwB,CAAC,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC;YAAE,SAAS;QAC9E,IAAI,eAAe,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,CAAC;YAAE,SAAS;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,iBAAiB,CACxB,YAAoB,EACpB,GAAU,EACV,KAAiB,EACjB,KAAqB;IAErB,MAAM,WAAW,GAAG,aAAa,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;IACrD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1C,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;QAC3C,IAAI,cAAc,CAAC,EAAE,CAAC;YAAE,SAAS;QACjC,IAAI,CAAC,wBAAwB,CAAC,UAAU,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IACrF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,wBAAwB,CAC/B,IAAY,EACZ,eAAuB,EACvB,KAAiB,EACjB,KAAqB;IAErB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO;SAC5B,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,eAAe,CAAC;SAC7C,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1F,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;IACpE,OAAO,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,eAAe,CAAC,IAAY,EAAE,KAAiB,EAAE,KAAqB;IAC7E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAC1C,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;IACpE,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,MAAM,CAAC;IACjG,OAAO,MAAM,GAAG,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;AAC5C,CAAC;AAED,SAAS,eAAe,CACtB,IAAY,EACZ,EAAU,EACV,WAAoB,EACpB,KAAiB,EACjB,KAAqB;IAErB,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/B,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW;YAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;QAC/C,OAAO,IAAI,CAAC,MAAM;YAChB,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE;YAC1B,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IACzD,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;IAC5F,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;IAChG,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;AACrC,CAAC;AAED,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,aAAa,CAAC;IACtD,OAAO,WAAW,KAAK,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM;QACxD,CAAC,CAAC,WAAW,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC;AACzB,CAAC;AAED,SAAS,aAAa,CAAC,MAAc,EAAE,GAAU;IAC/C,OAAO,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,SAAS,cAAc,CAAC,MAAoB;IAC1C,OAAO,MAAM,KAAK,MAAM;QACtB,MAAM,KAAK,SAAS;QACpB,MAAM,KAAK,WAAW;QACtB,MAAM,KAAK,QAAQ;QACnB,MAAM,KAAK,SAAS;QACpB,0EAA0E;QAC1E,wEAAwE;QACxE,gEAAgE;QAChE,MAAM,KAAK,YAAY,CAAC;AAC5B,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAe,EAAE,KAAiB;IAC5D,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,WAAW;YAAE,SAAS,EAAE,CAAC;IAC1C,CAAC;IACD,OAAO,GAAG,OAAO,aAAa,SAAS,YAAY,CAAC;AACtD,CAAC;AAED;2DAC2D;AAC3D,MAAM,UAAU,SAAS,CAAC,GAAU;IAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK;QAAE,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO;YAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvF,OAAO,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,EAAE,CAAC,KAAiB,EAAE,EAAU;IACvC,OAAO,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AAChD,CAAC;AAED;;;;;;mEAMmE;AACnE,SAAS,cAAc,CAAC,MAAc,EAAE,SAAqB;IAC3D,MAAM,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC;IAC5B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,UAAU,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;QAC1C,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,SAAS;QAC7C,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/D,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;AACxD,CAAC"}

package/dist/workflows/v3/runtime.d.ts

@@ -0,0 +1,193 @@
+/**
+ * v3 runtime — the scheduling main loop.
+ *
+ * Ties the pure pieces together against the SHARED contract:
+ *   load dag → freeze bot snapshots → init runDir →
+ *   { materialize journal → decideNext → dispatch ready work under caps →
+ *     await a settle → repeat } until terminal.
+ *
+ * Every side effect lives here (journal append, STATE checkpoint, dir layout,
+ * goal/inputs/env materialization).  The actual worker spawn (`runNode`) and
+ * manifest validation (`validateManifest`) are INJECTED — codex's
+ * `ephemeral-pool.ts` / `manifest.ts` provide them, but the runtime compiles
+ * against the contract types alone so the two halves build independently.
+ *
+ * MVP scope: static DAG, fail-fast, no retry (always `attempts/001`).  Retry
+ * (`attempts/NNN`) and richer cancel semantics are deferred — see
+ * `docs/design/2026-06-01-v3-mvp-engine-split.md`.
+ */
+import { type V3Dag, type V3LoopExitWhen, type V3Node, type V3ResultSchema } from './dag.js';
+import { type StoredEvent, type V3ErrorClass } from './journal.js';
+import { type BotSnapshot, type GoalAsk, type Manifest, type RunNode, type ValidateManifest } from './contract.js';
+/**
+ * Render the self-contained instruction file the goal-mode agent reads via
+ * `$BOTMUX_GOAL_PATH`.  The execution contract (read inputs / write products /
+ * write the manifest) lives HERE — in a file — rather than inside the `/goal`
+ * command text, because a long multi-line `/goal` argument trips Claude Code's
+ * paste-detection (the TUI folds it into a "[Pasted text]" blob and the
+ * slash-command parser never fires).  The pool's `buildGoalCommand` therefore
+ * sends only a short single-line `/goal` that points the agent at this file.
+ *
+ * Rendered from `contract.ts` constants so the manifest shape stays a single
+ * source of truth shared with codex's validator.
+ */
+export declare function renderGoalFile(goal: string, resultSchema?: V3ResultSchema, loopCtx?: {
+    loopId: string;
+    iteration: number;
+    maxIterations: number;
+}, nodeInstructions?: string): string;
+/**
+ * Map a node's failure to its terminal kind (the blocked/failed split):
+ *   - `blocked`  = semantic/contract failure — retryable via a new attempt
+ *   - `failed`   = infrastructure / human-veto / budget — needs intervention
+ *
+ * `selfReportedFail` marks the special case where the manifest is structurally
+ * VALID but declares `status:'fail'` — then the node's own `error.retryable`
+ * decides (`false` → failed; `true`/absent → blocked, the agent presumably
+ * knows a human can unblock it).
+ */
+export declare function classifyTerminal(errorClass: V3ErrorClass, opts?: {
+    selfReportedFail?: boolean;
+    retryable?: boolean;
+}): 'blocked' | 'failed';
+/**
+ * Read + validate a goal worker's `ask.json` (the runtime human-ask payload).
+ * Defensive: a missing / malformed / out-of-bounds file yields `undefined`, so a
+ * broken ask degrades to a plain blocked card rather than crashing the drive —
+ * the manifest's `error.message` still carries the question text for the human.
+ * Accepts either 2–6 concrete options or `freeText:true`.  Exported for tests.
+ */
+export declare function readGoalAsk(askPath: string): GoalAsk | undefined;
+/**
+ * Merge a node's capability override onto the bot's frozen snapshot (P2).
+ * Pure + exported for tests.  Direction is one-way by construction:
+ *   - model: node override wins (redirect, not escalation);
+ *   - disableCliBypass: sticky-true — `restricted` can SET it, nothing can
+ *     clear a bot-level restriction (`inherit` keeps whatever the bot has).
+ */
+export declare function mergeNodeCapability(snap: BotSnapshot, override: V3Node['override']): BotSnapshot;
+/** Validation outcome for an opt-in `result.json` against its node schema. */
+export interface ResultValidation {
+    ok: boolean;
+    problems?: string[];
+}
+/** Read a worker's cross-node revisit request from `result.json` (if any).  A
+ *  revisit is `{ "status": "revisit", "revisitTo": "<ancestor>", "reason"? }`.
+ *  Absent result.json / non-revisit status → `{ ok:true }` (no request).  A
+ *  malformed revisit (missing/blank revisitTo, non-string reason) → `ok:false`
+ *  so the runtime blocks it as resultInvalid.  The ancestor membership check
+ *  (toNodeId ∈ node.revisitTo) is the caller's (it has the node). */
+/** Two-tier revisit budget check (anti-infinite-loop): a source→target pair may
+ *  revisit `DEFAULT_REVISIT_BUDGET_PER_PAIR` times, and the whole run
+ *  `DEFAULT_REVISIT_BUDGET_PER_RUN` times, each extendable by a
+ *  `revisitBudgetGranted` event.  Counts revisits ALREADY made; returns
+ *  `{ok:false, tier, detail}` when this next revisit would exceed a tier —
+ *  `tier` tells the grant card which scope to extend (菲菲 review). */
+export declare function revisitBudgetStatus(events: StoredEvent[], sourceNodeId: string, toNodeId: string): {
+    ok: true;
+} | {
+    ok: false;
+    tier: 'pair' | 'run';
+    detail: string;
+};
+export declare function readRevisitRequest(manifest: Manifest, outputDir: string): {
+    ok: true;
+    request?: {
+        toNodeId: string;
+        reason?: string;
+    };
+} | {
+    ok: false;
+    problems: string[];
+};
+/**
+ * Validate a `result.json` against the node's (already dag-validated) result
+ * schema subset.  Top-level types only — see `V3ResultSchema`.  Undeclared
+ * extra properties are allowed (JSON-Schema default).
+ */
+export declare function validateResult(filePath: string, schema: V3ResultSchema): ResultValidation;
+/**
+ * Evaluate a (dag-validated) loop exit predicate against the observed result
+ * field.  Pure + exported for tests.  Type mismatches simply don't match —
+ * validateDag already guarantees the field is declared/required with a
+ * compatible type, so a mismatch here means the result was tampered with
+ * post-validation; not-matching (→ continue/exhausted) is the safe answer.
+ */
+export declare function matchLoopExitWhen(when: V3LoopExitWhen, value: unknown): boolean;
+/**
+ * Compute the attemptId the NEXT dispatch of `nodeId` must use, from the
+ * journal: an unconsumed `nodeRetryRequested` reservation wins (retry intent
+ * is authoritative for the redrive); otherwise max(seen)+1 — which is 001 for
+ * a first dispatch.  Dispatch events are the authority for "seen"; a
+ * reservation is consumed by a later `nodeDispatched` with the same number.
+ */
+export declare function nextAttemptIdFor(events: StoredEvent[], key: string): string;
+/** Latest dispatched attemptId for a dispatch `key` (the `previousAttemptId` a
+ *  retry entrypoint must reference).  `key` is an instance (`A#001`), a loop
+ *  body expansion, or a legacy nodeId — matched by `(instanceId ?? nodeId)` so
+ *  a retry stays inside the same instance.  Undefined when never dispatched. */
+export declare function latestAttemptIdFor(events: StoredEvent[], key: string): string | undefined;
+export interface V3RuntimeDeps {
+    /** Spawn an ephemeral worker for one goal node (codex's pool). */
+    runNode: RunNode;
+    /** Validate a node's manifest after the worker exits (codex's manifest.ts). */
+    validateManifest: ValidateManifest;
+    /** Freeze a node's bot spawn config at run start.  Given `node.bot` (may be
+     *  undefined → the run's default bot), returns the snapshot persisted in the
+     *  runDir and threaded through `runNode` (never re-resolved mid-run). */
+    resolveBotSnapshot: (botId: string | undefined) => BotSnapshot;
+    /** Resolve a humanGate.  Required only if the DAG declares any gate; the
+     *  runtime throws if a gate is hit without a handler.  (Wired by
+     *  `human-gate.ts` post-milestone.) */
+    resolveGate?: (req: {
+        nodeId: string;
+        prompt: string;
+        waitId: string;
+        runDir: string;
+    }) => Promise<{
+        resolution: 'approved' | 'rejected';
+        by: string;
+        selected?: string;
+    }>;
+}
+export interface V3RuntimeOptions {
+    /** The run lives in `${baseDir}/${dag.runId}`. */
+    baseDir: string;
+    /** Gate handling model. `blocking` keeps the CLI/dev y/N path; `suspend`
+     *  writes the pending wait and returns `awaitingGate` for a daemon/card layer
+     *  to resolve and re-drive from disk. */
+    gateMode?: 'blocking' | 'suspend';
+    /** Concurrency caps (codex's three-layer cap; conservative defaults). */
+    globalConcurrency?: number;
+    perBotConcurrency?: number;
+    perCliConcurrency?: number;
+    cancelSignal?: AbortSignal;
+}
+export interface V3PendingGate {
+    nodeId: string;
+    waitId: string;
+    prompt: string;
+    options: string[];
+    approveOptions: string[];
+    approvers: string[];
+}
+export type V3RunOutcome = {
+    reason: 'terminal';
+    runStatus: 'succeeded' | 'failed' | 'blocked';
+    failedNodeId?: string;
+    blockedNodeId?: string;
+    failureReason?: 'allSinksSkipped';
+    failureDetail?: string;
+    runDir: string;
+} | {
+    reason: 'awaitingGate';
+    pendingWaits: V3PendingGate[];
+    runDir: string;
+};
+/**
+ * Run a validated DAG to terminal.  Resumable: if `journal.ndjson` already has
+ * events (daemon restart), the loop picks up from the materialized state
+ * instead of re-running completed nodes.
+ */
+export declare function runWorkflow(dag: V3Dag, deps: V3RuntimeDeps, opts: V3RuntimeOptions): Promise<V3RunOutcome>;
+//# sourceMappingURL=runtime.d.ts.map

package/dist/workflows/v3/runtime.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"runtime.d.ts","sourceRoot":"","sources":["../../../src/workflows/v3/runtime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAKH,OAAO,EAOL,KAAK,KAAK,EAEV,KAAK,cAAc,EAEnB,KAAK,MAAM,EACX,KAAK,cAAc,EACpB,MAAM,UAAU,CAAC;AAElB,OAAO,EAA4B,KAAK,WAAW,EAAE,KAAK,YAAY,EAAkB,MAAM,cAAc,CAAC;AAG7G,OAAO,EASL,KAAK,WAAW,EAChB,KAAK,OAAO,EAEZ,KAAK,QAAQ,EACb,KAAK,OAAO,EAEZ,KAAK,gBAAgB,EACtB,MAAM,eAAe,CAAC;AAIvB;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,MAAM,EACZ,YAAY,CAAC,EAAE,cAAc,EAC7B,OAAO,CAAC,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAA;CAAE,EACtE,gBAAgB,CAAC,EAAE,MAAM,GACxB,MAAM,CAiFR;AAID;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,YAAY,EACxB,IAAI,CAAC,EAAE;IAAE,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAA;CAAE,GACzD,SAAS,GAAG,QAAQ,CAYtB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAsBhE;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,WAAW,EACjB,QAAQ,EAAE,MAAM,CAAC,UAAU,CAAC,GAC3B,WAAW,CASb;AAED,8EAA8E;AAC9E,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,OAAO,CAAC;IACZ,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;CACrB;AAED;;;;;qEAKqE;AACrE;;;;;qEAKqE;AACrE,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,WAAW,EAAE,EACrB,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,MAAM,GACf;IAAE,EAAE,EAAE,IAAI,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAuBpE;AAED,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,QAAQ,EAClB,SAAS,EAAE,MAAM,GAChB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,CAAC,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAAE,CA4BnG;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,GAAG,gBAAgB,CAqCzF;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAS/E;AAWD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAuB3E;AAED;;;gFAGgF;AAChF,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAMzF;AAID,MAAM,WAAW,aAAa;IAC5B,kEAAkE;IAClE,OAAO,EAAE,OAAO,CAAC;IACjB,+EAA+E;IAC/E,gBAAgB,EAAE,gBAAgB,CAAC;IACnC;;6EAEyE;IACzE,kBAAkB,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,KAAK,WAAW,CAAC;IAC/D;;2CAEuC;IACvC,WAAW,CAAC,EAAE,CAAC,GAAG,EAAE;QAClB,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;KAChB,KAAK,OAAO,CAAC;QAAE,UAAU,EAAE,UAAU,GAAG,UAAU,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACvF;AAED,MAAM,WAAW,gBAAgB;IAC/B,kDAAkD;IAClD,OAAO,EAAE,MAAM,CAAC;IAChB;;6CAEyC;IACzC,QAAQ,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC;IAClC,yEAAyE;IACzE,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,YAAY,CAAC,EAAE,WAAW,CAAC;CAC5B;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,MAAM,MAAM,YAAY,GACpB;IACE,MAAM,EAAE,UAAU,CAAC;IAGnB,SAAS,EAAE,WAAW,GAAG,QAAQ,GAAG,SAAS,CAAC;IAC9C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,iBAAiB,CAAC;IAClC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;CAChB,GACD;IAAE,MAAM,EAAE,cAAc,CAAC;IAAC,YAAY,EAAE,aAAa,EAAE,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAI9E;;;;GAIG;AACH,wBAAsB,WAAW,CAC/B,GAAG,EAAE,KAAK,EACV,IAAI,EAAE,aAAa,EACnB,IAAI,EAAE,gBAAgB,GACrB,OAAO,CAAC,YAAY,CAAC,CAi8BvB"}