@inbrowser/agent 0.0.0-placeholder → 0.2.0

package/dist/metrics.d.ts

@@ -0,0 +1,38 @@
+/**
+ * `MetricsCollector` implementation — pricing tables + cost
+ * derivation in one place. Pure functions; no I/O.
+ *
+ * Pricing is per-million-token USD figures. When the provider
+ * reports a cost (OpenRouter's `x-cost` header), the collector
+ * skips estimation and marks `costEstimated: false`. When the
+ * model isn't in the pricing table, cost is set to 0 with
+ * `costEstimated: true`.
+ *
+ * Update pricing rows below when providers revise rates — there's
+ * no API to introspect them.
+ */
+import type { TurnMetrics } from './types/llm.js';
+import type { MetricsCollector, RecordTurnInput } from './types/metrics.js';
+interface PricingRow {
+    /** USD per million input tokens. */
+    input: number;
+    /** USD per million output tokens. */
+    output: number;
+    /** USD per million cached input tokens (when cache-hit). */
+    cacheRead: number;
+}
+/**
+ * Look up a pricing row. Returns undefined when the model isn't
+ * priced — caller skips the cost field rather than fabricating one.
+ */
+export declare function findPricing(llmId: string, model: string): PricingRow | undefined;
+/**
+ * Derive a `TurnMetrics` value from one turn's raw usage. Pure
+ * function — used by both the collector below and direct callers
+ * that don't need session-level aggregation.
+ */
+export declare function computeTurnMetrics(input: RecordTurnInput): TurnMetrics;
+/** Build a stateful `MetricsCollector` for one session. */
+export declare function createMetricsCollector(): MetricsCollector;
+export {};
+//# sourceMappingURL=metrics.d.ts.map

package/dist/metrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.d.ts","sourceRoot":"","sources":["../src/metrics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAiB,MAAM,oBAAoB,CAAC;AAE3F,UAAU,UAAU;IAClB,oCAAoC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,qCAAqC;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,4DAA4D;IAC5D,SAAS,EAAE,MAAM,CAAC;CACnB;AAeD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,CAEhF;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,eAAe,GAAG,WAAW,CA8CtE;AAED,2DAA2D;AAC3D,wBAAgB,sBAAsB,IAAI,gBAAgB,CAqCzD"}

package/dist/metrics.js

@@ -0,0 +1,123 @@
+/**
+ * `MetricsCollector` implementation — pricing tables + cost
+ * derivation in one place. Pure functions; no I/O.
+ *
+ * Pricing is per-million-token USD figures. When the provider
+ * reports a cost (OpenRouter's `x-cost` header), the collector
+ * skips estimation and marks `costEstimated: false`. When the
+ * model isn't in the pricing table, cost is set to 0 with
+ * `costEstimated: true`.
+ *
+ * Update pricing rows below when providers revise rates — there's
+ * no API to introspect them.
+ */
+/**
+ * Per-(provider, model) pricing table. Keys are `${llmId}:${model}`
+ * to avoid collisions when two providers ship a same-named model.
+ */
+const PRICING = {
+    'gemini:gemini-3.1-pro-preview': { input: 2.5, output: 20.0, cacheRead: 0.625 },
+    'gemini:gemini-3-flash-preview': { input: 0.5, output: 4.0, cacheRead: 0.125 },
+    'gemini:gemini-3.1-flash-lite': { input: 0.15, output: 0.6, cacheRead: 0.0375 },
+    // OpenRouter quotes cost on the response — we don't need a row.
+    // Ollama is local — no cost.
+    // Nano is on-device — no cost.
+};
+/**
+ * Look up a pricing row. Returns undefined when the model isn't
+ * priced — caller skips the cost field rather than fabricating one.
+ */
+export function findPricing(llmId, model) {
+    return PRICING[`${llmId}:${model}`];
+}
+/**
+ * Derive a `TurnMetrics` value from one turn's raw usage. Pure
+ * function — used by both the collector below and direct callers
+ * that don't need session-level aggregation.
+ */
+export function computeTurnMetrics(input) {
+    const { llmId, model, rawUsage, isByok } = input;
+    const tokensCached = rawUsage.cachedTokens ?? 0;
+    const tokensReasoning = rawUsage.reasoningTokens ?? 0;
+    // Provider reported cost directly (OpenRouter): trust it.
+    if (typeof rawUsage.costUsd === 'number') {
+        return {
+            tokensIn: rawUsage.promptTokens,
+            tokensOut: rawUsage.completionTokens,
+            tokensCached,
+            tokensReasoning,
+            costUsd: rawUsage.costUsd,
+            costEstimated: false,
+            isByok,
+        };
+    }
+    // Estimate from the table.
+    const row = findPricing(llmId, model);
+    if (!row) {
+        return {
+            tokensIn: rawUsage.promptTokens,
+            tokensOut: rawUsage.completionTokens,
+            tokensCached,
+            tokensReasoning,
+            costUsd: 0,
+            costEstimated: true,
+            isByok,
+        };
+    }
+    // Math: cached tokens get the cache rate; the rest of the prompt
+    // gets the standard input rate; output tokens (which include
+    // reasoning per most providers' billing) get the output rate.
+    const billedInput = Math.max(0, rawUsage.promptTokens - tokensCached);
+    const costUsd = (billedInput * row.input) / 1_000_000 +
+        (tokensCached * row.cacheRead) / 1_000_000 +
+        (rawUsage.completionTokens * row.output) / 1_000_000;
+    return {
+        tokensIn: rawUsage.promptTokens,
+        tokensOut: rawUsage.completionTokens,
+        tokensCached,
+        tokensReasoning,
+        costUsd,
+        costEstimated: true,
+        isByok,
+    };
+}
+/** Build a stateful `MetricsCollector` for one session. */
+export function createMetricsCollector() {
+    let totals = {
+        tokensTotal: 0,
+        tokensIn: 0,
+        tokensOut: 0,
+        tokensCached: 0,
+        tokensReasoning: 0,
+        costUsdTotal: 0,
+        turnCount: 0,
+    };
+    return {
+        recordTurn(input) {
+            const m = computeTurnMetrics(input);
+            totals = {
+                tokensTotal: totals.tokensTotal + m.tokensIn + m.tokensOut,
+                tokensIn: totals.tokensIn + m.tokensIn,
+                tokensOut: totals.tokensOut + m.tokensOut,
+                tokensCached: totals.tokensCached + m.tokensCached,
+                tokensReasoning: totals.tokensReasoning + m.tokensReasoning,
+                costUsdTotal: totals.costUsdTotal + m.costUsd,
+                turnCount: totals.turnCount + 1,
+            };
+            return m;
+        },
+        totals: () => ({ ...totals }),
+        reset() {
+            totals = {
+                tokensTotal: 0,
+                tokensIn: 0,
+                tokensOut: 0,
+                tokensCached: 0,
+                tokensReasoning: 0,
+                costUsdTotal: 0,
+                turnCount: 0,
+            };
+        },
+    };
+}
+//# sourceMappingURL=metrics.js.map

