@trazum/core 1.8.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 David Muñoz Rey
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,163 @@
+# @trazum/core
+
+Prompt optimiser. Shortens what you send to a model without changing what you
+ask for, and tells you what that is worth per month.
+
+**Zero runtime dependencies**, and that is asserted in CI rather than promised.
+This library reads your prompts; every dependency would be someone else's code
+reading them too.
+
+Part of [Trazum](https://github.com/Davmunrey/Trazum). For the terminal, see
+[`@trazum/cli`](https://www.npmjs.com/package/@trazum/cli).
+
+> [!NOTE]
+> **Not published yet.** The command below will not work today — there is no tag
+> and `npm view` returns 404. Run it from source meanwhile:
+> [github.com/Davmunrey/Trazum](https://github.com/Davmunrey/Trazum#getting-started).
+
+```bash
+npm install @trazum/core
+```
+
+## Use
+
+```ts
+import { optimize } from '@trazum/core';
+
+const result = optimize(prompt, {
+  level: 'safe',                       // or 'aggressive' — read the diff
+  usage: {
+    model: 'claude-opus-5',
+    callsPerMonth: 50_000,
+    avgOutputTokens: 500,
+    cacheHitRate: 0.9,
+    batchEligible: false,
+  },
+});
+
+result.optimized;                    // the shortened prompt
+result.savings.monthlySavingsUsd;    // what that is worth
+result.advisories;                   // usually where the real money is
+result.rules;                        // what each rule changed, with samples
+```
+
+The optimisation is **deterministic**: same input, same output, no API key, no
+network call, nothing to pay.
+
+## What it does
+
+**Trims with deterministic rules** — courtesy, filler, verbose phrasing,
+duplicated paragraphs, decorative separators, shouting in capitals.
+
+**Never touches what would break the prompt.** Code fences, inline code, URLs,
+template placeholders (`{{x}}`, `${x}`, `{x}`, `{% %}`) and XML/HTML tags are
+isolated *before* any rule runs. If a rule ever did make one of those disappear,
+that rule is discarded and the rest carry on.
+
+**Tells you where the money actually is.** Trimming is usually not it. Read
+`result.advisories` first — they are sorted warnings-first, then by monthly
+saving:
+
+| Advisory | What it finds |
+|---|---|
+| `prompt-caching` | Caching is a byte-for-byte prefix match, so a template only caches up to its first placeholder. The saving is computed over the **real** stable prefix. |
+| `cache-prefix-reorder` | Stable instructions stranded *after* the first placeholder never cache. Often the single largest saving available. |
+| `contradictory-instructions` | "Answer in English" three paragraphs above "reply in the customer's own language". A correctness bug that also costs tokens twice. |
+| `redundant-examples` | Few-shot examples that are near-copies of an earlier one. |
+| `restated-output-format` | A schema shown in a code block and then walked again in prose. |
+| `movable-output-schema` | A schema the request could carry as a parameter instead — cheaper *and* stricter, and the one finding that is not a trade-off. Reported, never edited: it changes the call, not the prompt. |
+| `model-downgrade` | A keyword heuristic, not a quality judgement — validate with evaluations before acting on it. |
+| `output-dominated` | You pay more for the answer than the prompt, so shortening it has a ceiling. |
+| `batch-api`, `below-cache-minimum`, `context-window`, `promotional-pricing` | |
+
+The last three structural findings are **advisory only**. A contradiction has a
+right answer only you know, and an example that looks redundant may be
+demonstrating a boundary case on purpose. Trazum points; it does not cut.
+
+## Comparing two versions
+
+```ts
+import { comparePrompts, formatSignedUsd } from '@trazum/core';
+
+const change = comparePrompts(before, after, { usage });
+
+change.tokenDelta;                       //  +37  (grew)
+formatSignedUsd(change.monthlyDeltaUsd); //  "+$9.25"
+change.advisories.appeared;              //  what the edit broke
+```
+
+**Note the sign.** Everything `comparePrompts` returns is `after - before`, so
+**positive means worse** — the opposite of `result.savings`. That is why it lives
+in its own module and why nothing in it is called a saving.
+
+## Prices
+
+The bundled catalogue is correct as of `PRICING_LAST_REVIEWED` and needs no
+setup. When a published price moves, correct it without upgrading this package:
+
+```ts
+import { catalogueFromOverlay, optimize } from '@trazum/core';
+
+const pricing = catalogueFromOverlay(`{
+  "lastReviewed": "2027-01-15",
+  "models": { "claude-opus-5": { "inputPerMTok": 6 } }
+}`);
+
+const result = optimize(prompt, { usage, pricing });
+result.pricingSource; // says which models came from the overlay, and its date
+```
+
+A catalogue is a **value**: applying an overlay returns a new one and mutates
+nothing, so your prices never leak into another caller's report.
+
+## Two entry points
+
+`@trazum/core` imports **no Node builtins** — enforced by a test that walks the
+import graph, because the browser bundles it. Anything that reads the filesystem
+lives on `@trazum/core/node`:
+
+```ts
+import { loadConfig, walkPrompts } from '@trazum/core/node';
+```
+
+## Optional LLM pass
+
+For the compression rules cannot do. The result is only accepted if it is
+shorter **and** leaves protected content byte-identical — it never returns
+something worse than where it started.
+
+```ts
+import { openAiCompatible, refineWithLlm } from '@trazum/core';
+
+const refined = await refineWithLlm(result, openAiCompatible({
+  baseUrl: 'https://your-llm/v1',
+  apiKey: process.env.LLM_KEY,
+  model: 'your-model',
+}));
+```
+
+## Token counts
+
+The bundled estimator is a dependency-free heuristic, accurate to about **±15%**
+on ordinary prose, and it compares two versions of the same prompt well — which
+is what it is for. For exact figures, pass a real counter:
+
+```ts
+import { countTokensAnthropic, withExactTokenCounts } from '@trazum/core';
+
+const exact = await withExactTokenCounts(result, countTokensAnthropic({ apiKey }));
+```
+
+## Locales
+
+English and Spanish. **A locale changes the report, never the optimisation** —
+the same prompt in any locale produces the same optimised text, the same token
+counts and the same advisory ids. Match on ids, not on prose.
+
+## Versioning
+
+See [VERSIONING.md](https://github.com/Davmunrey/Trazum/blob/main/VERSIONING.md).
+Rule and advisory **identifiers** are stable across locales and versions on
+purpose; message **text** is copy and gets improved.
+
+MIT.

package/dist/advisories.d.ts

@@ -0,0 +1,23 @@
+import type { Locale } from './i18n/types.js';
+import type { PricingCatalogue } from './pricing.js';
+import type { Advisory, ModelPricing, TokenCounter, UsageProfile } from './types.js';
+/**
+ * Estimates the capability tier the prompt needs.
+ *
+ * This is a keyword-and-size heuristic, not a judgement about answer quality.
+ * Treat it as a hypothesis to validate with your own evaluations before
+ * moving down a tier in production.
+ */
+export declare function recommendTier(prompt: string, tokens: number): ModelPricing['tier'];
+export interface AdvisoryOptions {
+    /** Reference date, used to decide whether a promotional price is live. */
+    on?: Date;
+    /** Token counter, so the cache-prefix analysis matches the caller's. */
+    count?: TokenCounter;
+    locale?: Locale;
+    /** Prices to work from. Defaults to the catalogue bundled with this release. */
+    pricing?: PricingCatalogue;
+}
+/** Builds the advisories that do not modify the prompt but do move the bill. */
+export declare function buildAdvisories(optimizedPrompt: string, tokensAfter: number, usage: UsageProfile, options?: AdvisoryOptions): Advisory[];
+//# sourceMappingURL=advisories.d.ts.map

package/dist/advisories.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"advisories.d.ts","sourceRoot":"","sources":["../src/advisories.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAG9C,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAKrD,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAQrF;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAclF;AAsDD,MAAM,WAAW,eAAe;IAC9B,0EAA0E;IAC1E,EAAE,CAAC,EAAE,IAAI,CAAC;IACV,wEAAwE;IACxE,KAAK,CAAC,EAAE,YAAY,CAAC;IACrB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,gFAAgF;IAChF,OAAO,CAAC,EAAE,gBAAgB,CAAC;CAC5B;AAED,gFAAgF;AAChF,wBAAgB,eAAe,CAC7B,eAAe,EAAE,MAAM,EACvB,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,YAAY,EACnB,OAAO,GAAE,eAAoB,GAC5B,QAAQ,EAAE,CAiUZ"}

package/dist/advisories.js

@@ -0,0 +1,376 @@
+import { analyzeCachePrefix } from './cache.js';
+import { getMessages } from './i18n/index.js';
+import { COMPLEX_SIGNALS, SIMPLE_SIGNALS } from './phrases.js';
+import { BUNDLED_CATALOGUE, effectivePricing, modelFrom, multipliersFor } from './pricing.js';
+import { formatUsd } from './savings.js';
+import { analyzeExamples, findContradictions, findMovableSchema, findRestatedFormat } from './structure.js';
+import { estimateTokens } from './tokenizer.js';
+function countSignals(haystack, signals) {
+    let count = 0;
+    for (const signal of signals)
+        if (haystack.includes(signal))
+            count++;
+    return count;
+}
+/**
+ * Estimates the capability tier the prompt needs.
+ *
+ * This is a keyword-and-size heuristic, not a judgement about answer quality.
+ * Treat it as a hypothesis to validate with your own evaluations before
+ * moving down a tier in production.
+ */
+export function recommendTier(prompt, tokens) {
+    const haystack = prompt.toLowerCase();
+    let score = countSignals(haystack, COMPLEX_SIGNALS) * 2 - countSignals(haystack, SIMPLE_SIGNALS) * 2;
+    if (tokens > 4000)
+        score += 2;
+    else if (tokens > 1500)
+        score += 1;
+    else if (tokens < 300)
+        score -= 1;
+    if (/```|~~~/.test(prompt))
+        score += 1;
+    if (score >= 3)
+        return 'opus';
+    if (score >= 0)
+        return 'sonnet';
+    return 'haiku';
+}
+const TIER_ORDER = {
+    /**
+     * Below every real tier, so no tier is ever "less capable than unknown".
+     *
+     * The value carries the intent rather than the guard below carrying it alone.
+     * Set the other way — above everything — the comparison
+     * `TIER_ORDER[suggested] < TIER_ORDER['unknown']` is true for every prompt,
+     * and the only thing left standing between that and a recommendation is an
+     * unrelated provider filter. Mutation testing found exactly that: deleting
+     * the guard changed no test result, because a second accident was covering
+     * for it. Two accidents in a row is not a design.
+     */
+    unknown: Number.NEGATIVE_INFINITY,
+    haiku: 0,
+    sonnet: 1,
+    opus: 2,
+    frontier: 3,
+};
+/**
+ * Cheapest model of a capability tier, using today's effective input price.
+ *
+ * **Within the same provider**, which is a product decision rather than an
+ * implementation detail. Dropping from Opus to Sonnet is a one-line change;
+ * moving to another vendor is a different API, different behaviour and a
+ * migration. This advisory is already caveated as a keyword heuristic rather
+ * than a judgement about answer quality, and a keyword heuristic has no business
+ * recommending that somebody change supplier.
+ *
+ * A model with no provider recorded only matches others with none, so an overlay
+ * that adds a bare model cannot pull a switch out of thin air.
+ */
+function cheapestInTier(tier, on, pricing, provider) {
+    const candidates = pricing.models.filter((m) => m.tier === tier &&
+        m.provider === provider &&
+        // Not generally available: recommending a model the reader cannot call is
+        // worse than recommending nothing.
+        m.recommendable !== false);
+    if (candidates.length === 0)
+        return undefined;
+    return candidates.reduce((best, m) => effectivePricing(m, on).inputPerMTok < effectivePricing(best, on).inputPerMTok ? m : best);
+}
+/** Builds the advisories that do not modify the prompt but do move the bill. */
+export function buildAdvisories(optimizedPrompt, tokensAfter, usage, options = {}) {
+    const { on = new Date(), count = estimateTokens, locale, pricing = BUNDLED_CATALOGUE } = options;
+    const t = getMessages(locale);
+    const advisories = [];
+    const model = modelFrom(pricing, usage.model);
+    const { inputPerMTok, outputPerMTok, promoApplied } = effectivePricing(model, on);
+    // Per model, not global. A cache read is ~10% of input on Anthropic and about
+    // half on OpenAI; one constant for both overstates an OpenAI caching saving
+    // fivefold, which is an invented saving rather than an imprecise one.
+    const rates = multipliersFor(model);
+    const batchFactor = usage.batchEligible ? (rates.batch ?? 1) : 1;
+    const monthlyInputUsd = (tokensAfter / 1_000_000) * inputPerMTok * usage.callsPerMonth * batchFactor;
+    const monthlyOutputUsd = (usage.avgOutputTokens / 1_000_000) * outputPerMTok * usage.callsPerMonth * batchFactor;
+    // --- Context window ---
+    if (tokensAfter > model.contextWindow) {
+        advisories.push({
+            id: 'context-overflow',
+            severity: 'warning',
+            ...t.advisories.contextOverflow({
+                tokens: tokensAfter,
+                modelName: model.displayName,
+                contextWindow: model.contextWindow,
+            }),
+            estimatedMonthlyUsd: null,
+        });
+    }
+    // --- Prompt caching ---
+    // Caching is a prefix match: in a template with placeholders, only what
+    // precedes the first placeholder is cached. Costing the whole prompt would
+    // be a lie the moment {{x}} takes a different value between calls.
+    const cache = analyzeCachePrefix(optimizedPrompt, count);
+    // A provider with no prompt caching gets no caching advice. Without this the
+    // zero minimum satisfies `0 >= 0` and Trazum offers a saving that cannot be
+    // bought at any price — the exact failure that moving the multipliers onto the
+    // model was meant to prevent, reintroduced one field along.
+    /**
+     * Three ways to have nothing useful to say about caching, and only one of
+     * them used to be handled.
+     *
+     * `none` is a fact: the provider does not cache, so advice would be a saving
+     * nobody can buy. `unknown` is the absence of a fact — a catalogue built from
+     * a live price feed knows what a model costs and not how it caches — and it
+     * has to decline for the opposite reason: not because the answer is no, but
+     * because nobody asked anyone. Guessing either way is a number in somebody's
+     * budget that came from nowhere.
+     */
+    const cachingKnown = model.caching !== 'none' && model.caching !== 'unknown' && model.cacheMinTokens !== null;
+    if (usage.callsPerMonth > 1 && cachingKnown) {
+        const prefixShare = tokensAfter > 0 ? cache.stablePrefixTokens / tokensAfter : 0;
+        const monthlyPrefixUsd = monthlyInputUsd * Math.min(1, prefixShare);
+        const hitRate = Math.min(Math.max(usage.cacheHitRate, 0), 1);
+        const factor = (1 - hitRate) * rates.cacheWrite5m + hitRate * rates.cacheRead;
+        const minTokens = model.cacheMinTokens ?? 0;
+        if (cache.stablePrefixTokens >= minTokens) {
+            const saving = monthlyPrefixUsd * (1 - factor);
+            if (saving > 0) {
+                advisories.push({
+                    id: 'prompt-caching',
+                    severity: 'opportunity',
+                    ...t.advisories.promptCaching({
+                        placeholder: cache.firstPlaceholder,
+                        prefixTokens: cache.stablePrefixTokens,
+                        totalTokens: tokensAfter,
+                        minTokens,
+                        modelName: model.displayName,
+                        hitRatePct: Math.round(hitRate * 100),
+                        readPct: Math.round(rates.cacheRead * 100),
+                        writePct: Math.round(rates.cacheWrite5m * 100),
+                        explicit: (model.caching ?? 'explicit') === 'explicit',
+                    }),
+                    estimatedMonthlyUsd: saving,
+                });
+            }
+            else {
+                advisories.push({
+                    id: 'prompt-caching-not-worth-it',
+                    severity: 'info',
+                    ...t.advisories.promptCachingNotWorthIt(),
+                    estimatedMonthlyUsd: null,
+                });
+            }
+        }
+        else {
+            advisories.push({
+                id: 'below-cache-minimum',
+                severity: 'info',
+                ...t.advisories.belowCacheMinimum({
+                    modelName: model.displayName,
+                    minTokens,
+                    placeholder: cache.firstPlaceholder,
+                    prefixTokens: cache.stablePrefixTokens,
+                    totalTokens: tokensAfter,
+                    mentionLowerMinimum: minTokens > 512,
+                }),
+                estimatedMonthlyUsd: null,
+            });
+        }
+        // Stable content placed AFTER the first placeholder: never cached today,
+        // but moving it in front would make it cacheable.
+        if (cache.firstPlaceholder &&
+            cache.staticTokensAfter >= 200 &&
+            cache.staticTokensAfter >= tokensAfter * 0.3) {
+            const movableShare = tokensAfter > 0 ? cache.staticTokensAfter / tokensAfter : 0;
+            const saving = monthlyInputUsd * movableShare * Math.max(0, 1 - factor);
+            advisories.push({
+                id: 'cache-prefix-reorder',
+                severity: 'opportunity',
+                ...t.advisories.cachePrefixReorder({
+                    staticTokensAfter: cache.staticTokensAfter,
+                    sharePct: Math.round(movableShare * 100),
+                    placeholder: cache.firstPlaceholder,
+                }),
+                estimatedMonthlyUsd: saving > 0 ? saving : null,
+            });
+        }
+    }
+    // --- Batch API ---
+    // `rates.batch === null` means the provider has no batch API at all, which is
+    // different from not having said: advising a discount that cannot be bought
+    // is worse than staying quiet.
+    if (!usage.batchEligible && usage.callsPerMonth > 1 && rates.batch !== null) {
+        const saving = (monthlyInputUsd + monthlyOutputUsd) * (1 - rates.batch);
+        advisories.push({
+            id: 'batch-api',
+            severity: 'opportunity',
+            ...t.advisories.batchApi(),
+            estimatedMonthlyUsd: saving,
+        });
+    }
+    // --- Recommended model ---
+    const suggestedTier = recommendTier(optimizedPrompt, tokensAfter);
+    /**
+     * A model whose capability nobody recorded is never told it is overpowered.
+     *
+     * Part of the condition rather than an early return, which is how the first
+     * version of this was wrong: `return advisories` here skipped every advisory
+     * *after* the model check — output-dominated, contradictory instructions —
+     * none of which has anything to do with what tier the model is. An unknown
+     * capability is a reason to say nothing about capability, not a reason to
+     * stop reading the prompt.
+     *
+     * **Deliberately redundant**, and the one surviving mutant in this change.
+     * `TIER_ORDER.unknown` is `-Infinity`, so the comparison is already false and
+     * deleting this clause changes no behaviour and no test. It stays because the
+     * two express the same rule in different places: an ordering that forgets it
+     * and a condition that forgets it both have to happen before a model of
+     * unrecorded capability is told it is overpowered.
+     */
+    if (model.tier !== 'unknown' && TIER_ORDER[suggestedTier] < TIER_ORDER[model.tier]) {
+        const candidate = cheapestInTier(suggestedTier, on, pricing, model.provider);
+        if (candidate) {
+            const candidatePricing = effectivePricing(candidate, on);
+            const candidateMonthly = ((tokensAfter / 1_000_000) * candidatePricing.inputPerMTok +
+                (usage.avgOutputTokens / 1_000_000) * candidatePricing.outputPerMTok) *
+                usage.callsPerMonth *
+                (usage.batchEligible ? 0.5 : 1);
+            const saving = monthlyInputUsd + monthlyOutputUsd - candidateMonthly;
+            if (saving > 0) {
+                advisories.push({
+                    id: 'model-downgrade',
+                    severity: 'opportunity',
+                    ...t.advisories.modelDowngrade({
+                        modelName: model.displayName,
+                        tier: suggestedTier,
+                        candidateName: candidate.displayName,
+                        currentUsd: formatUsd(monthlyInputUsd + monthlyOutputUsd),
+                        candidateUsd: formatUsd(candidateMonthly),
+                    }),
+                    estimatedMonthlyUsd: saving,
+                });
+            }
+        }
+    }
+    // --- Where the money actually is ---
+    if (monthlyOutputUsd > monthlyInputUsd * 2 && usage.avgOutputTokens > 0) {
+        advisories.push({
+            id: 'output-dominated',
+            severity: 'info',
+            ...t.advisories.outputDominated({
+                outputUsd: formatUsd(monthlyOutputUsd),
+                inputUsd: formatUsd(monthlyInputUsd),
+            }),
+            estimatedMonthlyUsd: null,
+        });
+    }
+    // --- Instructions that fight each other ---
+    // Not a saving: a contradiction is a correctness problem that happens to
+    // cost tokens, so it carries no dollar figure and sorts on severity instead.
+    const contradictions = findContradictions(optimizedPrompt);
+    const worst = contradictions[0];
+    if (worst) {
+        advisories.push({
+            id: 'contradictory-instructions',
+            severity: 'warning',
+            ...t.advisories.contradictoryInstructions({
+                axis: t.contradictionAxes[worst.axis],
+                firstValue: t.contradictionValues[worst.a.value],
+                firstSnippet: worst.a.snippet,
+                secondValue: t.contradictionValues[worst.b.value],
+                secondSnippet: worst.b.snippet,
+                otherCount: contradictions.length - 1,
+            }),
+            estimatedMonthlyUsd: null,
+        });
+    }
+    // --- Few-shot examples that repeat each other ---
+    const examples = analyzeExamples(optimizedPrompt, count);
+    if (examples.redundant.length > 0 && examples.redundantTokens > 0) {
+        const saving = tokensAfter > 0
+            ? monthlyInputUsd * Math.min(1, examples.redundantTokens / tokensAfter)
+            : 0;
+        const topSimilarity = Math.max(...examples.redundant.map((r) => r.similarity));
+        advisories.push({
+            id: 'redundant-examples',
+            severity: 'opportunity',
+            ...t.advisories.redundantExamples({
+                redundantCount: examples.redundant.length,
+                totalCount: examples.examples.length,
+                redundantTokens: examples.redundantTokens,
+                topSimilarityPct: Math.round(topSimilarity * 100),
+            }),
+            estimatedMonthlyUsd: saving > 0 ? saving : null,
+        });
+    }
+    // --- Output format written out twice ---
+    const restated = findRestatedFormat(optimizedPrompt, count);
+    const movable = findMovableSchema(optimizedPrompt, count);
+    if (movable) {
+        /**
+         * Priced from the tokens, which are real and reproducible, with the
+         * uncertainty in the text rather than in the figure.
+         *
+         * What Trazum knows is how many tokens the block holds; what it cannot know
+         * from here is whether the provider accepts a response schema. Withholding
+         * the figure for that reason would be the wrong trade — the number is right
+         * *if* the move is available, and the advisory says plainly that it does not
+         * check. The same posture as `model-downgrade`, which carries a figure and
+         * says out loud that it is a keyword heuristic.
+         */
+        const saving = tokensAfter > 0 ? monthlyInputUsd * Math.min(1, movable.tokens / tokensAfter) : 0;
+        advisories.push({
+            id: 'movable-output-schema',
+            severity: 'opportunity',
+            ...t.advisories.movableSchema({
+                blocks: movable.blocks,
+                tokens: movable.tokens,
+                keyList: movable.keys.map((k) => `\`${k}\``).join(', '),
+                cue: movable.cue,
+            }),
+            estimatedMonthlyUsd: saving > 0 ? saving : null,
+        });
+    }
+    if (restated) {
+        const saving = tokensAfter > 0
+            ? monthlyInputUsd * Math.min(1, restated.restatedTokens / tokensAfter)
+            : 0;
+        advisories.push({
+            id: 'restated-output-format',
+            severity: 'opportunity',
+            ...t.advisories.restatedOutputFormat({
+                restatedCount: restated.restatedKeys.length,
+                totalCount: restated.keys.length,
+                restatedTokens: restated.restatedTokens,
+                keyList: restated.restatedKeys.map((k) => `\`${k}\``).join(', '),
+            }),
+            estimatedMonthlyUsd: saving > 0 ? saving : null,
+        });
+    }
+    if (promoApplied && model.promo) {
+        advisories.push({
+            id: 'promo-pricing',
+            severity: 'warning',
+            ...t.advisories.promoPricing({
+                modelName: model.displayName,
+                promoInput: model.promo.inputPerMTok,
+                promoOutput: model.promo.outputPerMTok,
+                until: model.promo.until,
+                listInput: model.inputPerMTok,
+                listOutput: model.outputPerMTok,
+            }),
+            estimatedMonthlyUsd: null,
+        });
+    }
+    // Warnings first, then by money. Sorting purely on the dollar figure buried
+    // things that are wrong — an overflowing context window, two instructions
+    // that contradict each other — underneath a saving of a few dollars, because
+    // being wrong carries no price tag.
+    const SEVERITY_ORDER = {
+        warning: 0,
+        opportunity: 1,
+        info: 2,
+    };
+    return advisories.sort((a, b) => SEVERITY_ORDER[a.severity] - SEVERITY_ORDER[b.severity] ||
+        (b.estimatedMonthlyUsd ?? 0) - (a.estimatedMonthlyUsd ?? 0));
+}
+//# sourceMappingURL=advisories.js.map

