@mupt-ai/dari-router 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,100 @@
+# Dari Router Core
+
+`@mupt-ai/dari-router` puts multiple LLMs behind one endpoint. Declare models, provide a routing policy, and expose one web-standard handler for OpenAI Chat Completions and Anthropic Messages requests.
+
+```text
+OpenAI or Anthropic request
+        │
+        ▼
+ Normalize and filter models
+        │
+        ▼
+    Your policy chooses
+        │
+        ▼
+ Pi AI or a custom executor
+        │
+        ▼
+ Response in the input protocol
+```
+
+Pi AI is the bundled provider-client runtime. Custom executors replace it per-model when you need another SDK or transport. `createRouter` also ships pluggable lease storage, lifecycle hooks (`onSelection`, `onCompletion`, `onStreamClose`, `onError`), and opt-in cross-model fallback. [Dari's managed platform](https://docs.dari.dev/router/overview) provides a hosted endpoint with credentials, telemetry, billing, retries, and speculative routing.
+
+## Install
+
+```bash
+bun add @mupt-ai/dari-router
+# or
+npm install @mupt-ai/dari-router
+```
+
+Requires Node.js 22.19+ or Bun. Source lives at [mupt-ai/dari-router-core](https://github.com/mupt-ai/dari-router-core), mirrored from the Dari monorepo.
+
+## Quick Start
+
+From a checkout of this repository:
+
+```bash
+bun install --frozen-lockfile
+bun run example                  # credential-free, in-memory executor
+OPENAI_API_KEY=... bun run example:pi  # real OpenAI call through Pi
+```
+
+## Minimal Router
+
+```ts
+import { createPiRuntime, createRouter } from "@mupt-ai/dari-router";
+
+const pi = await createPiRuntime({ apiKey: process.env.OPENAI_API_KEY! });
+const router = createRouter({
+  runtime: pi,
+  models: [pi.model("openai/gpt-5.4-mini"), pi.model("openai/gpt-5.4")],
+  policy: ({ request, candidates }) => {
+    const long = JSON.stringify(request.items).length > 500;
+    return {
+      model: candidates.find((c) => c.id === (long ? "openai/gpt-5.4" : "openai/gpt-5.4-mini"))?.id ?? candidates[0]!.id,
+      reason: long ? "Longer requests use the larger model." : "Short requests use the fast model.",
+    };
+  },
+});
+
+Bun.serve({ port: 3000, fetch: router.fetch });
+```
+
+```bash
+curl http://localhost:3000/v1/chat/completions \
+  -H 'Content-Type: application/json' \
+  -d '{"model": "my-router", "messages": [{"role": "user", "content": "Explain cache locality."}]}'
+```
+
+The response includes `dari_routing` (`requested_model`, `selected_model`, `reasoning_effort`, `reason` — the same shape the managed Dari platform emits) and `X-Router-Selected-Model`. The incoming `model` is a caller-facing name — it doesn't force the policy's choice. The same handler also accepts `/v1/messages` for Anthropic.
+
+## Documentation
+
+- [Overview](https://docs.dari.dev/framework/overview)
+- [Quickstart](https://docs.dari.dev/framework/quickstart)
+- [Models](https://docs.dari.dev/framework/models)
+- [Policies](https://docs.dari.dev/framework/policies)
+- [Pi Runtime](https://docs.dari.dev/framework/pi-runtime)
+- [Custom Executors](https://docs.dari.dev/framework/custom-executors)
+- [Protocols And Streaming](https://docs.dari.dev/framework/protocols-and-streaming)
+- [Auto Router](https://docs.dari.dev/framework/auto-router)
+- [Speculative Routing](https://docs.dari.dev/framework/speculative-routing)
+- [Decision Pipeline](https://docs.dari.dev/framework/decision-pipeline)
+
+## Development
+
+```bash
+bun install --frozen-lockfile
+bun run typecheck
+bun test
+bun run build
+bun run example:dari-policy
+bun run example:decision-pipeline
+```
+
+ESM package. Uses web-standard `Request`, `Response`, streams, and `AbortSignal`. Bun serves `router.fetch` directly; Node.js 22.19+ needs a Request/Response adapter.
+
+## License
+
+Apache-2.0. See [LICENSE](LICENSE).

package/dist/anonymous_actions.d.ts

@@ -0,0 +1,55 @@
+import { type JsonObject, type JsonValue } from "./json.js";
+import type { TurnCostProjection } from "./types.js";
+export type Rng = () => number;
+export type AnonymousActionCandidate = {
+    model: string;
+    reasoningEffort: string;
+};
+export type AnonymousActionSlot = {
+    action: string;
+    candidate: AnonymousActionCandidate;
+};
+export type AnonymousSelectorMessage = {
+    role: "system" | "user";
+    content: string;
+};
+export type AnonymousPolicyPrompt = {
+    messages: [system: AnonymousSelectorMessage, user: AnonymousSelectorMessage];
+    actions: string[];
+};
+export type AnonymousActionSelection = {
+    action: string;
+    candidate: AnonymousActionCandidate;
+    turns?: number;
+};
+export type AnonymousEvalScore = {
+    action: string;
+    rank: number;
+    rank_total: number;
+    z_score: number;
+};
+export type AnonymousEvalCard = {
+    name: string;
+    description: string | null;
+    scores: AnonymousEvalScore[];
+};
+export type AnonymousActionCost = {
+    action: string;
+    projections: TurnCostProjection[];
+};
+export type AnonymousSelectorInput = {
+    candidate_actions: Array<{
+        action: string;
+    }>;
+    imported_evals: AnonymousEvalCard[];
+    previous_action: {
+        action: string;
+    } | null;
+    cost_estimates: AnonymousActionCost[];
+    messages: JsonValue;
+};
+export declare function assignAnonymousActions(candidates: readonly AnonymousActionCandidate[], rng: Rng): AnonymousActionSlot[];
+export declare function anonymizeSelectorInput(selectorInput: JsonObject, slots: readonly AnonymousActionSlot[]): AnonymousSelectorInput;
+export declare function buildAnonymousPolicyPrompt(anonymousSelectorInput: AnonymousSelectorInput, slots: readonly AnonymousActionSlot[]): AnonymousPolicyPrompt;
+export declare function formatAnonymousPolicyInput(input: AnonymousSelectorInput): string;
+export declare function parseAnonymousActionSelection(completion: string, slots: readonly AnonymousActionSlot[], leaseTurns?: readonly number[]): AnonymousActionSelection;

package/dist/anonymous_actions.js

@@ -0,0 +1,277 @@
+// Anonymous candidate-action selector protocol. Candidates are shuffled into
+// anonymous action slots ("A", "B", ..., "AA", ...) and every model-identifying
+// field in the selector input is replaced by its slot, so a trained policy
+// cannot memorize model names or list positions. This is the canonical
+// open-weight selector protocol used by Dari's SLM routing strategy; the
+// named-candidate protocol in selector_input.ts/prompts.ts remains available
+// for custom routers that use a general-purpose LLM selector.
+import { ANONYMOUS_ACTION_SYSTEM_PROMPT } from "./prompts.js";
+import { jsonRecord, jsonValue, requiredString, } from "./json.js";
+// Shuffles candidates into spreadsheet-style action slots A..Z, AA..AZ, ...
+// with the injected rng.
+export function assignAnonymousActions(candidates, rng) {
+    if (candidates.length < 2) {
+        throw new Error(`Anonymous action routing requires at least two candidates, got ${candidates.length}`);
+    }
+    const keys = new Set();
+    for (const candidate of candidates) {
+        const key = candidateKey(candidate.model, candidate.reasoningEffort);
+        if (keys.has(key))
+            throw new Error(`Duplicate anonymous action candidate ${key}`);
+        keys.add(key);
+    }
+    return shuffled(candidates, rng).map((candidate, index) => ({
+        action: actionForIndex(index),
+        candidate,
+    }));
+}
+function actionForIndex(index) {
+    let remaining = index;
+    let action = "";
+    do {
+        action = String.fromCharCode("A".charCodeAt(0) + (remaining % 26)) + action;
+        remaining = Math.floor(remaining / 26) - 1;
+    } while (remaining >= 0);
+    return action;
+}
+// Rewrites a named-candidate selector input (see selector_input.ts) into its
+// anonymous-action form. The input must reference exactly the candidates in
+// `slots`; any mismatch is an error rather than a silent partial rewrite.
+export function anonymizeSelectorInput(selectorInput, slots) {
+    const input = jsonRecord(structuredClone(selectorInput), "selector input");
+    const byCandidate = new Map(slots.map((slot) => [candidateKey(slot.candidate.model, slot.candidate.reasoningEffort), slot.action]));
+    assertSelectorCandidates(input["candidate_pairs"], byCandidate);
+    return {
+        candidate_actions: slots.map((slot) => ({ action: slot.action })),
+        imported_evals: anonymizeEvals(input["imported_evals"], byCandidate),
+        previous_action: anonymizePreviousDecision(input["previous_decision"], byCandidate),
+        cost_estimates: anonymizeCosts(input["cost_estimates"], byCandidate),
+        messages: jsonValue(input["messages"], "selector input messages"),
+    };
+}
+export function buildAnonymousPolicyPrompt(anonymousSelectorInput, slots) {
+    return {
+        messages: [
+            { role: "system", content: ANONYMOUS_ACTION_SYSTEM_PROMPT },
+            { role: "user", content: formatAnonymousPolicyInput(anonymousSelectorInput) },
+        ],
+        actions: slots.map((slot) => slot.action),
+    };
+}
+// Renders the anonymous selector input as sectioned text rather than raw JSON.
+// One block per action carries that action's benchmark standing and its
+// projected cost, so the policy compares like against like instead of
+// re-deriving comparisons from scores on incomparable scales and six cost
+// fields. How to read those blocks lives in ANONYMOUS_ACTION_SYSTEM_PROMPT,
+// keeping this message pure data. The conversation goes last: it is the only
+// section that grows turn over turn, so keeping it at the end preserves the
+// shared prefix.
+export function formatAnonymousPolicyInput(input) {
+    const sections = [
+        ...(input.imported_evals.length > 0
+            ? [section("benchmarks", input.imported_evals.map(glossaryLine).join("\n"))]
+            : []),
+        section("candidates", input.candidate_actions
+            .map((candidate) => candidateBlock(candidate.action, input))
+            .join("\n\n")),
+        ...(input.previous_action === null
+            ? []
+            : [section("previous_action", input.previous_action.action)]),
+        section("conversation", JSON.stringify(input.messages)),
+    ];
+    return sections.join("\n\n");
+}
+function section(name, body) {
+    return `<${name}>\n${body}\n</${name}>`;
+}
+function candidateBlock(action, input) {
+    const cost = input.cost_estimates.find((entry) => entry.action === action);
+    const lines = [`## Action ${action}`];
+    if (cost !== undefined)
+        lines.push(costLine(cost));
+    for (const card of input.imported_evals) {
+        const score = card.scores.find((entry) => entry.action === action);
+        if (score !== undefined) {
+            lines.push(`- ${card.name}: Rank ${score.rank}/${score.rank_total}, Z ${signed(score.z_score)}`);
+        }
+    }
+    return lines.join("\n");
+}
+// One line, one unit, the same horizons for every action.
+function costLine(cost) {
+    const horizons = cost.projections.map((projection) => `${projection.projected_turns} turn${projection.projected_turns === 1 ? "" : "s"} ${usd(projection.total_cost_usd)}`);
+    return `- Cost: ${horizons.join(", ")}`;
+}
+function signed(value) {
+    return value >= 0 ? `+${value.toFixed(2)}` : value.toFixed(2);
+}
+function usd(value) {
+    if (value >= 1)
+        return `$${value.toFixed(2)}`;
+    const trimmed = value.toPrecision(3).replace(/0+$/, "").replace(/\.$/, "");
+    return `$${trimmed}`;
+}
+function glossaryLine(card) {
+    return card.description === null ? `- ${card.name}` : `- ${card.name}: ${card.description}`;
+}
+function previousAction(value) {
+    if (value === null || value === undefined)
+        return null;
+    return requiredString(jsonRecord(value, "anonymous previous_action")["action"], "anonymous previous_action.action");
+}
+function isRecordValue(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+// Parses a policy completion against the permutation's slots. Without a lease
+// menu the exact shape is {"action":"B"}; with one it is
+// {"action":"B","turns":10} and turns must be on the menu.
+export function parseAnonymousActionSelection(completion, slots, leaseTurns) {
+    let parsed;
+    try {
+        parsed = JSON.parse(completion);
+    }
+    catch {
+        throw new Error("Anonymous action completion is not valid JSON");
+    }
+    const record = jsonRecord(parsed, "anonymous action completion");
+    const keys = Object.keys(record);
+    // An empty menu means the caller routes one turn at a time, same as no menu.
+    const offeredLeaseTurns = leaseTurns !== undefined && leaseTurns.length > 0 ? leaseTurns : undefined;
+    const expected = offeredLeaseTurns === undefined ? ["action"] : ["action", "turns"];
+    if (keys.length !== expected.length || expected.some((key, i) => keys[i] !== key)) {
+        throw new Error(`Anonymous action completion must contain exactly {${expected
+            .map((key) => `"${key}":...`)
+            .join(",")}}`);
+    }
+    const action = record["action"];
+    if (typeof action !== "string") {
+        throw new Error("Anonymous action completion action must be a string");
+    }
+    const slot = slots.find((candidate) => candidate.action === action);
+    if (slot === undefined) {
+        throw new Error(`Anonymous action completion selected unavailable action ${action}`);
+    }
+    if (offeredLeaseTurns === undefined)
+        return { action, candidate: slot.candidate };
+    const turns = record["turns"];
+    if (typeof turns !== "number" || !offeredLeaseTurns.includes(turns)) {
+        throw new Error(`Anonymous action completion turns must be one of ${offeredLeaseTurns.join(", ")}`);
+    }
+    return { action, candidate: slot.candidate, turns };
+}
+// Fisher-Yates copy, drawing from the end, matching d3-array's shuffler so an
+// injected rng reproduces permutations recorded by harnesses that used d3.
+function shuffled(items, rng) {
+    const array = [...items];
+    let m = array.length;
+    while (m) {
+        const i = (rng() * m--) | 0;
+        const t = array[m];
+        array[m] = array[i];
+        array[i] = t;
+    }
+    return array;
+}
+function assertSelectorCandidates(value, byCandidate) {
+    if (!Array.isArray(value)) {
+        throw new Error("Selector input candidate_pairs must be an array");
+    }
+    const selectorKeys = new Set(value.map((candidate, index) => {
+        const record = jsonRecord(candidate, `selector candidate[${index}]`);
+        return candidateKey(requiredString(record["model"], `selector candidate[${index}].model`), requiredString(record["thinking_level"], `selector candidate[${index}].thinking_level`));
+    }));
+    if (selectorKeys.size !== byCandidate.size || [...byCandidate.keys()].some((key) => !selectorKeys.has(key))) {
+        throw new Error("Routing and selector candidates do not match");
+    }
+}
+function anonymizeEvals(value, byCandidate) {
+    if (!Array.isArray(value)) {
+        throw new Error("Selector input imported_evals must be an array");
+    }
+    return value.map((entry, evalIndex) => {
+        const card = jsonRecord(entry, `selector eval[${evalIndex}]`);
+        const scores = card["scores"];
+        if (!Array.isArray(scores)) {
+            throw new Error(`selector eval[${evalIndex}].scores must be an array`);
+        }
+        return {
+            name: requiredString(card["name"], `selector eval[${evalIndex}].name`),
+            description: typeof card["description"] === "string" ? card["description"] : null,
+            // Explicit allowlist: notes and any future field can name the model.
+            scores: scores.map((entryScore, scoreIndex) => {
+                const label = `selector eval[${evalIndex}].scores[${scoreIndex}]`;
+                const score = jsonRecord(entryScore, label);
+                return {
+                    action: actionForCandidate(byCandidate, requiredString(score["model_id"], `${label}.model_id`), requiredString(score["thinking_level"], `${label}.thinking_level`)),
+                    rank: requiredNumber(score["rank"], `${label}.rank`),
+                    rank_total: requiredNumber(score["rank_total"], `${label}.rank_total`),
+                    z_score: requiredNumber(score["z_score"], `${label}.z_score`),
+                };
+            }),
+        };
+    });
+}
+function anonymizePreviousDecision(value, byCandidate) {
+    if (value === null || value === undefined)
+        return null;
+    const previous = jsonRecord(value, "selector previous_decision");
+    const model = requiredString(previous["model"], "selector previous_decision.model");
+    const thinkingLevel = requiredString(previous["thinking_level"], "selector previous_decision.thinking_level");
+    return {
+        action: actionForCandidate(byCandidate, model, thinkingLevel),
+    };
+}
+function anonymizeCosts(value, byCandidate) {
+    if (value === null || value === undefined)
+        return [];
+    if (!Array.isArray(value)) {
+        throw new Error("Selector input cost_estimates must be an array or null");
+    }
+    // Only the loop projections survive. The per-request fields the prompt does
+    // not show would be dead weight, and assumed_reasoning_effort names the
+    // candidate's thinking level, which the protocol exists to hide.
+    return value.flatMap((entry, index) => {
+        const label = `selector cost_estimates[${index}]`;
+        const cost = jsonRecord(entry, label);
+        const action = actionForCandidate(byCandidate, requiredString(cost["model"], `${label}.model`), requiredString(cost["reasoning_effort"], `${label}.reasoning_effort`));
+        const fixedTurn = cost["fixed_turn_cost_estimate"];
+        if (fixedTurn === null || fixedTurn === undefined)
+            return [];
+        if (!isRecordValue(fixedTurn) || !Array.isArray(fixedTurn["projections"])) {
+            // A present estimate without projections is the pre-projection schema.
+            // Reject it loudly: silently dropping it would show "Cost: unavailable"
+            // for a candidate whose cost the caller thinks it supplied.
+            throw new Error(`${label}.fixed_turn_cost_estimate must carry a projections array`);
+        }
+        return [
+            {
+                action,
+                projections: fixedTurn["projections"].map((projection, projectionIndex) => {
+                    const projectionLabel = `${label}.fixed_turn_cost_estimate.projections[${projectionIndex}]`;
+                    const record = jsonRecord(projection, projectionLabel);
+                    return {
+                        projected_turns: requiredNumber(record["projected_turns"], `${projectionLabel}.projected_turns`),
+                        total_cost_usd: requiredNumber(record["total_cost_usd"], `${projectionLabel}.total_cost_usd`),
+                    };
+                }),
+            },
+        ];
+    });
+}
+function requiredNumber(value, label) {
+    if (typeof value !== "number" || !Number.isFinite(value)) {
+        throw new Error(`${label} must be a finite number`);
+    }
+    return value;
+}
+function actionForCandidate(byCandidate, model, thinkingLevel) {
+    const action = byCandidate.get(candidateKey(model, thinkingLevel));
+    if (action === undefined) {
+        throw new Error(`Selector field references unavailable candidate ${model}/${thinkingLevel}`);
+    }
+    return action;
+}
+function candidateKey(model, thinkingLevel) {
+    return `${model}\u0000${thinkingLevel}`;
+}
+//# sourceMappingURL=anonymous_actions.js.map

package/dist/anonymous_actions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"anonymous_actions.js","sourceRoot":"","sources":["../src/anonymous_actions.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,gFAAgF;AAChF,2EAA2E;AAC3E,uEAAuE;AACvE,yEAAyE;AACzE,6EAA6E;AAC7E,8DAA8D;AAE9D,OAAO,EAAE,8BAA8B,EAAE,MAAM,cAAc,CAAC;AAC9D,OAAO,EACL,UAAU,EACV,SAAS,EACT,cAAc,GAGf,MAAM,WAAW,CAAC;AAiEnB,4EAA4E;AAC5E,yBAAyB;AACzB,MAAM,UAAU,sBAAsB,CACpC,UAA+C,EAC/C,GAAQ;IAER,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,kEAAkE,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;IACzG,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,eAAe,CAAC,CAAC;QACrE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1D,MAAM,EAAE,cAAc,CAAC,KAAK,CAAC;QAC7B,SAAS;KACV,CAAC,CAAC,CAAC;AACN,CAAC;AAED,SAAS,cAAc,CAAC,KAAa;IACnC,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,GAAG,CAAC;QACF,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC;QAC5E,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC,QAAQ,SAAS,IAAI,CAAC,EAAE;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,6EAA6E;AAC7E,4EAA4E;AAC5E,0EAA0E;AAC1E,MAAM,UAAU,sBAAsB,CACpC,aAAyB,EACzB,KAAqC;IAErC,MAAM,KAAK,GAAG,UAAU,CAAC,eAAe,CAAC,aAAa,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAC3E,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CACvG,CAAC;IACF,wBAAwB,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,CAAC;IAEhE,OAAO;QACL,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACjE,cAAc,EAAE,cAAc,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,WAAW,CAAC;QACpE,eAAe,EAAE,yBAAyB,CAAC,KAAK,CAAC,mBAAmB,CAAC,EAAE,WAAW,CAAC;QACnF,cAAc,EAAE,cAAc,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,WAAW,CAAC;QACpE,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,yBAAyB,CAAC;KAClE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,0BAA0B,CACxC,sBAA8C,EAC9C,KAAqC;IAErC,OAAO;QACL,QAAQ,EAAE;YACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,8BAA8B,EAAE;YAC3D,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,0BAA0B,CAAC,sBAAsB,CAAC,EAAE;SAC9E;QACD,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC;KAC1C,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,wEAAwE;AACxE,sEAAsE;AACtE,0EAA0E;AAC1E,4EAA4E;AAC5E,6EAA6E;AAC7E,4EAA4E;AAC5E,iBAAiB;AACjB,MAAM,UAAU,0BAA0B,CAAC,KAA6B;IACtE,MAAM,QAAQ,GAAG;QACf,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;YACjC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC5E,CAAC,CAAC,EAAE,CAAC;QACP,OAAO,CACL,YAAY,EACZ,KAAK,CAAC,iBAAiB;aACpB,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;aAC3D,IAAI,CAAC,MAAM,CAAC,CAChB;QACD,GAAG,CAAC,KAAK,CAAC,eAAe,KAAK,IAAI;YAChC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/D,OAAO,CAAC,cAAc,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;KACxD,CAAC;IACF,OAAO,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,OAAO,CAAC,IAAY,EAAE,IAAY;IACzC,OAAO,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,GAAG,CAAC;AAC1C,CAAC;AAED,SAAS,cAAc,CAAC,MAAc,EAAE,KAA6B;IACnE,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,CAAC,aAAa,MAAM,EAAE,CAAC,CAAC;IACtC,IAAI,IAAI,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QACnE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CACR,KAAK,IAAI,CAAC,IAAI,UAAU,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,UAAU,OAAO,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CACrF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,0DAA0D;AAC1D,SAAS,QAAQ,CAAC,IAAyB;IACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CACnC,CAAC,UAAU,EAAE,EAAE,CACb,GAAG,UAAU,CAAC,eAAe,QAAQ,UAAU,CAAC,eAAe,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,CACvH,CAAC;IACF,OAAO,WAAW,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC1C,CAAC;AAED,SAAS,MAAM,CAAC,KAAa;IAC3B,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,GAAG,CAAC,KAAa;IACxB,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9C,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC3E,OAAO,IAAI,OAAO,EAAE,CAAC;AACvB,CAAC;AAED,SAAS,YAAY,CAAC,IAAuB;IAC3C,OAAO,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;AAC9F,CAAC;AAED,SAAS,cAAc,CAAC,KAAc;IACpC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACvD,OAAO,cAAc,CACnB,UAAU,CAAC,KAAK,EAAE,2BAA2B,CAAC,CAAC,QAAQ,CAAC,EACxD,kCAAkC,CACnC,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,KAAc;IACnC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,8EAA8E;AAC9E,yDAAyD;AACzD,2DAA2D;AAC3D,MAAM,UAAU,6BAA6B,CAC3C,UAAkB,EAClB,KAAqC,EACrC,UAA8B;IAE9B,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,6BAA6B,CAAC,CAAC;IACjE,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,6EAA6E;IAC7E,MAAM,iBAAiB,GACrB,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7E,MAAM,QAAQ,GAAG,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACpF,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QAClF,MAAM,IAAI,KAAK,CACb,qDAAqD,QAAQ;aAC1D,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,OAAO,CAAC;aAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAChB,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChC,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACzE,CAAC;IACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IACpE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,2DAA2D,MAAM,EAAE,CAAC,CAAC;IACvF,CAAC;IACD,IAAI,iBAAiB,KAAK,SAAS;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IAClF,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACpE,MAAM,IAAI,KAAK,CACb,oDAAoD,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACnF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC;AACtD,CAAC;AAED,8EAA8E;AAC9E,2EAA2E;AAC3E,SAAS,QAAQ,CAAI,KAAmB,EAAE,GAAQ;IAChD,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IACzB,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,CAAC;QACT,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACrB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,wBAAwB,CAC/B,KAAc,EACd,WAAwC;IAExC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;QAC7B,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,sBAAsB,KAAK,GAAG,CAAC,CAAC;QACrE,OAAO,YAAY,CACjB,cAAc,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,sBAAsB,KAAK,SAAS,CAAC,EACrE,cAAc,CACZ,MAAM,CAAC,gBAAgB,CAAC,EACxB,sBAAsB,KAAK,kBAAkB,CAC9C,CACF,CAAC;IACJ,CAAC,CAAC,CACH,CAAC;IACF,IAAI,YAAY,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5G,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IAClE,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,KAAc,EACd,WAAwC;IAExC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE;QACpC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,EAAE,iBAAiB,SAAS,GAAG,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,2BAA2B,CAAC,CAAC;QACzE,CAAC;QACD,OAAO;YACL,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,iBAAiB,SAAS,QAAQ,CAAC;YACtE,WAAW,EAAE,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI;YACjF,qEAAqE;YACrE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,EAAE;gBAC5C,MAAM,KAAK,GAAG,iBAAiB,SAAS,YAAY,UAAU,GAAG,CAAC;gBAClE,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBAC5C,OAAO;oBACL,MAAM,EAAE,kBAAkB,CACxB,WAAW,EACX,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,GAAG,KAAK,WAAW,CAAC,EACtD,cAAc,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,GAAG,KAAK,iBAAiB,CAAC,CACnE;oBACD,IAAI,EAAE,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,OAAO,CAAC;oBACpD,UAAU,EAAE,cAAc,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,GAAG,KAAK,aAAa,CAAC;oBACtE,OAAO,EAAE,cAAc,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,GAAG,KAAK,UAAU,CAAC;iBAC9D,CAAC;YACJ,CAAC,CAAC;SACH,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,yBAAyB,CAChC,KAAc,EACd,WAAwC;IAExC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,4BAA4B,CAAC,CAAC;IACjE,MAAM,KAAK,GAAG,cAAc,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,kCAAkC,CAAC,CAAC;IACpF,MAAM,aAAa,GAAG,cAAc,CAClC,QAAQ,CAAC,gBAAgB,CAAC,EAC1B,2CAA2C,CAC5C,CAAC;IACF,OAAO;QACL,MAAM,EAAE,kBAAkB,CAAC,WAAW,EAAE,KAAK,EAAE,aAAa,CAAC;KAC9D,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CACrB,KAAc,EACd,WAAwC;IAExC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACrD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;IAC5E,CAAC;IACD,4EAA4E;IAC5E,wEAAwE;IACxE,iEAAiE;IACjE,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACpC,MAAM,KAAK,GAAG,2BAA2B,KAAK,GAAG,CAAC;QAClD,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,kBAAkB,CAC/B,WAAW,EACX,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,KAAK,QAAQ,CAAC,EAC/C,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,GAAG,KAAK,mBAAmB,CAAC,CACtE,CAAC;QACF,MAAM,SAAS,GAAG,IAAI,CAAC,0BAA0B,CAAC,CAAC;QACnD,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,EAAE,CAAC;QAC7D,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;YAC1E,uEAAuE;YACvE,wEAAwE;YACxE,4DAA4D;YAC5D,MAAM,IAAI,KAAK,CACb,GAAG,KAAK,0DAA0D,CACnE,CAAC;QACJ,CAAC;QACD,OAAO;YACL;gBACE,MAAM;gBACN,WAAW,EAAE,SAAS,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,eAAe,EAAE,EAAE;oBACxE,MAAM,eAAe,GAAG,GAAG,KAAK,yCAAyC,eAAe,GAAG,CAAC;oBAC5F,MAAM,MAAM,GAAG,UAAU,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACvD,OAAO;wBACL,eAAe,EAAE,cAAc,CAC7B,MAAM,CAAC,iBAAiB,CAAC,EACzB,GAAG,eAAe,kBAAkB,CACrC;wBACD,cAAc,EAAE,cAAc,CAC5B,MAAM,CAAC,gBAAgB,CAAC,EACxB,GAAG,eAAe,iBAAiB,CACpC;qBACF,CAAC;gBACJ,CAAC,CAAC;aACH;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,cAAc,CAAC,KAA4B,EAAE,KAAa;IACjE,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,0BAA0B,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,kBAAkB,CACzB,WAAwC,EACxC,KAAa,EACb,aAAqB;IAErB,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;IACnE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,mDAAmD,KAAK,IAAI,aAAa,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CAAC,KAAa,EAAE,aAAqB;IACxD,OAAO,GAAG,KAAK,SAAS,aAAa,EAAE,CAAC;AAC1C,CAAC"}