package/dist/metrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.js","sourceRoot":"","sources":["../src/metrics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAcH;;;GAGG;AACH,MAAM,OAAO,GAA+B;IAC1C,+BAA+B,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE;IAC/E,+BAA+B,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE;IAC9E,8BAA8B,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE;IAC/E,gEAAgE;IAChE,6BAA6B;IAC7B,+BAA+B;CAChC,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa,EAAE,KAAa;IACtD,OAAO,OAAO,CAAC,GAAG,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;AACtC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAsB;IACvD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IACjD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,IAAI,CAAC,CAAC;IAChD,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe,IAAI,CAAC,CAAC;IACtD,0DAA0D;IAC1D,IAAI,OAAO,QAAQ,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;QACzC,OAAO;YACL,QAAQ,EAAE,QAAQ,CAAC,YAAY;YAC/B,SAAS,EAAE,QAAQ,CAAC,gBAAgB;YACpC,YAAY;YACZ,eAAe;YACf,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,aAAa,EAAE,KAAK;YACpB,MAAM;SACP,CAAC;IACJ,CAAC;IACD,2BAA2B;IAC3B,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,OAAO;YACL,QAAQ,EAAE,QAAQ,CAAC,YAAY;YAC/B,SAAS,EAAE,QAAQ,CAAC,gBAAgB;YACpC,YAAY;YACZ,eAAe;YACf,OAAO,EAAE,CAAC;YACV,aAAa,EAAE,IAAI;YACnB,MAAM;SACP,CAAC;IACJ,CAAC;IACD,iEAAiE;IACjE,6DAA6D;IAC7D,8DAA8D;IAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,YAAY,GAAG,YAAY,CAAC,CAAC;IACtE,MAAM,OAAO,GACX,CAAC,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS;QACrC,CAAC,YAAY,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,SAAS;QAC1C,CAAC,QAAQ,CAAC,gBAAgB,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IACvD,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,YAAY;QAC/B,SAAS,EAAE,QAAQ,CAAC,gBAAgB;QACpC,YAAY;QACZ,eAAe;QACf,OAAO;QACP,aAAa,EAAE,IAAI;QACnB,MAAM;KACP,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,sBAAsB;IACpC,IAAI,MAAM,GAAkB;QAC1B,WAAW,EAAE,CAAC;QACd,QAAQ,EAAE,CAAC;QACX,SAAS,EAAE,CAAC;QACZ,YAAY,EAAE,CAAC;QACf,eAAe,EAAE,CAAC;QAClB,YAAY,EAAE,CAAC;QACf,SAAS,EAAE,CAAC;KACb,CAAC;IACF,OAAO;QACL,UAAU,CAAC,KAAK;YACd,MAAM,CAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;YACpC,MAAM,GAAG;gBACP,WAAW,EAAE,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,SAAS;gBAC1D,QAAQ,EAAE,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ;gBACtC,SAAS,EAAE,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;gBACzC,YAAY,EAAE,MAAM,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY;gBAClD,eAAe,EAAE,MAAM,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe;gBAC3D,YAAY,EAAE,MAAM,CAAC,YAAY,GAAG,CAAC,CAAC,OAAO;gBAC7C,SAAS,EAAE,MAAM,CAAC,SAAS,GAAG,CAAC;aAChC,CAAC;YACF,OAAO,CAAC,CAAC;QACX,CAAC;QACD,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC;QAC7B,KAAK;YACH,MAAM,GAAG;gBACP,WAAW,EAAE,CAAC;gBACd,QAAQ,EAAE,CAAC;gBACX,SAAS,EAAE,CAAC;gBACZ,YAAY,EAAE,CAAC;gBACf,eAAe,EAAE,CAAC;gBAClB,YAAY,EAAE,CAAC;gBACf,SAAS,EAAE,CAAC;aACb,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/node.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Node-only entry point.
+ *
+ * The event log writer imports `node:fs` / `node:os` at module init
+ * for append-only NDJSON logging to disk. It lives here so the
+ * browser-facing root entry (`@inbrowser/agent`) stays free of Node
+ * builtins.
+ *
+ * Consumers running in Node (the CLI, the MCP server, sdk's agent
+ * definitions, integration tests) import from `@inbrowser/agent/node`.
+ * Browser consumers (playground) use the root entry, which exposes
+ * the browser-safe events helpers (`wrapMutating`, `replayEvents`,
+ * codec utilities) directly without going through `events/index.js`.
+ *
+ * Other Node-only files in this package (`metrics/runs`, `agents/
+ * firestore`, the CLI commands) have no external consumers via the
+ * public barrel today, so they stay reachable via relative paths
+ * within the package.
+ */
+export { openEventLog, defaultProjectLogDir } from './events/log.js';
+export { generateEventId, buildRollbackEvent, HOST_AGENT_ID, EventTooLargeError, DEFAULT_MAX_EVENT_BYTES, } from './events/log-core.js';
+export { FixtureLoadError, loadFixture, loadFixtures } from './eval/load-node.js';
+//# sourceMappingURL=node.d.ts.map