package/dist/advisories.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"advisories.js","sourceRoot":"","sources":["../src/advisories.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE9C,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE9F,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,iBAAiB,EAC7D,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAGhD,SAAS,YAAY,CAAC,QAAgB,EAAE,OAA0B;IAChE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,MAAM,IAAI,OAAO;QAAE,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,KAAK,EAAE,CAAC;IACrE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,MAAc,EAAE,MAAc;IAC1D,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACtC,IAAI,KAAK,GACP,YAAY,CAAC,QAAQ,EAAE,eAAe,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,QAAQ,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC;IAE3F,IAAI,MAAM,GAAG,IAAI;QAAE,KAAK,IAAI,CAAC,CAAC;SACzB,IAAI,MAAM,GAAG,IAAI;QAAE,KAAK,IAAI,CAAC,CAAC;SAC9B,IAAI,MAAM,GAAG,GAAG;QAAE,KAAK,IAAI,CAAC,CAAC;IAElC,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IAEvC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAC9B,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAChC,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,GAAyC;IACvD;;;;;;;;;;OAUG;IACH,OAAO,EAAE,MAAM,CAAC,iBAAiB;IACjC,KAAK,EAAE,CAAC;IACR,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,QAAQ,EAAE,CAAC;CACZ,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,SAAS,cAAc,CACrB,IAA0B,EAC1B,EAAQ,EACR,OAAyB,EACzB,QAA4B;IAE5B,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,IAAI;QACf,CAAC,CAAC,QAAQ,KAAK,QAAQ;QACvB,0EAA0E;QAC1E,mCAAmC;QACnC,CAAC,CAAC,aAAa,KAAK,KAAK,CAC5B,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CACnC,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,GAAG,gBAAgB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAC1F,CAAC;AACJ,CAAC;AAYD,gFAAgF;AAChF,MAAM,UAAU,eAAe,CAC7B,eAAuB,EACvB,WAAmB,EACnB,KAAmB,EACnB,OAAO,GAAoB,EAAE;IAE7B,MAAM,EAAE,EAAE,GAAG,IAAI,IAAI,EAAE,EAAE,KAAK,GAAG,cAAc,EAAE,MAAM,EAAE,OAAO,GAAG,iBAAiB,EAAE,GAAG,OAAO,CAAC;IACjG,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAE9B,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC9C,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAClF,8EAA8E;IAC9E,4EAA4E;IAC5E,sEAAsE;IACtE,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjE,MAAM,eAAe,GACnB,CAAC,WAAW,GAAG,SAAS,CAAC,GAAG,YAAY,GAAG,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC;IAC/E,MAAM,gBAAgB,GACpB,CAAC,KAAK,CAAC,eAAe,GAAG,SAAS,CAAC,GAAG,aAAa,GAAG,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC;IAE1F,yBAAyB;IACzB,IAAI,WAAW,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;QACtC,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,kBAAkB;YACtB,QAAQ,EAAE,SAAS;YACnB,GAAG,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC;gBAC9B,MAAM,EAAE,WAAW;gBACnB,SAAS,EAAE,KAAK,CAAC,WAAW;gBAC5B,aAAa,EAAE,KAAK,CAAC,aAAa;aACnC,CAAC;YACF,mBAAmB,EAAE,IAAI;SAC1B,CAAC,CAAC;IACL,CAAC;IAED,yBAAyB;IACzB,wEAAwE;IACxE,2EAA2E;IAC3E,mEAAmE;IACnE,MAAM,KAAK,GAAG,kBAAkB,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACzD,6EAA6E;IAC7E,4EAA4E;IAC5E,+EAA+E;IAC/E,4DAA4D;IAC5D;;;;;;;;;;OAUG;IACH,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,cAAc,KAAK,IAAI,CAAC;IAE9G,IAAI,KAAK,CAAC,aAAa,GAAG,CAAC,IAAI,YAAY,EAAE,CAAC;QAC5C,MAAM,WAAW,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,MAAM,gBAAgB,GAAG,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QACpE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,YAAY,GAAG,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC;QAE9E,MAAM,SAAS,GAAG,KAAK,CAAC,cAAc,IAAI,CAAC,CAAC;QAE5C,IAAI,KAAK,CAAC,kBAAkB,IAAI,SAAS,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,gBAAgB,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YAC/C,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,UAAU,CAAC,IAAI,CAAC;oBACd,EAAE,EAAE,gBAAgB;oBACpB,QAAQ,EAAE,aAAa;oBACvB,GAAG,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC;wBAC5B,WAAW,EAAE,KAAK,CAAC,gBAAgB;wBACnC,YAAY,EAAE,KAAK,CAAC,kBAAkB;wBACtC,WAAW,EAAE,WAAW;wBACxB,SAAS;wBACT,SAAS,EAAE,KAAK,CAAC,WAAW;wBAC5B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC;wBACrC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC;wBAC1C,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC;wBAC9C,QAAQ,EAAE,CAAC,KAAK,CAAC,OAAO,IAAI,UAAU,CAAC,KAAK,UAAU;qBACvD,CAAC;oBACF,mBAAmB,EAAE,MAAM;iBAC5B,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC;oBACd,EAAE,EAAE,6BAA6B;oBACjC,QAAQ,EAAE,MAAM;oBAChB,GAAG,CAAC,CAAC,UAAU,CAAC,uBAAuB,EAAE;oBACzC,mBAAmB,EAAE,IAAI;iBAC1B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,qBAAqB;gBACzB,QAAQ,EAAE,MAAM;gBAChB,GAAG,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC;oBAChC,SAAS,EAAE,KAAK,CAAC,WAAW;oBAC5B,SAAS;oBACT,WAAW,EAAE,KAAK,CAAC,gBAAgB;oBACnC,YAAY,EAAE,KAAK,CAAC,kBAAkB;oBACtC,WAAW,EAAE,WAAW;oBACxB,mBAAmB,EAAE,SAAS,GAAG,GAAG;iBACrC,CAAC;gBACF,mBAAmB,EAAE,IAAI;aAC1B,CAAC,CAAC;QACL,CAAC;QAED,yEAAyE;QACzE,kDAAkD;QAClD,IACE,KAAK,CAAC,gBAAgB;YACtB,KAAK,CAAC,iBAAiB,IAAI,GAAG;YAC9B,KAAK,CAAC,iBAAiB,IAAI,WAAW,GAAG,GAAG,EAC5C,CAAC;YACD,MAAM,YAAY,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,iBAAiB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,MAAM,MAAM,GAAG,eAAe,GAAG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;YACxE,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,sBAAsB;gBAC1B,QAAQ,EAAE,aAAa;gBACvB,GAAG,CAAC,CAAC,UAAU,CAAC,kBAAkB,CAAC;oBACjC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;oBAC1C,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC;oBACxC,WAAW,EAAE,KAAK,CAAC,gBAAgB;iBACpC,CAAC;gBACF,mBAAmB,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI;aAChD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,8EAA8E;IAC9E,4EAA4E;IAC5E,+BAA+B;IAC/B,IAAI,CAAC,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QAC5E,MAAM,MAAM,GAAG,CAAC,eAAe,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACxE,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,WAAW;YACf,QAAQ,EAAE,aAAa;YACvB,GAAG,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE;YAC1B,mBAAmB,EAAE,MAAM;SAC5B,CAAC,CAAC;IACL,CAAC;IAED,4BAA4B;IAC5B,MAAM,aAAa,GAAG,aAAa,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;IAClE;;;;;;;;;;;;;;;;OAgBG;IACH,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,UAAU,CAAC,aAAa,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACnF,MAAM,SAAS,GAAG,cAAc,CAAC,aAAa,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC7E,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YACzD,MAAM,gBAAgB,GACpB,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,GAAG,gBAAgB,CAAC,YAAY;gBACxD,CAAC,KAAK,CAAC,eAAe,GAAG,SAAS,CAAC,GAAG,gBAAgB,CAAC,aAAa,CAAC;gBACvE,KAAK,CAAC,aAAa;gBACnB,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,MAAM,GAAG,eAAe,GAAG,gBAAgB,GAAG,gBAAgB,CAAC;YACrE,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,UAAU,CAAC,IAAI,CAAC;oBACd,EAAE,EAAE,iBAAiB;oBACrB,QAAQ,EAAE,aAAa;oBACvB,GAAG,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC;wBAC7B,SAAS,EAAE,KAAK,CAAC,WAAW;wBAC5B,IAAI,EAAE,aAAa;wBACnB,aAAa,EAAE,SAAS,CAAC,WAAW;wBACpC,UAAU,EAAE,SAAS,CAAC,eAAe,GAAG,gBAAgB,CAAC;wBACzD,YAAY,EAAE,SAAS,CAAC,gBAAgB,CAAC;qBAC1C,CAAC;oBACF,mBAAmB,EAAE,MAAM;iBAC5B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,gBAAgB,GAAG,eAAe,GAAG,CAAC,IAAI,KAAK,CAAC,eAAe,GAAG,CAAC,EAAE,CAAC;QACxE,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,kBAAkB;YACtB,QAAQ,EAAE,MAAM;YAChB,GAAG,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC;gBAC9B,SAAS,EAAE,SAAS,CAAC,gBAAgB,CAAC;gBACtC,QAAQ,EAAE,SAAS,CAAC,eAAe,CAAC;aACrC,CAAC;YACF,mBAAmB,EAAE,IAAI;SAC1B,CAAC,CAAC;IACL,CAAC;IAED,6CAA6C;IAC7C,yEAAyE;IACzE,6EAA6E;IAC7E,MAAM,cAAc,GAAG,kBAAkB,CAAC,eAAe,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,KAAK,EAAE,CAAC;QACV,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,4BAA4B;YAChC,QAAQ,EAAE,SAAS;YACnB,GAAG,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC;gBACxC,IAAI,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC;gBACrC,UAAU,EAAE,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBAChD,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO;gBAC7B,WAAW,EAAE,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBACjD,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO;gBAC9B,UAAU,EAAE,cAAc,CAAC,MAAM,GAAG,CAAC;aACtC,CAAC;YACF,mBAAmB,EAAE,IAAI;SAC1B,CAAC,CAAC;IACL,CAAC;IAED,mDAAmD;IACnD,MAAM,QAAQ,GAAG,eAAe,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACzD,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,eAAe,GAAG,CAAC,EAAE,CAAC;QAClE,MAAM,MAAM,GACV,WAAW,GAAG,CAAC;YACb,CAAC,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,eAAe,GAAG,WAAW,CAAC;YACvE,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/E,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,oBAAoB;YACxB,QAAQ,EAAE,aAAa;YACvB,GAAG,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC;gBAChC,cAAc,EAAE,QAAQ,CAAC,SAAS,CAAC,MAAM;gBACzC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM;gBACpC,eAAe,EAAE,QAAQ,CAAC,eAAe;gBACzC,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,GAAG,CAAC;aAClD,CAAC;YACF,mBAAmB,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI;SAChD,CAAC,CAAC;IACL,CAAC;IAED,0CAA0C;IAC1C,MAAM,QAAQ,GAAG,kBAAkB,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IAC5D,MAAM,OAAO,GAAG,iBAAiB,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IAC1D,IAAI,OAAO,EAAE,CAAC;QACZ;;;;;;;;;;WAUG;QACH,MAAM,MAAM,GACV,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,uBAAuB;YAC3B,QAAQ,EAAE,aAAa;YACvB,GAAG,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC;gBAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACvD,GAAG,EAAE,OAAO,CAAC,GAAG;aACjB,CAAC;YACF,mBAAmB,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI;SAChD,CAAC,CAAC;IACL,CAAC;IAED,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,MAAM,GACV,WAAW,GAAG,CAAC;YACb,CAAC,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,cAAc,GAAG,WAAW,CAAC;YACtE,CAAC,CAAC,CAAC,CAAC;QACR,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,wBAAwB;YAC5B,QAAQ,EAAE,aAAa;YACvB,GAAG,CAAC,CAAC,UAAU,CAAC,oBAAoB,CAAC;gBACnC,aAAa,EAAE,QAAQ,CAAC,YAAY,CAAC,MAAM;gBAC3C,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM;gBAChC,cAAc,EAAE,QAAQ,CAAC,cAAc;gBACvC,OAAO,EAAE,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;aACjE,CAAC;YACF,mBAAmB,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI;SAChD,CAAC,CAAC;IACL,CAAC;IAED,IAAI,YAAY,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,UAAU,CAAC,IAAI,CAAC;YACd,EAAE,EAAE,eAAe;YACnB,QAAQ,EAAE,SAAS;YACnB,GAAG,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC;gBAC3B,SAAS,EAAE,KAAK,CAAC,WAAW;gBAC5B,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,YAAY;gBACpC,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,aAAa;gBACtC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK;gBACxB,SAAS,EAAE,KAAK,CAAC,YAAY;gBAC7B,UAAU,EAAE,KAAK,CAAC,aAAa;aAChC,CAAC;YACF,mBAAmB,EAAE,IAAI;SAC1B,CAAC,CAAC;IACL,CAAC;IAED,4EAA4E;IAC5E,0EAA0E;IAC1E,6EAA6E;IAC7E,oCAAoC;IACpC,MAAM,cAAc,GAAyC;QAC3D,OAAO,EAAE,CAAC;QACV,WAAW,EAAE,CAAC;QACd,IAAI,EAAE,CAAC;KACR,CAAC;IAEF,OAAO,UAAU,CAAC,IAAI,CACpB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC;QACvD,CAAC,CAAC,CAAC,mBAAmB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,IAAI,CAAC,CAAC,CAC9D,CAAC;AACJ,CAAC"}