package/dist/node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACrE,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,aAAa,EACb,kBAAkB,EAClB,uBAAuB,GACxB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/node.js

@@ -0,0 +1,23 @@
+/**
+ * Node-only entry point.
+ *
+ * The event log writer imports `node:fs` / `node:os` at module init
+ * for append-only NDJSON logging to disk. It lives here so the
+ * browser-facing root entry (`@inbrowser/agent`) stays free of Node
+ * builtins.
+ *
+ * Consumers running in Node (the CLI, the MCP server, sdk's agent
+ * definitions, integration tests) import from `@inbrowser/agent/node`.
+ * Browser consumers (playground) use the root entry, which exposes
+ * the browser-safe events helpers (`wrapMutating`, `replayEvents`,
+ * codec utilities) directly without going through `events/index.js`.
+ *
+ * Other Node-only files in this package (`metrics/runs`, `agents/
+ * firestore`, the CLI commands) have no external consumers via the
+ * public barrel today, so they stay reachable via relative paths
+ * within the package.
+ */
+export { openEventLog, defaultProjectLogDir } from './events/log.js';
+export { generateEventId, buildRollbackEvent, HOST_AGENT_ID, EventTooLargeError, DEFAULT_MAX_EVENT_BYTES, } from './events/log-core.js';
+export { FixtureLoadError, loadFixture, loadFixtures } from './eval/load-node.js';
+//# sourceMappingURL=node.js.map

package/dist/node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.js","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACrE,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,aAAa,EACb,kBAAkB,EAClB,uBAAuB,GACxB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/planner-executor.d.ts

@@ -0,0 +1,132 @@
+/**
+ * `createPlannerExecutorStrategy()` — phase five `AgentStrategy`.
+ *
+ * Takes a user prompt, routes it to a skill from the catalog,
+ * materializes that skill's prescribed plan, and executes each step
+ * with a bounded ReAct sub-loop. Scratch is dropped between steps:
+ * the next step starts fresh with a short summary of each prior step,
+ * not the full message history. The working window stays flat across
+ * a long workflow, which is the hypothesis this strategy exists to
+ * test.
+ *
+ * Lifecycle:
+ *
+ *   1. Route the prompt against the catalog. When the router returns
+ *      no match, either fall back to `createReactLoopStrategy()`
+ *      (default) or yield an `error` event (when `fallbackToReact`
+ *      is `false`).
+ *   2. Look up the catalog entry. If the router returned a name not
+ *      in the catalog (shouldn't happen for a catalog-derived router,
+ *      defensive), behave as the no-match case.
+ *   3. Emit a `custom` event `'plan_started'` with the skill name and
+ *      the step ids.
+ *   4. For each step, in order:
+ *        a. Emit `custom` `'step_started'` with `{ stepId,
+ *           description }`.
+ *        b. Build a step-scoped system prompt that wraps the original
+ *           system prompt with a suffix naming the step ("You are on
+ *           step X of Y: <description>. Prior step summaries follow.")
+ *           and one synthetic user message per prior step's summary.
+ *        c. Drive a bounded `createReactLoopStrategy({ maxTurns })`
+ *           sub-loop. Every inner `text`, `thinking`, `tool_call`,
+ *           `tool_result`, and `turn_complete` event is streamed
+ *           through unchanged so the host's UI continues working.
+ *        d. After the sub-loop completes, capture the concatenated
+ *           assistant text the inner loop emitted this step, call
+ *           `summarizeStep(stepId, transcript)` to get a short
+ *           summary, and emit `custom` `'step_completed'` with
+ *           `{ stepId, summary }`.
+ *   5. Emit `custom` `'plan_completed'` and return.
+ *
+ * Tracer: per-step inner loops generate their own `llm_request` /
+ * `llm_response` / `turn_dispatch_complete` trace events. The trace's
+ * `requestId` carries a `${turnId}#${stepId}#${iteration}` shape so
+ * the eval harness can read per-step iteration counts off the trace
+ * without changes.
+ *
+ * What is intentionally NOT done in v1:
+ *
+ *   - Per-step verifier gating. The catalog's `verifier?` is read but
+ *     not enforced. The executor always advances to the next step.
+ *     Gating progression on verifier outcomes is a follow-up.
+ *   - Per-step tool subsetting. Every step sees the same dispatcher
+ *     and the same tool list. A future enhancement can scope tools by
+ *     step.
+ *   - Smarter step summarization. The default `summarizeStep` is
+ *     `transcript.slice(0, 400)` — dumb truncation. Override with a
+ *     real summarizer if needed.
+ */
+import type { SkillName } from './eval/fixture.js';
+import type { SkillCatalog } from './skill-catalog.js';
+import type { AgentStrategy } from './types/strategy.js';
+/**
+ * Minimal router contract this strategy depends on. The sibling
+ * `strategy/skill-router` branch ships a concrete `routeSkill`
+ * function with the same signature; until that lands, callers can
+ * pass any function with this shape, and this module's
+ * `defaultKeywordRouter` does a trivial substring scan against the
+ * catalog's `triggerHints` so the strategy works end-to-end on its
+ * own.
+ *
+ * Once the router branch merges, downstream code can replace the
+ * default by passing `router: routeSkill` (or by wrapping it) into
+ * the options. No change is needed in this file.
+ */
+export interface SkillRouterMatch {
+    /** The chosen skill. Must be a name present in the catalog. */
+    skill: SkillName;
+    /** Higher is better. Consumers may surface it; the strategy uses
+     *  only its presence (non-null match) to gate execution. */
+    score?: number;
+}
+export interface SkillRouterDecision {
+    /** The top match, or `null` when no entry crossed the router's
+     *  internal threshold. */
+    match: SkillRouterMatch | null;
+}
+export type SkillRouter = (prompt: string, options?: {
+    catalog?: SkillCatalog;
+}) => SkillRouterDecision;
+export interface PlannerExecutorOptions {
+    /** Catalog override. Defaults to `SKILL_CATALOG`. */
+    catalog?: SkillCatalog;
+    /** Per-step bounded turn budget for the inner ReAct sub-loop.
+     *  Default 4. */
+    stepMaxTurns?: number;
+    /** When the router returns no match, fall back to
+     *  `createReactLoopStrategy()` for the rest of the turn. Default
+     *  `true`. When `false`, the strategy yields an `error` event and
+     *  returns. */
+    fallbackToReact?: boolean;
+    /**
+     * Summarize a single step's transcript (concatenated assistant
+     * text) into a short string that seeds the next step's context.
+     * Default: dumb truncation to 400 characters.
+     */
+    summarizeStep?: (stepId: string, transcript: string) => string;
+    /**
+     * Router function. Defaults to a keyword scan against the catalog's
+     * `triggerHints`. The sibling `strategy/skill-router` branch ships
+     * a more sophisticated `routeSkill`; once that lands, callers can
+     * pass it here.
+     */
+    router?: SkillRouter;
+}
+/**
+ * Default keyword router. Scores each catalog entry by counting
+ * `triggerHints` substring hits in the lowercased prompt and returns
+ * the top scorer (or `null` when every entry scored zero). Catalog
+ * order breaks ties — the same ordering the sibling
+ * `strategy/skill-router` branch documents for its production router.
+ *
+ * This is intentionally tiny. The point is that the executor can run
+ * end-to-end (and be unit-tested) without depending on the router
+ * branch landing first.
+ */
+export declare const defaultKeywordRouter: SkillRouter;
+/**
+ * Build the planner-executor strategy. Returns an `AgentStrategy`
+ * with `id: 'planner-executor'`.
+ */
+export declare function createPlannerExecutorStrategy(options?: PlannerExecutorOptions): AgentStrategy;
+//# sourceMappingURL=planner-executor.d.ts.map

package/dist/planner-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-executor.d.ts","sourceRoot":"","sources":["../src/planner-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyDG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAEnD,OAAO,KAAK,EAAE,YAAY,EAAqB,MAAM,oBAAoB,CAAC;AAG1E,OAAO,KAAK,EAAE,aAAa,EAAmC,MAAM,qBAAqB,CAAC;AAE1F;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,gBAAgB;IAC/B,+DAA+D;IAC/D,KAAK,EAAE,SAAS,CAAC;IACjB;gEAC4D;IAC5D,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,mBAAmB;IAClC;8BAC0B;IAC1B,KAAK,EAAE,gBAAgB,GAAG,IAAI,CAAC;CAChC;AAED,MAAM,MAAM,WAAW,GAAG,CACxB,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE;IAAE,OAAO,CAAC,EAAE,YAAY,CAAA;CAAE,KACjC,mBAAmB,CAAC;AAEzB,MAAM,WAAW,sBAAsB;IACrC,qDAAqD;IACrD,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB;qBACiB;IACjB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;;mBAGe;IACf,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B;;;;OAIG;IACH,aAAa,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,KAAK,MAAM,CAAC;IAC/D;;;;;OAKG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAgBD;;;;;;;;;;GAUG;AACH,eAAO,MAAM,oBAAoB,EAAE,WAoBlC,CAAC;AAEF;;;GAGG;AACH,wBAAgB,6BAA6B,CAAC,OAAO,GAAE,sBAA2B,GAAG,aAAa,CA8KjG"}

package/dist/planner-executor.js

@@ -0,0 +1,274 @@
+/**
+ * `createPlannerExecutorStrategy()` — phase five `AgentStrategy`.
+ *
+ * Takes a user prompt, routes it to a skill from the catalog,
+ * materializes that skill's prescribed plan, and executes each step
+ * with a bounded ReAct sub-loop. Scratch is dropped between steps:
+ * the next step starts fresh with a short summary of each prior step,
+ * not the full message history. The working window stays flat across
+ * a long workflow, which is the hypothesis this strategy exists to
+ * test.
+ *
+ * Lifecycle:
+ *
+ *   1. Route the prompt against the catalog. When the router returns
+ *      no match, either fall back to `createReactLoopStrategy()`
+ *      (default) or yield an `error` event (when `fallbackToReact`
+ *      is `false`).
+ *   2. Look up the catalog entry. If the router returned a name not
+ *      in the catalog (shouldn't happen for a catalog-derived router,
+ *      defensive), behave as the no-match case.
+ *   3. Emit a `custom` event `'plan_started'` with the skill name and
+ *      the step ids.
+ *   4. For each step, in order:
+ *        a. Emit `custom` `'step_started'` with `{ stepId,
+ *           description }`.
+ *        b. Build a step-scoped system prompt that wraps the original
+ *           system prompt with a suffix naming the step ("You are on
+ *           step X of Y: <description>. Prior step summaries follow.")
+ *           and one synthetic user message per prior step's summary.
+ *        c. Drive a bounded `createReactLoopStrategy({ maxTurns })`
+ *           sub-loop. Every inner `text`, `thinking`, `tool_call`,
+ *           `tool_result`, and `turn_complete` event is streamed
+ *           through unchanged so the host's UI continues working.
+ *        d. After the sub-loop completes, capture the concatenated
+ *           assistant text the inner loop emitted this step, call
+ *           `summarizeStep(stepId, transcript)` to get a short
+ *           summary, and emit `custom` `'step_completed'` with
+ *           `{ stepId, summary }`.
+ *   5. Emit `custom` `'plan_completed'` and return.
+ *
+ * Tracer: per-step inner loops generate their own `llm_request` /
+ * `llm_response` / `turn_dispatch_complete` trace events. The trace's
+ * `requestId` carries a `${turnId}#${stepId}#${iteration}` shape so
+ * the eval harness can read per-step iteration counts off the trace
+ * without changes.
+ *
+ * What is intentionally NOT done in v1:
+ *
+ *   - Per-step verifier gating. The catalog's `verifier?` is read but
+ *     not enforced. The executor always advances to the next step.
+ *     Gating progression on verifier outcomes is a follow-up.
+ *   - Per-step tool subsetting. Every step sees the same dispatcher
+ *     and the same tool list. A future enhancement can scope tools by
+ *     step.
+ *   - Smarter step summarization. The default `summarizeStep` is
+ *     `transcript.slice(0, 400)` — dumb truncation. Override with a
+ *     real summarizer if needed.
+ */
+import { SKILL_CATALOG, getSkillEntry } from './skill-catalog.js';
+import { createReactLoopStrategy } from './strategy.js';
+const DEFAULT_STEP_MAX_TURNS = 4;
+const DEFAULT_SUMMARY_LIMIT = 400;
+/**
+ * Default step summarizer. Trims and truncates. Sufficient for v1 —
+ * the next step's context only needs a rough recall of what the prior
+ * step concluded, not a faithful reproduction.
+ */
+function defaultSummarizeStep(_stepId, transcript) {
+    const trimmed = transcript.trim();
+    if (trimmed.length <= DEFAULT_SUMMARY_LIMIT)
+        return trimmed;
+    return `${trimmed.slice(0, DEFAULT_SUMMARY_LIMIT)}…`;
+}
+/**
+ * Default keyword router. Scores each catalog entry by counting
+ * `triggerHints` substring hits in the lowercased prompt and returns
+ * the top scorer (or `null` when every entry scored zero). Catalog
+ * order breaks ties — the same ordering the sibling
+ * `strategy/skill-router` branch documents for its production router.
+ *
+ * This is intentionally tiny. The point is that the executor can run
+ * end-to-end (and be unit-tested) without depending on the router
+ * branch landing first.
+ */
+export const defaultKeywordRouter = (prompt, options) => {
+    const catalog = options?.catalog ?? SKILL_CATALOG;
+    if (!prompt)
+        return { match: null };
+    const lowered = prompt.toLowerCase();
+    let best = null;
+    for (const entry of catalog) {
+        let score = 0;
+        for (const hint of entry.triggerHints) {
+            if (hint.length === 0)
+                continue;
+            if (lowered.includes(hint.toLowerCase()))
+                score += 1;
+        }
+        if (score > 0 && (best === null || score > best.score)) {
+            best = { entry, score };
+        }
+    }
+    if (best === null)
+        return { match: null };
+    return { match: { skill: best.entry.name, score: best.score } };
+};
+/**
+ * Build the planner-executor strategy. Returns an `AgentStrategy`
+ * with `id: 'planner-executor'`.
+ */
+export function createPlannerExecutorStrategy(options = {}) {
+    const catalog = options.catalog ?? SKILL_CATALOG;
+    const stepMaxTurns = options.stepMaxTurns ?? DEFAULT_STEP_MAX_TURNS;
+    const fallbackToReact = options.fallbackToReact !== false;
+    const summarizeStep = options.summarizeStep ?? defaultSummarizeStep;
+    const router = options.router ?? defaultKeywordRouter;
+    return {
+        id: 'planner-executor',
+        async *run(input, signal) {
+            if (signal.aborted) {
+                yield { kind: 'error', message: 'aborted' };
+                return;
+            }
+            // 1. Route the prompt. When a custom catalog was supplied, look
+            // the entry up in that catalog directly so the executor honors
+            // the override; otherwise the production `SKILL_CATALOG` table
+            // is consulted via `getSkillEntry`.
+            const decision = router(input.prompt, { catalog });
+            const lookupEntry = (skill) => options.catalog === undefined
+                ? getSkillEntry(skill)
+                : options.catalog.find((entry) => entry.name === skill);
+            const matchedEntry = decision.match === null ? undefined : lookupEntry(decision.match.skill);
+            // 2. No match or match-but-not-in-catalog → fallback path.
+            if (decision.match === null || matchedEntry === undefined) {
+                if (!fallbackToReact) {
+                    yield {
+                        kind: 'error',
+                        message: 'planner-executor: no skill matched and fallbackToReact is disabled',
+                    };
+                    return;
+                }
+                // Delegate the rest of the turn to a plain ReAct sub-strategy.
+                // Stream every event through unchanged.
+                const sub = createReactLoopStrategy();
+                for await (const ev of sub.run(input, signal)) {
+                    yield ev;
+                }
+                return;
+            }
+            // 3. Plan started.
+            const plan = matchedEntry.steps;
+            yield {
+                kind: 'custom',
+                name: 'plan_started',
+                data: {
+                    skill: matchedEntry.name,
+                    plan: plan.map((s) => s.id),
+                },
+            };
+            const stepSummaries = [];
+            const turnIdForReq = input.turnId ?? 'turn-anon';
+            // 4. Walk the steps.
+            for (let stepIndex = 0; stepIndex < plan.length; stepIndex++) {
+                if (signal.aborted) {
+                    yield { kind: 'error', message: 'aborted' };
+                    return;
+                }
+                const step = plan[stepIndex];
+                yield {
+                    kind: 'custom',
+                    name: 'step_started',
+                    data: { stepId: step.id, description: step.description },
+                };
+                // 4b. Build the step-scoped system prompt + a fresh history
+                // composed of one synthetic user message per prior step's
+                // summary. The next step sees ONLY these summaries plus the
+                // original user prompt — never the raw scratch from prior
+                // sub-loops. This is the context-discipline mechanism.
+                const stepSystemPrompt = buildStepSystemPrompt(input.systemPrompt, step.id, step.description, stepIndex, plan.length, stepSummaries.length > 0);
+                const stepHistory = stepSummaries.map((s, i) => ({
+                    id: `step-summary-${i}`,
+                    role: 'user',
+                    text: `[Prior step '${s.stepId}' summary] ${s.summary}`,
+                }));
+                // 4c. Drive a bounded ReAct sub-loop. The sub-loop's tracer is
+                // the OUTER tracer wrapped so that emitted `llm_request` /
+                // `llm_response` / `turn_dispatch_complete` events carry a
+                // step-scoped `requestId` prefix; the wrapping rewrites the
+                // request id from `${turnId}#${iteration}` to
+                // `${turnId}#${stepId}#${iteration}` so the eval harness can
+                // read per-step iteration counts off the trace.
+                const subStrategy = createReactLoopStrategy({ maxTurns: stepMaxTurns });
+                const stepInput = {
+                    ...input,
+                    history: stepHistory,
+                    systemPrompt: stepSystemPrompt,
+                    turnId: `${turnIdForReq}#${step.id}`,
+                    ...(input.tracer ? { tracer: { emit: input.tracer.emit.bind(input.tracer) } } : {}),
+                };
+                let stepAssistantText = '';
+                let stepExceededBudget = false;
+                for await (const ev of subStrategy.run(stepInput, signal)) {
+                    if (ev.kind === 'text') {
+                        stepAssistantText += ev.chunk;
+                    }
+                    // Stream every event from the inner loop through unchanged.
+                    // The host sees normal `text`/`thinking`/`tool_call`/
+                    // `tool_result`/`turn_complete` events as if a single ReAct
+                    // loop were running — plus the planner-executor's own
+                    // `custom` plan events around them.
+                    if (ev.kind === 'error') {
+                        // A sub-loop maxTurns exhaustion (the message format from
+                        // `createReactLoopStrategy` is `react-loop: exceeded
+                        // maxTurns (N) without settling`) is treated as a soft
+                        // step failure: we surface it via a `custom` event so the
+                        // host can react, then advance to the next step with
+                        // whatever text the step produced. Hitting the budget on
+                        // one step shouldn't kill the plan — the next step's
+                        // summary chain can still seed downstream work.
+                        //
+                        // All other errors (abort, provider failure, etc.)
+                        // propagate and stop the plan.
+                        if (/exceeded maxTurns/i.test(ev.message)) {
+                            stepExceededBudget = true;
+                            yield {
+                                kind: 'custom',
+                                name: 'step_budget_exhausted',
+                                data: { stepId: step.id, message: ev.message },
+                            };
+                            break;
+                        }
+                        yield ev;
+                        return;
+                    }
+                    yield ev;
+                }
+                // Silence the lint: a fresh `let` that the planner-executor
+                // tracks for follow-up branches that may surface it on the
+                // emitted `step_completed` event. v1 keeps it private.
+                void stepExceededBudget;
+                // 4d. Summarize and record.
+                const summary = summarizeStep(step.id, stepAssistantText);
+                stepSummaries.push({
+                    stepId: step.id,
+                    description: step.description,
+                    summary,
+                });
+                yield {
+                    kind: 'custom',
+                    name: 'step_completed',
+                    data: { stepId: step.id, summary },
+                };
+            }
+            // 5. Plan complete.
+            yield {
+                kind: 'custom',
+                name: 'plan_completed',
+                data: {
+                    skill: matchedEntry.name,
+                    steps: stepSummaries.map((s) => ({ stepId: s.stepId, summary: s.summary })),
+                },
+            };
+        },
+    };
+}
+function buildStepSystemPrompt(basePrompt, stepId, stepDescription, stepIndex, stepCount, hasPriorSummaries) {
+    // 1-indexed for human-readable display ("step 3 of 5").
+    const displayIndex = stepIndex + 1;
+    const suffix = hasPriorSummaries
+        ? `You are on step ${displayIndex} of ${stepCount} (id: ${stepId}): ${stepDescription}. Prior step summaries follow as user messages — treat them as facts you have already established, not as new requests.`
+        : `You are on step ${displayIndex} of ${stepCount} (id: ${stepId}): ${stepDescription}. This is the first step.`;
+    return `${basePrompt}\n\n${suffix}`;
+}
+//# sourceMappingURL=planner-executor.js.map

package/dist/planner-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-executor.js","sourceRoot":"","sources":["../src/planner-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyDG;AAGH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAElE,OAAO,EAAE,uBAAuB,EAAE,MAAM,eAAe,CAAC;AA8DxD,MAAM,sBAAsB,GAAG,CAAC,CAAC;AACjC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAElC;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,OAAe,EAAE,UAAkB;IAC/D,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC;IAClC,IAAI,OAAO,CAAC,MAAM,IAAI,qBAAqB;QAAE,OAAO,OAAO,CAAC;IAC5D,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,qBAAqB,CAAC,GAAG,CAAC;AACvD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAgB,CAC/C,MAAc,EACd,OAAoC,EACf,EAAE;IACvB,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,aAAa,CAAC;IAClD,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACpC,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACrC,IAAI,IAAI,GAAuD,IAAI,CAAC;IACpE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAChC,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAC1C,OAAO,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;AAClE,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,6BAA6B,CAAC,UAAkC,EAAE;IAChF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,aAAa,CAAC;IACjD,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,sBAAsB,CAAC;IACpE,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,KAAK,KAAK,CAAC;IAC1D,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,oBAAoB,CAAC;IACpE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,oBAAoB,CAAC;IAEtD,OAAO;QACL,EAAE,EAAE,kBAAkB;QACtB,KAAK,CAAC,CAAC,GAAG,CAAC,KAAuB,EAAE,MAAmB;YACrD,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;gBAC5C,OAAO;YACT,CAAC;YAED,gEAAgE;YAChE,+DAA+D;YAC/D,+DAA+D;YAC/D,oCAAoC;YACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;YACnD,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAE,EAAE,CACvC,OAAO,CAAC,OAAO,KAAK,SAAS;gBAC3B,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC;gBACtB,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC;YAC5D,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAE7F,2DAA2D;YAC3D,IAAI,QAAQ,CAAC,KAAK,KAAK,IAAI,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC1D,IAAI,CAAC,eAAe,EAAE,CAAC;oBACrB,MAAM;wBACJ,IAAI,EAAE,OAAO;wBACb,OAAO,EAAE,oEAAoE;qBAC9E,CAAC;oBACF,OAAO;gBACT,CAAC;gBACD,+DAA+D;gBAC/D,wCAAwC;gBACxC,MAAM,GAAG,GAAG,uBAAuB,EAAE,CAAC;gBACtC,IAAI,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;oBAC9C,MAAM,EAAE,CAAC;gBACX,CAAC;gBACD,OAAO;YACT,CAAC;YAED,mBAAmB;YACnB,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC;YAChC,MAAM;gBACJ,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,cAAc;gBACpB,IAAI,EAAE;oBACJ,KAAK,EAAE,YAAY,CAAC,IAAI;oBACxB,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC5B;aACF,CAAC;YAEF,MAAM,aAAa,GAA+D,EAAE,CAAC;YACrF,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,IAAI,WAAW,CAAC;YAEjD,qBAAqB;YACrB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC;gBAC7D,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;oBAC5C,OAAO;gBACT,CAAC;gBAED,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAE,CAAC;gBAC9B,MAAM;oBACJ,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,cAAc;oBACpB,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE;iBACzD,CAAC;gBAEF,4DAA4D;gBAC5D,0DAA0D;gBAC1D,4DAA4D;gBAC5D,0DAA0D;gBAC1D,uDAAuD;gBACvD,MAAM,gBAAgB,GAAG,qBAAqB,CAC5C,KAAK,CAAC,YAAY,EAClB,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,WAAW,EAChB,SAAS,EACT,IAAI,CAAC,MAAM,EACX,aAAa,CAAC,MAAM,GAAG,CAAC,CACzB,CAAC;gBACF,MAAM,WAAW,GAAkB,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;oBAC9D,EAAE,EAAE,gBAAgB,CAAC,EAAE;oBACvB,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,gBAAgB,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,OAAO,EAAE;iBACxD,CAAC,CAAC,CAAC;gBAEJ,+DAA+D;gBAC/D,2DAA2D;gBAC3D,2DAA2D;gBAC3D,4DAA4D;gBAC5D,8CAA8C;gBAC9C,6DAA6D;gBAC7D,gDAAgD;gBAChD,MAAM,WAAW,GAAG,uBAAuB,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,CAAC;gBACxE,MAAM,SAAS,GAAqB;oBAClC,GAAG,KAAK;oBACR,OAAO,EAAE,WAAW;oBACpB,YAAY,EAAE,gBAAgB;oBAC9B,MAAM,EAAE,GAAG,YAAY,IAAI,IAAI,CAAC,EAAE,EAAE;oBACpC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACpF,CAAC;gBAEF,IAAI,iBAAiB,GAAG,EAAE,CAAC;gBAC3B,IAAI,kBAAkB,GAAG,KAAK,CAAC;gBAC/B,IAAI,KAAK,EAAE,MAAM,EAAE,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC;oBAC1D,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;wBACvB,iBAAiB,IAAI,EAAE,CAAC,KAAK,CAAC;oBAChC,CAAC;oBACD,4DAA4D;oBAC5D,sDAAsD;oBACtD,4DAA4D;oBAC5D,sDAAsD;oBACtD,oCAAoC;oBACpC,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;wBACxB,0DAA0D;wBAC1D,qDAAqD;wBACrD,uDAAuD;wBACvD,0DAA0D;wBAC1D,qDAAqD;wBACrD,yDAAyD;wBACzD,qDAAqD;wBACrD,gDAAgD;wBAChD,EAAE;wBACF,mDAAmD;wBACnD,+BAA+B;wBAC/B,IAAI,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;4BAC1C,kBAAkB,GAAG,IAAI,CAAC;4BAC1B,MAAM;gCACJ,IAAI,EAAE,QAAQ;gCACd,IAAI,EAAE,uBAAuB;gCAC7B,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE;6BAC/C,CAAC;4BACF,MAAM;wBACR,CAAC;wBACD,MAAM,EAAE,CAAC;wBACT,OAAO;oBACT,CAAC;oBACD,MAAM,EAAE,CAAC;gBACX,CAAC;gBACD,4DAA4D;gBAC5D,2DAA2D;gBAC3D,uDAAuD;gBACvD,KAAK,kBAAkB,CAAC;gBAExB,4BAA4B;gBAC5B,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;gBAC1D,aAAa,CAAC,IAAI,CAAC;oBACjB,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,OAAO;iBACR,CAAC,CAAC;gBACH,MAAM;oBACJ,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,gBAAgB;oBACtB,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE;iBACnC,CAAC;YACJ,CAAC;YAED,oBAAoB;YACpB,MAAM;gBACJ,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,gBAAgB;gBACtB,IAAI,EAAE;oBACJ,KAAK,EAAE,YAAY,CAAC,IAAI;oBACxB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;iBAC5E;aACF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAC5B,UAAkB,EAClB,MAAc,EACd,eAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,iBAA0B;IAE1B,wDAAwD;IACxD,MAAM,YAAY,GAAG,SAAS,GAAG,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,iBAAiB;QAC9B,CAAC,CAAC,mBAAmB,YAAY,OAAO,SAAS,SAAS,MAAM,MAAM,eAAe,yHAAyH;QAC9M,CAAC,CAAC,mBAAmB,YAAY,OAAO,SAAS,SAAS,MAAM,MAAM,eAAe,2BAA2B,CAAC;IACnH,OAAO,GAAG,UAAU,OAAO,MAAM,EAAE,CAAC;AACtC,CAAC"}