@aglyn/plugins-ai 1.0.0-beta.143

package/src/lib/usage/assist-signal-mining.js

@@ -0,0 +1,344 @@
+import { _ as _extends } from "@swc/helpers/_/_extends";
+import { _ as _object_without_properties_loose } from "@swc/helpers/_/_object_without_properties_loose";
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * 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.
+ */ import { assistProviderCostUsd, ASSIST_PROVIDER_COST_FIELD } from "@aglyn/aglyn/app-utils/assist-credits";
+import { aiCacheHitRate } from "../model/ai-tokens.js";
+import { aiUsageKindFromRoute } from "../model/ai-usage-by-user.js";
+/** The kinds as the board lists them, dearest first. */ export function kindTokenRows(split) {
+    return Object.entries(split).map(([kind, value])=>_extends({
+            kind
+        }, value)).sort((a, b)=>b.providerCostUsd - a.providerCostUsd || b.messages - a.messages || a.kind.localeCompare(b.kind));
+}
+/** A sample's value at a percentile by nearest rank — always one that was seen; 0 for none. */ export function nearestRankPercentile(values, percentile) {
+    if (!values.length) return 0;
+    const sorted = [
+        ...values
+    ].sort((a, b)=>a - b);
+    const rank = Math.min(sorted.length, Math.max(1, Math.ceil(percentile * sorted.length)));
+    return sorted[rank - 1];
+}
+/**
+ * A cost breakdown as a sorted, labelled list — dearest first (AGL-2340).
+ *
+ * Exported because the ordering is the readable half. A breakdown in
+ * whatever order the keys happened to be inserted is a table you have to
+ * scan; the point of the panel is that the expensive line is the top line.
+ */ export function costSplitRows(split) {
+    return Object.entries(split).map(([key, value])=>({
+            key,
+            messages: value.messages,
+            providerCostUsd: value.providerCostUsd
+        })).sort((a, b)=>b.providerCostUsd - a.providerCostUsd || a.key.localeCompare(b.key));
+}
+/** The Free taste's refusals as one figure: the board names the wall, not each rung. */ export function freeTasteRefusals(refusals) {
+    return refusals.account + refusals.requests + refusals.refusals + refusals.platform;
+}
+/**
+ * The leaderboard's ordering: dearest first, then most credits, then by id
+ * so two equal rows render in one stable order rather than the order the
+ * scan happened to return them in. Returns the top `limit` and how many
+ * were ranked, so the page can say "top 25 of 140" rather than imply the
+ * cut is the whole fleet.
+ */ export function rankAssistSpend(rows, limit) {
+    const sorted = [
+        ...rows
+    ].sort((a, b)=>b.providerCostUsd - a.providerCostUsd || b.credits - a.credits || a.orgId.localeCompare(b.orgId));
+    const cap = Number.isFinite(limit) && limit > 0 ? Math.floor(limit) : sorted.length;
+    return {
+        rows: sorted.slice(0, cap),
+        ranked: sorted.length
+    };
+}
+const number = (value)=>{
+    const parsed = Number(value != null ? value : 0);
+    return Number.isFinite(parsed) ? parsed : 0;
+};
+/** A signal's kind: the field once it is written, else read off its route (AGL-2937). */ function signalKind(data, route) {
+    const kind = data['kind'];
+    if (typeof kind === 'string' && kind) return kind;
+    // A job step was metered under this route before its signal named the kind.
+    return route === 'ai/jobs' ? 'job' : aiUsageKindFromRoute(route);
+}
+/**
+ * Normalize one raw signal document. Every field is defaulted, because a
+ * signal written by an older build is still evidence and dropping it would
+ * bias the ranking toward whatever shipped most recently.
+ */ export function assistSignalRow(orgId, exchangeId, data) {
+    var _data_route, _data_model, _data_tier;
+    const rawPaths = Array.isArray(data['docsPaths']) ? data['docsPaths'] : [];
+    const feedback = data['feedback'];
+    const route = String((_data_route = data['route']) != null ? _data_route : '');
+    return {
+        orgId,
+        exchangeId,
+        route,
+        kind: signalKind(data, route),
+        model: String((_data_model = data['model']) != null ? _data_model : 'unknown'),
+        tier: String((_data_tier = data['tier']) != null ? _data_tier : 'unknown'),
+        inputTokens: number(data['inputTokens']),
+        outputTokens: number(data['outputTokens']),
+        cacheReadTokens: number(data['cacheReadTokens']),
+        cacheWriteTokens: number(data['cacheWriteTokens']),
+        // What the turn COST US (AGL-3015). The stored `estCostUsd` beside it
+        // is the same turn at BILLED rates — the figure the customer's credits
+        // came out of — and every dollar on the signals page is asking the other
+        // question. A signal written before the split carries only the billed
+        // figure, which over-reads our bill rather than under-reads it.
+        providerCostUsd: assistProviderCostUsd(data['estCostUsd'], data[ASSIST_PROVIDER_COST_FIELD]),
+        docsPaths: rawPaths.map((path)=>String(path)).filter(Boolean),
+        stopReason: data['stopReason'] == null ? null : String(data['stopReason']),
+        feedback: feedback === 'up' || feedback === 'down' ? feedback : null,
+        // Strict `=== true`, so a signal written before the field existed reads
+        // as "served by a model" rather than as deflected. Defaulting the other
+        // way would credit historic turns with a saving that never happened and
+        // make the rate look best on the day it shipped.
+        deflected: data['deflected'] === true
+    };
+}
+/** Accumulate one turn's spend into a `byTier`/`byModel` bucket. */ function addToSplit(split, key, providerCostUsd) {
+    var _split_key;
+    const bucket = (_split_key = split[key]) != null ? _split_key : {
+        messages: 0,
+        providerCostUsd: 0
+    };
+    bucket.messages += 1;
+    bucket.providerCostUsd += providerCostUsd;
+    split[key] = bucket;
+}
+/**
+ * Rank the docs gaps and roll the money up.
+ *
+ * `truncated` is carried through rather than hidden. A sweep that quietly
+ * stops at a ceiling and presents the remainder as the whole is the AGL-2220
+ * defect, and it is worse here than there: a partial sample of a RANKING
+ * looks exactly like a complete one, and the thing being ranked is where to
+ * spend documentation effort.
+ */ export function mineAssistSignals(rows, options = {}) {
+    var _options_limit;
+    const limit = (_options_limit = options.limit) != null ? _options_limit : 25;
+    const totals = {
+        messages: 0,
+        inputTokens: 0,
+        outputTokens: 0,
+        cacheReadTokens: 0,
+        cacheWriteTokens: 0,
+        providerCostUsd: 0,
+        deflected: 0,
+        deflectionRate: null,
+        cacheReadRate: null,
+        byTier: {},
+        byModel: {},
+        byKind: {},
+        stopReasons: {},
+        feedback: {
+            up: 0,
+            down: 0,
+            none: 0
+        }
+    };
+    const gaps = new Map();
+    const ungroundedRoutes = new Map();
+    const orgs = new Map();
+    const proseCandidates = [];
+    const kinds = new Map();
+    let ungroundedQuestions = 0;
+    let ungroundedDown = 0;
+    for (const row of rows){
+        var _row_stopReason, _totals_stopReasons_stop, _orgs_get;
+        totals.messages += 1;
+        totals.inputTokens += row.inputTokens;
+        totals.outputTokens += row.outputTokens;
+        totals.cacheReadTokens += row.cacheReadTokens;
+        totals.cacheWriteTokens += row.cacheWriteTokens;
+        totals.providerCostUsd += row.providerCostUsd;
+        if (row.deflected) totals.deflected += 1;
+        addToSplit(totals.byTier, row.tier, row.providerCostUsd);
+        addToSplit(totals.byModel, row.model, row.providerCostUsd);
+        if (!row.deflected) {
+            var _kinds_get;
+            const kind = row.kind || 'unknown';
+            const bucket = (_kinds_get = kinds.get(kind)) != null ? _kinds_get : {
+                messages: 0,
+                providerCostUsd: 0,
+                inputTokens: 0,
+                outputTokens: 0,
+                cacheReadTokens: 0,
+                cacheWriteTokens: 0,
+                outputs: []
+            };
+            bucket.messages += 1;
+            bucket.providerCostUsd += row.providerCostUsd;
+            bucket.inputTokens += row.inputTokens;
+            bucket.outputTokens += row.outputTokens;
+            bucket.cacheReadTokens += row.cacheReadTokens;
+            bucket.cacheWriteTokens += row.cacheWriteTokens;
+            bucket.outputs.push(row.outputTokens);
+            kinds.set(kind, bucket);
+        }
+        const stop = (_row_stopReason = row.stopReason) != null ? _row_stopReason : 'none';
+        totals.stopReasons[stop] = ((_totals_stopReasons_stop = totals.stopReasons[stop]) != null ? _totals_stopReasons_stop : 0) + 1;
+        if (row.feedback === 'up') totals.feedback.up += 1;
+        else if (row.feedback === 'down') totals.feedback.down += 1;
+        else totals.feedback.none += 1;
+        const org = (_orgs_get = orgs.get(row.orgId)) != null ? _orgs_get : {
+            orgId: row.orgId,
+            messages: 0,
+            inputTokens: 0,
+            outputTokens: 0,
+            cacheReadTokens: 0,
+            cacheWriteTokens: 0,
+            providerCostUsd: 0,
+            down: 0
+        };
+        org.messages += 1;
+        org.inputTokens += row.inputTokens;
+        org.outputTokens += row.outputTokens;
+        org.cacheReadTokens += row.cacheReadTokens;
+        org.cacheWriteTokens += row.cacheWriteTokens;
+        org.providerCostUsd += row.providerCostUsd;
+        if (row.feedback === 'down') org.down += 1;
+        orgs.set(row.orgId, org);
+        /**
+     * A FAILING turn. Thumbs-down, or nothing retrieved at all (AGL-2314).
+     *
+     * Collected before the `continue` below, so an ungrounded turn — the case
+     * that leaves the loop early — is not silently excluded from the very
+     * shortlist it most belongs on.
+     */ if (row.feedback === 'down' || !row.docsPaths.length) {
+            proseCandidates.push({
+                orgId: row.orgId,
+                exchangeId: row.exchangeId,
+                route: row.route || '(unknown)',
+                feedback: row.feedback,
+                grounded: row.docsPaths.length > 0
+            });
+        }
+        if (!row.docsPaths.length) {
+            var _ungroundedRoutes_get;
+            // Retrieval matched nothing. Counted here and NOT in `docsGaps` — a
+            // question with no citation has no path to rank under, which is
+            // precisely why a path-keyed ranking cannot see a missing page.
+            ungroundedQuestions += 1;
+            if (row.feedback === 'down') ungroundedDown += 1;
+            const route = row.route || '(unknown)';
+            const entry = (_ungroundedRoutes_get = ungroundedRoutes.get(route)) != null ? _ungroundedRoutes_get : {
+                route,
+                questions: 0,
+                down: 0
+            };
+            entry.questions += 1;
+            if (row.feedback === 'down') entry.down += 1;
+            ungroundedRoutes.set(route, entry);
+            continue;
+        }
+        // Cost is attributed to EVERY path the turn cited, so the column is
+        // "what did questions touching this page cost", not a partition of the
+        // total. Splitting a turn's cost across its citations would understate
+        // an expensive page that is always cited alongside others, and the
+        // column exists to find pages worth rewriting, not to balance a ledger.
+        for (const path of new Set(row.docsPaths)){
+            var _gaps_get;
+            const entry = (_gaps_get = gaps.get(path)) != null ? _gaps_get : {
+                row: {
+                    path,
+                    questions: 0,
+                    up: 0,
+                    down: 0,
+                    providerCostUsd: 0
+                },
+                orgs: new Set()
+            };
+            entry.row.questions += 1;
+            entry.row.providerCostUsd += row.providerCostUsd;
+            if (row.feedback === 'up') entry.row.up += 1;
+            if (row.feedback === 'down') entry.row.down += 1;
+            entry.orgs.add(row.orgId);
+            gaps.set(path, entry);
+        }
+    }
+    /**
+   * Thumbs-down first, then the ungrounded ones.
+   *
+   * A rated failure is somebody telling us the answer was wrong; an
+   * ungrounded turn is us telling ourselves we had nothing to answer with.
+   * Both are worth reading, and the first is worth reading first.
+   */ proseCandidates.sort((a, b)=>{
+        const rank = (candidate)=>candidate.feedback === 'down' ? 0 : 1;
+        return rank(a) - rank(b);
+    });
+    totals.cacheReadRate = aiCacheHitRate({
+        input: totals.inputTokens,
+        cached: totals.cacheReadTokens,
+        cacheWrite: totals.cacheWriteTokens
+    });
+    for (const _ref of kinds){
+        let [kind, _ref1] = _ref, { outputs } = _ref1, bucket = _object_without_properties_loose(_ref1, [
+            "outputs"
+        ]);
+        totals.byKind[kind] = _extends({}, bucket, {
+            outputP95: nearestRankPercentile(outputs, 0.95),
+            cacheHitRate: aiCacheHitRate({
+                input: bucket.inputTokens,
+                cached: bucket.cacheReadTokens,
+                cacheWrite: bucket.cacheWriteTokens
+            })
+        });
+    }
+    totals.deflectionRate = totals.messages ? totals.deflected / totals.messages : null;
+    const docsGaps = [
+        ...gaps.values()
+    ].map(({ row, orgs: orgSet })=>{
+        const rated = row.up + row.down;
+        return _extends({}, row, {
+            orgs: orgSet.size,
+            downRate: rated ? row.down / rated : null
+        });
+    })// Thumbs-down first, then volume. Ranking on volume alone surfaces the
+    // pages people read most, which is a popularity list and not a gap list;
+    // ranking on rate alone puts a single grumpy rating above a page that
+    // failed forty people. Down count leads, volume breaks the tie.
+    .sort((a, b)=>b.down - a.down || b.questions - a.questions).slice(0, limit);
+    const ungroundedRouteRows = [
+        ...ungroundedRoutes.values()
+    ].sort((a, b)=>b.questions - a.questions || b.down - a.down);
+    const orgRows = [
+        ...orgs.values()
+    ].sort((a, b)=>b.providerCostUsd - a.providerCostUsd || b.messages - a.messages);
+    return {
+        scanned: rows.length,
+        truncated: Boolean(options.truncated),
+        totals,
+        docsGaps,
+        ranked: {
+            // `gaps` rather than `docsGaps`: the latter is already sliced, so
+            // measuring it would report the cap as the total and the disclosure
+            // would agree with itself forever.
+            docsGaps: gaps.size,
+            ungroundedRoutes: ungroundedRoutes.size,
+            orgs: orgs.size
+        },
+        proseCandidates: proseCandidates.slice(0, limit),
+        ungrounded: {
+            questions: ungroundedQuestions,
+            down: ungroundedDown,
+            routes: ungroundedRouteRows.slice(0, limit)
+        },
+        orgs: orgRows.slice(0, limit)
+    };
+}
+
+//# sourceMappingURL=assist-signal-mining.js.map

package/src/lib/usage/assist-signal-mining.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/usage/assist-signal-mining.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  assistProviderCostUsd,\n  ASSIST_PROVIDER_COST_FIELD,\n} from '@aglyn/aglyn/app-utils/assist-credits'\nimport { aiCacheHitRate } from '../model/ai-tokens'\nimport { aiUsageKindFromRoute } from '../model/ai-usage-by-user'\n\n/**\n * The read side of the Aglyn Assist data loop (AGL-1860, AGL-2252).\n *\n * `orgs/{id}/assistSignals/{id}` is written on every assist turn and, until\n * this module, was read by nothing. That is a specific kind of failure: the\n * signal document exists BECAUSE AGL-1972 split the prose from the analytics\n * so the corpus could outlive the 180-day expiry on what people typed. A\n * corpus preserved for a reader that does not exist is just retention.\n *\n * Three questions, answered from one pass:\n *\n *  1. **Where are the docs thin?** Rank the cited docs paths by how often a\n *     question landed on them and how often the answer was rated down. A\n *     page cited constantly and rated down is a page that is being FOUND and\n *     is not answering — the single most actionable row in the set, and the\n *     one AGL-1860 wants turned into a docs issue.\n *  2. **What did retrieval miss entirely?** A turn with no `docsPaths` is a\n *     question the corpus could not match at all, so the model answered\n *     ungrounded. That is a sharper gap signal than a low rating, and it is\n *     invisible in any ranking keyed on paths — a missing page cites nothing,\n *     so it appears nowhere. It is counted separately, by ROUTE, so the gap\n *     comes with the screen the person was looking at when they hit it.\n *  3. **What is this costing, and to whom?** Per-org and fleet-wide token and\n *     dollar rollups, plus the cache-read rate. That last one settles a\n *     question the chat route could only pose: the cached system prefix\n *     measures 1,030–1,190 tokens against Sonnet 5's 1,024-token minimum, so\n *     whether it caches at all is an empirical question and `cacheReadTokens`\n *     is the only evidence. A prefix under the minimum caches silently not at\n *     all, and the bill is the only place it shows.\n *\n * Pure and free of Firestore, so it can be tested on fixtures rather than on\n * a mocked SDK — the route does the reading, this does the arithmetic.\n */\n\n/** One `assistSignals` document, as the route projects it. */\nexport interface AssistSignalRow {\n  orgId: string\n  /**\n   * The signal's document id, which IS the exchange's id (AGL-2314).\n   *\n   * `recordAssistExchange` mints one id and writes both halves under it —\n   * `assistExchanges/{id}` for the prose that expires and `assistSignals/{id}`\n   * for the analytics that do not — deliberately, \"so an exchange and its\n   * signal are joinable for as long as both exist, without storing a second\n   * pointer that could rot\". Nothing ever made the join. This is the field\n   * that lets the corpus be read.\n   */\n  exchangeId: string\n  route: string\n  /**\n   * What the turn was for, as the rollups name it (AGL-2937): `assist`, a\n   * besigner mode, or a job kind. A signal written before the field is read\n   * by its route, where a generation job's step reads as `job`.\n   */\n  kind?: string\n  model: string\n  tier: 'free' | 'entitled' | string\n  inputTokens: number\n  outputTokens: number\n  cacheReadTokens: number\n  cacheWriteTokens: number\n  /**\n   * What this turn cost us, at the serving model's provider rates. Every\n   * dollar mined out of this module is that figure: the signals page asks\n   * one money question and it is \"what are we spending\" (AGL-3015).\n   */\n  providerCostUsd: number\n  docsPaths: string[]\n  stopReason: string | null\n  feedback: 'up' | 'down' | null\n  /** Served with no model call — docs retrieval or a cache hit (AGL-2486). */\n  deflected: boolean\n}\n\nexport interface DocsGapRow {\n  path: string\n  /** Turns that cited this path. */\n  questions: number\n  up: number\n  down: number\n  /** Distinct orgs that landed here — a gap one org has is not a gap. */\n  orgs: number\n  providerCostUsd: number\n  /** `down / (up + down)`, or null when nobody rated. */\n  downRate: number | null\n}\n\nexport interface UngroundedRoute {\n  route: string\n  questions: number\n  down: number\n}\n\n/**\n * A turn whose PROSE is worth reading (AGL-2314).\n *\n * `assistExchanges` holds the verbatim half — the question a customer typed\n * and the answer we gave — for 180 days, and the module header calls it \"the\n * data loop's corpus\". No corpus consumer existed: nothing in the repo read\n * the collection, so we were retaining customers' words, and publicly\n * promising to, for zero product value.\n *\n * The shortlist is deliberately NOT every turn. Prose is fetched only for\n * turns that FAILED — rated thumbs-down, or grounded in no documentation at\n * all — because those are the ones where the counts cannot say what went\n * wrong and the words can. Reading the successful ones would be surveillance\n * with a dashboard on it.\n */\nexport interface ProseCandidate {\n  orgId: string\n  /**\n   * That workspace by name, filled in by the route.\n   *\n   * Optional because this module is pure and Firestore-free: it can count a\n   * workspace's turns and it cannot know what the workspace is called. The\n   * route resolves the labels and the reader falls back to the id, so a\n   * workspace outside the lookup is still a lead somebody can search for.\n   */\n  orgLabel?: string | null\n  exchangeId: string\n  /** The console screen the question was asked from. */\n  route: string\n  feedback: 'up' | 'down' | null\n  /** False when retrieval cited no documentation at all. */\n  grounded: boolean\n}\n\nexport interface OrgCostRow {\n  orgId: string\n  /** That workspace by name — see {@link ProseCandidate.orgLabel}. */\n  orgLabel?: string | null\n  messages: number\n  inputTokens: number\n  outputTokens: number\n  cacheReadTokens: number\n  cacheWriteTokens: number\n  providerCostUsd: number\n  down: number\n}\n\n/** One row of a cost breakdown — see `totals.byTier` / `totals.byModel`. */\nexport interface CostSplit {\n  messages: number\n  providerCostUsd: number\n}\n\n/** One kind of model turn, summed (AGL-2937) — see `totals.byKind`. */\nexport interface KindTokenSplit {\n  messages: number\n  providerCostUsd: number\n  inputTokens: number\n  outputTokens: number\n  cacheReadTokens: number\n  cacheWriteTokens: number\n  /**\n   * The output 95 of every 100 turns of this kind stayed within, by nearest\n   * rank — the figure a kind's `max_tokens` is sized against.\n   */\n  outputP95: number\n  /** The share of this kind's prompt tokens the cache served — `aiCacheHitRate`. */\n  cacheHitRate: number | null\n}\n\n/** The kinds as the board lists them, dearest first. */\nexport function kindTokenRows(\n  split: Record<string, KindTokenSplit>,\n): Array<KindTokenSplit & { kind: string }> {\n  return Object.entries(split)\n    .map(([kind, value]) => ({ kind, ...value }))\n    .sort(\n      (a, b) =>\n        b.providerCostUsd - a.providerCostUsd || b.messages - a.messages || a.kind.localeCompare(b.kind),\n    )\n}\n\n/** A sample's value at a percentile by nearest rank — always one that was seen; 0 for none. */\nexport function nearestRankPercentile(values: readonly number[], percentile: number): number {\n  if (!values.length) return 0\n  const sorted = [...values].sort((a, b) => a - b)\n  const rank = Math.min(sorted.length, Math.max(1, Math.ceil(percentile * sorted.length)))\n  return sorted[rank - 1]\n}\n\n/**\n * A cost breakdown as a sorted, labelled list — dearest first (AGL-2340).\n *\n * Exported because the ordering is the readable half. A breakdown in\n * whatever order the keys happened to be inserted is a table you have to\n * scan; the point of the panel is that the expensive line is the top line.\n */\nexport function costSplitRows(\n  split: Record<string, CostSplit>,\n): { key: string; messages: number; providerCostUsd: number }[] {\n  return Object.entries(split)\n    .map(([key, value]) => ({\n      key,\n      messages: value.messages,\n      providerCostUsd: value.providerCostUsd,\n    }))\n    .sort((a, b) => b.providerCostUsd - a.providerCostUsd || a.key.localeCompare(b.key))\n}\n\n/**\n * One workspace on the month's spend leaderboard (AGL-2930).\n *\n * Read off `assistUsage/{month}` rather than off the signals: the signals\n * carry every turn ever recorded and no month, so ranking them answers\n * \"who has spent the most since the beginning\", and the board's question is\n * \"who is spending the most NOW\". The month document is also where the\n * refusal counter lives, so the row can say how often the org was refused\n * beside how much it spent — the two numbers a staff reader compares.\n */\nexport interface AssistSpendRow {\n  orgId: string\n  orgLabel?: string | null\n  plan: string\n  aiAddon: boolean\n  /** Credits drawn this month, from the measured spend. */\n  credits: number\n  providerCostUsd: number\n  refusals: {\n    band: number\n    cap: number\n    messages: number\n    budget: number\n    /** A hard AI allotment a manager set (AGL-2942). */\n    allotment: number\n    /** The Free taste's rungs (AGL-2925); zero on every paid workspace. */\n    account: number\n    requests: number\n    refusals: number\n    platform: number\n    total: number\n  }\n}\n\n/** The Free taste's refusals as one figure: the board names the wall, not each rung. */\nexport function freeTasteRefusals(refusals: AssistSpendRow['refusals']): number {\n  return refusals.account + refusals.requests + refusals.refusals + refusals.platform\n}\n\n/**\n * The leaderboard's ordering: dearest first, then most credits, then by id\n * so two equal rows render in one stable order rather than the order the\n * scan happened to return them in. Returns the top `limit` and how many\n * were ranked, so the page can say \"top 25 of 140\" rather than imply the\n * cut is the whole fleet.\n */\nexport function rankAssistSpend(\n  rows: readonly AssistSpendRow[],\n  limit: number,\n): { rows: AssistSpendRow[]; ranked: number } {\n  const sorted = [...rows].sort(\n    (a, b) =>\n      b.providerCostUsd - a.providerCostUsd ||\n      b.credits - a.credits ||\n      a.orgId.localeCompare(b.orgId),\n  )\n  const cap = Number.isFinite(limit) && limit > 0 ? Math.floor(limit) : sorted.length\n  return { rows: sorted.slice(0, cap), ranked: sorted.length }\n}\n\n/**\n * Today's platform-wide free-tier AI spend against its daily ceiling\n * (AGL-2925), as the route reads it beside the mined signals. Declared here,\n * where the page's report type lives, so the client page needs no import\n * from the admin library to name it.\n */\nexport interface AssistFreeSpendReadout {\n  /** The UTC day the figures describe. */\n  day: string\n  /**\n   * The day's free spend as the CEILING measures it — the billed figure,\n   * because the ceiling this is compared against was sized against it and\n   * the reservation refuses on the same reading (AGL-3015). The one dollar\n   * on this page that is not our provider bill, and it is a wall rather than\n   * a cost.\n   */\n  estCostUsd: number\n  requests: number\n  refusals: number\n  ceilingUsd: number\n  /** True once staff were mailed at 80% today. */\n  alerted: boolean\n  /** True while every Free workspace is refused generation for the day. */\n  paused: boolean\n}\n\nexport interface AssistMiningReport {\n  scanned: number\n  /** True when the read hit its ceiling — see `mineAssistSignals`. */\n  truncated: boolean\n  totals: {\n    messages: number\n    inputTokens: number\n    outputTokens: number\n    cacheReadTokens: number\n    cacheWriteTokens: number\n    providerCostUsd: number\n    /**\n     * Turns answered with NO model call — docs retrieval or an answer-cache\n     * hit (AGL-2486). Counted separately from `messages`, which is every\n     * turn, so `deflected / messages` is the deflection rate.\n     */\n    deflected: number\n    /**\n     * That rate, or `null` when nothing was scanned.\n     *\n     * Nullable rather than 0 for the reason `costUsd` on a reservation is:\n     * \"no turns were scanned\" and \"every turn cost a model call\" are opposite\n     * findings, and 0 says the second one when the truth is the first. This\n     * is the headline number for whether Assist is affordable to leave on,\n     * and it must not be able to report a false alarm on an idle month.\n     */\n    deflectionRate: number | null\n    /**\n     * Share of prompt tokens served from cache — reads over everything the\n     * prompts were billed as, cache writes included (`aiCacheHitRate`) — or\n     * null at zero.\n     */\n    cacheReadRate: number | null\n    /**\n     * Cost split by entitlement tier, then by model (AGL-2340).\n     *\n     * Both carried as `{ messages, providerCostUsd }` rather than a bare turn\n     * count, because the questions these answer are money questions and a\n     * count cannot answer either of them. `byTier` settles \"is the free tier\n     * eating the margin, or are paying orgs?\" — the free tier can be a\n     * minority of turns and a majority of spend, and a count says the\n     * opposite of the truth in exactly that case. `byModel` settles \"would a\n     * cheaper model on the common path fix this?\", where the whole point is\n     * that turns and dollars do not move together.\n     */\n    byTier: Record<string, CostSplit>\n    byModel: Record<string, CostSplit>\n    /**\n     * Model turns split by what they were for (AGL-2937): cost, the four\n     * token counts, the p95 output and the cache hit rate of each kind. A\n     * turn answered with no model call has no tokens to split and is left\n     * out.\n     */\n    byKind: Record<string, KindTokenSplit>\n    stopReasons: Record<string, number>\n    feedback: { up: number; down: number; none: number }\n  }\n  docsGaps: DocsGapRow[]\n  /**\n   * How tall each ranking was BEFORE it was cut to `limit`.\n   *\n   * `truncated` reports only that the SCAN hit its ceiling. It says nothing\n   * about the rankings built from what was scanned, and those are cut too —\n   * every list below is sliced to `limit`. A table showing twenty-five of a\n   * hundred and thirty-seven cited pages looks exactly like one showing all\n   * twenty-five there are, which is the AGL-2220 shape the scan ceiling was\n   * given a banner to avoid, reproduced one layer down.\n   *\n   * Counted rather than inferred from `length === limit`: a ranking that is\n   * exactly `limit` rows tall is the case where the guess is wrong in both\n   * directions.\n   */\n  ranked: {\n    docsGaps: number\n    ungroundedRoutes: number\n    orgs: number\n  }\n  /**\n   * Today's free-tier spend against the platform ceiling (AGL-2925).\n   * Optional because the miner is pure and does not produce it — the route\n   * reads it from Firestore and attaches it beside the mined report.\n   */\n  freeSpend?: AssistFreeSpendReadout\n  /** Turns whose words are worth reading — see {@link ProseCandidate}. */\n  proseCandidates: ProseCandidate[]\n  ungrounded: {\n    questions: number\n    down: number\n    routes: UngroundedRoute[]\n  }\n  orgs: OrgCostRow[]\n}\n\nconst number = (value: unknown) => {\n  const parsed = Number(value ?? 0)\n  return Number.isFinite(parsed) ? parsed : 0\n}\n\n/** A signal's kind: the field once it is written, else read off its route (AGL-2937). */\nfunction signalKind(data: Record<string, unknown>, route: string): string {\n  const kind = data['kind']\n  if (typeof kind === 'string' && kind) return kind\n  // A job step was metered under this route before its signal named the kind.\n  return route === 'ai/jobs' ? 'job' : aiUsageKindFromRoute(route)\n}\n\n/**\n * Normalize one raw signal document. Every field is defaulted, because a\n * signal written by an older build is still evidence and dropping it would\n * bias the ranking toward whatever shipped most recently.\n */\nexport function assistSignalRow(\n  orgId: string,\n  exchangeId: string,\n  data: Record<string, unknown>,\n): AssistSignalRow {\n  const rawPaths = Array.isArray(data['docsPaths']) ? data['docsPaths'] : []\n  const feedback = data['feedback']\n  const route = String(data['route'] ?? '')\n  return {\n    orgId,\n    exchangeId,\n    route,\n    kind: signalKind(data, route),\n    model: String(data['model'] ?? 'unknown'),\n    tier: String(data['tier'] ?? 'unknown'),\n    inputTokens: number(data['inputTokens']),\n    outputTokens: number(data['outputTokens']),\n    cacheReadTokens: number(data['cacheReadTokens']),\n    cacheWriteTokens: number(data['cacheWriteTokens']),\n    // What the turn COST US (AGL-3015). The stored `estCostUsd` beside it\n    // is the same turn at BILLED rates — the figure the customer's credits\n    // came out of — and every dollar on the signals page is asking the other\n    // question. A signal written before the split carries only the billed\n    // figure, which over-reads our bill rather than under-reads it.\n    providerCostUsd: assistProviderCostUsd(\n      data['estCostUsd'],\n      data[ASSIST_PROVIDER_COST_FIELD],\n    ),\n    docsPaths: rawPaths.map((path) => String(path)).filter(Boolean),\n    stopReason: data['stopReason'] == null ? null : String(data['stopReason']),\n    feedback: feedback === 'up' || feedback === 'down' ? feedback : null,\n    // Strict `=== true`, so a signal written before the field existed reads\n    // as \"served by a model\" rather than as deflected. Defaulting the other\n    // way would credit historic turns with a saving that never happened and\n    // make the rate look best on the day it shipped.\n    deflected: data['deflected'] === true,\n  }\n}\n\n/** Accumulate one turn's spend into a `byTier`/`byModel` bucket. */\nfunction addToSplit(\n  split: Record<string, CostSplit>,\n  key: string,\n  providerCostUsd: number,\n) {\n  const bucket = split[key] ?? { messages: 0, providerCostUsd: 0 }\n  bucket.messages += 1\n  bucket.providerCostUsd += providerCostUsd\n  split[key] = bucket\n}\n\n/**\n * Rank the docs gaps and roll the money up.\n *\n * `truncated` is carried through rather than hidden. A sweep that quietly\n * stops at a ceiling and presents the remainder as the whole is the AGL-2220\n * defect, and it is worse here than there: a partial sample of a RANKING\n * looks exactly like a complete one, and the thing being ranked is where to\n * spend documentation effort.\n */\nexport function mineAssistSignals(\n  rows: AssistSignalRow[],\n  options: { truncated?: boolean; limit?: number } = {},\n): AssistMiningReport {\n  const limit = options.limit ?? 25\n  const totals = {\n    messages: 0,\n    inputTokens: 0,\n    outputTokens: 0,\n    cacheReadTokens: 0,\n    cacheWriteTokens: 0,\n    providerCostUsd: 0,\n    deflected: 0,\n    deflectionRate: null as number | null,\n    cacheReadRate: null as number | null,\n    byTier: {} as Record<string, CostSplit>,\n    byModel: {} as Record<string, CostSplit>,\n    byKind: {} as Record<string, KindTokenSplit>,\n    stopReasons: {} as Record<string, number>,\n    feedback: { up: 0, down: 0, none: 0 },\n  }\n\n  const gaps = new Map<\n    string,\n    { row: Omit<DocsGapRow, 'orgs' | 'downRate'>; orgs: Set<string> }\n  >()\n  const ungroundedRoutes = new Map<string, UngroundedRoute>()\n  const orgs = new Map<string, OrgCostRow>()\n  const proseCandidates: ProseCandidate[] = []\n  const kinds = new Map<\n    string,\n    Omit<KindTokenSplit, 'outputP95' | 'cacheHitRate'> & { outputs: number[] }\n  >()\n  let ungroundedQuestions = 0\n  let ungroundedDown = 0\n\n  for (const row of rows) {\n    totals.messages += 1\n    totals.inputTokens += row.inputTokens\n    totals.outputTokens += row.outputTokens\n    totals.cacheReadTokens += row.cacheReadTokens\n    totals.cacheWriteTokens += row.cacheWriteTokens\n    totals.providerCostUsd += row.providerCostUsd\n    if (row.deflected) totals.deflected += 1\n    addToSplit(totals.byTier, row.tier, row.providerCostUsd)\n    addToSplit(totals.byModel, row.model, row.providerCostUsd)\n    if (!row.deflected) {\n      const kind = row.kind || 'unknown'\n      const bucket = kinds.get(kind) ?? {\n        messages: 0,\n        providerCostUsd: 0,\n        inputTokens: 0,\n        outputTokens: 0,\n        cacheReadTokens: 0,\n        cacheWriteTokens: 0,\n        outputs: [],\n      }\n      bucket.messages += 1\n      bucket.providerCostUsd += row.providerCostUsd\n      bucket.inputTokens += row.inputTokens\n      bucket.outputTokens += row.outputTokens\n      bucket.cacheReadTokens += row.cacheReadTokens\n      bucket.cacheWriteTokens += row.cacheWriteTokens\n      bucket.outputs.push(row.outputTokens)\n      kinds.set(kind, bucket)\n    }\n    const stop = row.stopReason ?? 'none'\n    totals.stopReasons[stop] = (totals.stopReasons[stop] ?? 0) + 1\n    if (row.feedback === 'up') totals.feedback.up += 1\n    else if (row.feedback === 'down') totals.feedback.down += 1\n    else totals.feedback.none += 1\n\n    const org = orgs.get(row.orgId) ?? {\n      orgId: row.orgId,\n      messages: 0,\n      inputTokens: 0,\n      outputTokens: 0,\n      cacheReadTokens: 0,\n      cacheWriteTokens: 0,\n      providerCostUsd: 0,\n      down: 0,\n    }\n    org.messages += 1\n    org.inputTokens += row.inputTokens\n    org.outputTokens += row.outputTokens\n    org.cacheReadTokens += row.cacheReadTokens\n    org.cacheWriteTokens += row.cacheWriteTokens\n    org.providerCostUsd += row.providerCostUsd\n    if (row.feedback === 'down') org.down += 1\n    orgs.set(row.orgId, org)\n\n    /**\n     * A FAILING turn. Thumbs-down, or nothing retrieved at all (AGL-2314).\n     *\n     * Collected before the `continue` below, so an ungrounded turn — the case\n     * that leaves the loop early — is not silently excluded from the very\n     * shortlist it most belongs on.\n     */\n    if (row.feedback === 'down' || !row.docsPaths.length) {\n      proseCandidates.push({\n        orgId: row.orgId,\n        exchangeId: row.exchangeId,\n        route: row.route || '(unknown)',\n        feedback: row.feedback,\n        grounded: row.docsPaths.length > 0,\n      })\n    }\n\n    if (!row.docsPaths.length) {\n      // Retrieval matched nothing. Counted here and NOT in `docsGaps` — a\n      // question with no citation has no path to rank under, which is\n      // precisely why a path-keyed ranking cannot see a missing page.\n      ungroundedQuestions += 1\n      if (row.feedback === 'down') ungroundedDown += 1\n      const route = row.route || '(unknown)'\n      const entry = ungroundedRoutes.get(route) ?? {\n        route,\n        questions: 0,\n        down: 0,\n      }\n      entry.questions += 1\n      if (row.feedback === 'down') entry.down += 1\n      ungroundedRoutes.set(route, entry)\n      continue\n    }\n\n    // Cost is attributed to EVERY path the turn cited, so the column is\n    // \"what did questions touching this page cost\", not a partition of the\n    // total. Splitting a turn's cost across its citations would understate\n    // an expensive page that is always cited alongside others, and the\n    // column exists to find pages worth rewriting, not to balance a ledger.\n    for (const path of new Set(row.docsPaths)) {\n      const entry = gaps.get(path) ?? {\n        row: { path, questions: 0, up: 0, down: 0, providerCostUsd: 0 },\n        orgs: new Set<string>(),\n      }\n      entry.row.questions += 1\n      entry.row.providerCostUsd += row.providerCostUsd\n      if (row.feedback === 'up') entry.row.up += 1\n      if (row.feedback === 'down') entry.row.down += 1\n      entry.orgs.add(row.orgId)\n      gaps.set(path, entry)\n    }\n  }\n\n  /**\n   * Thumbs-down first, then the ungrounded ones.\n   *\n   * A rated failure is somebody telling us the answer was wrong; an\n   * ungrounded turn is us telling ourselves we had nothing to answer with.\n   * Both are worth reading, and the first is worth reading first.\n   */\n  proseCandidates.sort((a, b) => {\n    const rank = (candidate: ProseCandidate) =>\n      candidate.feedback === 'down' ? 0 : 1\n    return rank(a) - rank(b)\n  })\n\n  totals.cacheReadRate = aiCacheHitRate({\n    input: totals.inputTokens,\n    cached: totals.cacheReadTokens,\n    cacheWrite: totals.cacheWriteTokens,\n  })\n  for (const [kind, { outputs, ...bucket }] of kinds) {\n    totals.byKind[kind] = {\n      ...bucket,\n      outputP95: nearestRankPercentile(outputs, 0.95),\n      cacheHitRate: aiCacheHitRate({\n        input: bucket.inputTokens,\n        cached: bucket.cacheReadTokens,\n        cacheWrite: bucket.cacheWriteTokens,\n      }),\n    }\n  }\n  totals.deflectionRate = totals.messages\n    ? totals.deflected / totals.messages\n    : null\n\n  const docsGaps = [...gaps.values()]\n    .map(({ row, orgs: orgSet }) => {\n      const rated = row.up + row.down\n      return {\n        ...row,\n        orgs: orgSet.size,\n        downRate: rated ? row.down / rated : null,\n      }\n    })\n    // Thumbs-down first, then volume. Ranking on volume alone surfaces the\n    // pages people read most, which is a popularity list and not a gap list;\n    // ranking on rate alone puts a single grumpy rating above a page that\n    // failed forty people. Down count leads, volume breaks the tie.\n    .sort((a, b) => b.down - a.down || b.questions - a.questions)\n    .slice(0, limit)\n\n  const ungroundedRouteRows = [...ungroundedRoutes.values()].sort(\n    (a, b) => b.questions - a.questions || b.down - a.down,\n  )\n  const orgRows = [...orgs.values()].sort(\n    (a, b) => b.providerCostUsd - a.providerCostUsd || b.messages - a.messages,\n  )\n\n  return {\n    scanned: rows.length,\n    truncated: Boolean(options.truncated),\n    totals,\n    docsGaps,\n    ranked: {\n      // `gaps` rather than `docsGaps`: the latter is already sliced, so\n      // measuring it would report the cap as the total and the disclosure\n      // would agree with itself forever.\n      docsGaps: gaps.size,\n      ungroundedRoutes: ungroundedRoutes.size,\n      orgs: orgs.size,\n    },\n    proseCandidates: proseCandidates.slice(0, limit),\n    ungrounded: {\n      questions: ungroundedQuestions,\n      down: ungroundedDown,\n      routes: ungroundedRouteRows.slice(0, limit),\n    },\n    orgs: orgRows.slice(0, limit),\n  }\n}\n"],"names":["assistProviderCostUsd","ASSIST_PROVIDER_COST_FIELD","aiCacheHitRate","aiUsageKindFromRoute","kindTokenRows","split","Object","entries","map","kind","value","sort","a","b","providerCostUsd","messages","localeCompare","nearestRankPercentile","values","percentile","length","sorted","rank","Math","min","max","ceil","costSplitRows","key","freeTasteRefusals","refusals","account","requests","platform","rankAssistSpend","rows","limit","credits","orgId","cap","Number","isFinite","floor","slice","ranked","number","parsed","signalKind","data","route","assistSignalRow","exchangeId","rawPaths","Array","isArray","feedback","String","model","tier","inputTokens","outputTokens","cacheReadTokens","cacheWriteTokens","docsPaths","path","filter","Boolean","stopReason","deflected","addToSplit","bucket","mineAssistSignals","options","totals","deflectionRate","cacheReadRate","byTier","byModel","byKind","stopReasons","up","down","none","gaps","Map","ungroundedRoutes","orgs","proseCandidates","kinds","ungroundedQuestions","ungroundedDown","row","get","outputs","push","set","stop","org","grounded","entry","questions","Set","add","candidate","input","cached","cacheWrite","outputP95","cacheHitRate","docsGaps","orgSet","rated","size","downRate","ungroundedRouteRows","orgRows","scanned","truncated","ungrounded","routes"],"mappings":";;AAAA;;;;;;;;;;;;;;;CAeC,GAED,SACEA,qBAAqB,EACrBC,0BAA0B,QACrB,wCAAuC;AAC9C,SAASC,cAAc,QAAQ,wBAAoB;AACnD,SAASC,oBAAoB,QAAQ,+BAA2B;AAqKhE,sDAAsD,GACtD,OAAO,SAASC,cACdC,KAAqC;IAErC,OAAOC,OAAOC,OAAO,CAACF,OACnBG,GAAG,CAAC,CAAC,CAACC,MAAMC,MAAM,GAAM;YAAED;WAASC,QACnCC,IAAI,CACH,CAACC,GAAGC,IACFA,EAAEC,eAAe,GAAGF,EAAEE,eAAe,IAAID,EAAEE,QAAQ,GAAGH,EAAEG,QAAQ,IAAIH,EAAEH,IAAI,CAACO,aAAa,CAACH,EAAEJ,IAAI;AAEvG;AAEA,6FAA6F,GAC7F,OAAO,SAASQ,sBAAsBC,MAAyB,EAAEC,UAAkB;IACjF,IAAI,CAACD,OAAOE,MAAM,EAAE,OAAO;IAC3B,MAAMC,SAAS;WAAIH;KAAO,CAACP,IAAI,CAAC,CAACC,GAAGC,IAAMD,IAAIC;IAC9C,MAAMS,OAAOC,KAAKC,GAAG,CAACH,OAAOD,MAAM,EAAEG,KAAKE,GAAG,CAAC,GAAGF,KAAKG,IAAI,CAACP,aAAaE,OAAOD,MAAM;IACrF,OAAOC,MAAM,CAACC,OAAO,EAAE;AACzB;AAEA;;;;;;CAMC,GACD,OAAO,SAASK,cACdtB,KAAgC;IAEhC,OAAOC,OAAOC,OAAO,CAACF,OACnBG,GAAG,CAAC,CAAC,CAACoB,KAAKlB,MAAM,GAAM,CAAA;YACtBkB;YACAb,UAAUL,MAAMK,QAAQ;YACxBD,iBAAiBJ,MAAMI,eAAe;QACxC,CAAA,GACCH,IAAI,CAAC,CAACC,GAAGC,IAAMA,EAAEC,eAAe,GAAGF,EAAEE,eAAe,IAAIF,EAAEgB,GAAG,CAACZ,aAAa,CAACH,EAAEe,GAAG;AACtF;AAoCA,sFAAsF,GACtF,OAAO,SAASC,kBAAkBC,QAAoC;IACpE,OAAOA,SAASC,OAAO,GAAGD,SAASE,QAAQ,GAAGF,SAASA,QAAQ,GAAGA,SAASG,QAAQ;AACrF;AAEA;;;;;;CAMC,GACD,OAAO,SAASC,gBACdC,IAA+B,EAC/BC,KAAa;IAEb,MAAMf,SAAS;WAAIc;KAAK,CAACxB,IAAI,CAC3B,CAACC,GAAGC,IACFA,EAAEC,eAAe,GAAGF,EAAEE,eAAe,IACrCD,EAAEwB,OAAO,GAAGzB,EAAEyB,OAAO,IACrBzB,EAAE0B,KAAK,CAACtB,aAAa,CAACH,EAAEyB,KAAK;IAEjC,MAAMC,MAAMC,OAAOC,QAAQ,CAACL,UAAUA,QAAQ,IAAIb,KAAKmB,KAAK,CAACN,SAASf,OAAOD,MAAM;IACnF,OAAO;QAAEe,MAAMd,OAAOsB,KAAK,CAAC,GAAGJ;QAAMK,QAAQvB,OAAOD,MAAM;IAAC;AAC7D;AAyHA,MAAMyB,SAAS,CAACnC;IACd,MAAMoC,SAASN,OAAO9B,gBAAAA,QAAS;IAC/B,OAAO8B,OAAOC,QAAQ,CAACK,UAAUA,SAAS;AAC5C;AAEA,uFAAuF,GACvF,SAASC,WAAWC,IAA6B,EAAEC,KAAa;IAC9D,MAAMxC,OAAOuC,IAAI,CAAC,OAAO;IACzB,IAAI,OAAOvC,SAAS,YAAYA,MAAM,OAAOA;IAC7C,4EAA4E;IAC5E,OAAOwC,UAAU,YAAY,QAAQ9C,qBAAqB8C;AAC5D;AAEA;;;;CAIC,GACD,OAAO,SAASC,gBACdZ,KAAa,EACba,UAAkB,EAClBH,IAA6B;QAIRA,aAMLA,aACDA;IATf,MAAMI,WAAWC,MAAMC,OAAO,CAACN,IAAI,CAAC,YAAY,IAAIA,IAAI,CAAC,YAAY,GAAG,EAAE;IAC1E,MAAMO,WAAWP,IAAI,CAAC,WAAW;IACjC,MAAMC,QAAQO,QAAOR,cAAAA,IAAI,CAAC,QAAQ,YAAbA,cAAiB;IACtC,OAAO;QACLV;QACAa;QACAF;QACAxC,MAAMsC,WAAWC,MAAMC;QACvBQ,OAAOD,QAAOR,cAAAA,IAAI,CAAC,QAAQ,YAAbA,cAAiB;QAC/BU,MAAMF,QAAOR,aAAAA,IAAI,CAAC,OAAO,YAAZA,aAAgB;QAC7BW,aAAad,OAAOG,IAAI,CAAC,cAAc;QACvCY,cAAcf,OAAOG,IAAI,CAAC,eAAe;QACzCa,iBAAiBhB,OAAOG,IAAI,CAAC,kBAAkB;QAC/Cc,kBAAkBjB,OAAOG,IAAI,CAAC,mBAAmB;QACjD,sEAAsE;QACtE,uEAAuE;QACvE,yEAAyE;QACzE,sEAAsE;QACtE,gEAAgE;QAChElC,iBAAiBd,sBACfgD,IAAI,CAAC,aAAa,EAClBA,IAAI,CAAC/C,2BAA2B;QAElC8D,WAAWX,SAAS5C,GAAG,CAAC,CAACwD,OAASR,OAAOQ,OAAOC,MAAM,CAACC;QACvDC,YAAYnB,IAAI,CAAC,aAAa,IAAI,OAAO,OAAOQ,OAAOR,IAAI,CAAC,aAAa;QACzEO,UAAUA,aAAa,QAAQA,aAAa,SAASA,WAAW;QAChE,wEAAwE;QACxE,wEAAwE;QACxE,wEAAwE;QACxE,iDAAiD;QACjDa,WAAWpB,IAAI,CAAC,YAAY,KAAK;IACnC;AACF;AAEA,kEAAkE,GAClE,SAASqB,WACPhE,KAAgC,EAChCuB,GAAW,EACXd,eAAuB;QAERT;IAAf,MAAMiE,UAASjE,aAAAA,KAAK,CAACuB,IAAI,YAAVvB,aAAc;QAAEU,UAAU;QAAGD,iBAAiB;IAAE;IAC/DwD,OAAOvD,QAAQ,IAAI;IACnBuD,OAAOxD,eAAe,IAAIA;IAC1BT,KAAK,CAACuB,IAAI,GAAG0C;AACf;AAEA;;;;;;;;CAQC,GACD,OAAO,SAASC,kBACdpC,IAAuB,EACvBqC,UAAmD,CAAC,CAAC;QAEvCA;IAAd,MAAMpC,SAAQoC,iBAAAA,QAAQpC,KAAK,YAAboC,iBAAiB;IAC/B,MAAMC,SAAS;QACb1D,UAAU;QACV4C,aAAa;QACbC,cAAc;QACdC,iBAAiB;QACjBC,kBAAkB;QAClBhD,iBAAiB;QACjBsD,WAAW;QACXM,gBAAgB;QAChBC,eAAe;QACfC,QAAQ,CAAC;QACTC,SAAS,CAAC;QACVC,QAAQ,CAAC;QACTC,aAAa,CAAC;QACdxB,UAAU;YAAEyB,IAAI;YAAGC,MAAM;YAAGC,MAAM;QAAE;IACtC;IAEA,MAAMC,OAAO,IAAIC;IAIjB,MAAMC,mBAAmB,IAAID;IAC7B,MAAME,OAAO,IAAIF;IACjB,MAAMG,kBAAoC,EAAE;IAC5C,MAAMC,QAAQ,IAAIJ;IAIlB,IAAIK,sBAAsB;IAC1B,IAAIC,iBAAiB;IAErB,KAAK,MAAMC,OAAOxD,KAAM;YA8BTwD,iBACelB,0BAKhBa;QAnCZb,OAAO1D,QAAQ,IAAI;QACnB0D,OAAOd,WAAW,IAAIgC,IAAIhC,WAAW;QACrCc,OAAOb,YAAY,IAAI+B,IAAI/B,YAAY;QACvCa,OAAOZ,eAAe,IAAI8B,IAAI9B,eAAe;QAC7CY,OAAOX,gBAAgB,IAAI6B,IAAI7B,gBAAgB;QAC/CW,OAAO3D,eAAe,IAAI6E,IAAI7E,eAAe;QAC7C,IAAI6E,IAAIvB,SAAS,EAAEK,OAAOL,SAAS,IAAI;QACvCC,WAAWI,OAAOG,MAAM,EAAEe,IAAIjC,IAAI,EAAEiC,IAAI7E,eAAe;QACvDuD,WAAWI,OAAOI,OAAO,EAAEc,IAAIlC,KAAK,EAAEkC,IAAI7E,eAAe;QACzD,IAAI,CAAC6E,IAAIvB,SAAS,EAAE;gBAEHoB;YADf,MAAM/E,OAAOkF,IAAIlF,IAAI,IAAI;YACzB,MAAM6D,UAASkB,aAAAA,MAAMI,GAAG,CAACnF,iBAAV+E,aAAmB;gBAChCzE,UAAU;gBACVD,iBAAiB;gBACjB6C,aAAa;gBACbC,cAAc;gBACdC,iBAAiB;gBACjBC,kBAAkB;gBAClB+B,SAAS,EAAE;YACb;YACAvB,OAAOvD,QAAQ,IAAI;YACnBuD,OAAOxD,eAAe,IAAI6E,IAAI7E,eAAe;YAC7CwD,OAAOX,WAAW,IAAIgC,IAAIhC,WAAW;YACrCW,OAAOV,YAAY,IAAI+B,IAAI/B,YAAY;YACvCU,OAAOT,eAAe,IAAI8B,IAAI9B,eAAe;YAC7CS,OAAOR,gBAAgB,IAAI6B,IAAI7B,gBAAgB;YAC/CQ,OAAOuB,OAAO,CAACC,IAAI,CAACH,IAAI/B,YAAY;YACpC4B,MAAMO,GAAG,CAACtF,MAAM6D;QAClB;QACA,MAAM0B,QAAOL,kBAAAA,IAAIxB,UAAU,YAAdwB,kBAAkB;QAC/BlB,OAAOM,WAAW,CAACiB,KAAK,GAAG,EAACvB,2BAAAA,OAAOM,WAAW,CAACiB,KAAK,YAAxBvB,2BAA4B,KAAK;QAC7D,IAAIkB,IAAIpC,QAAQ,KAAK,MAAMkB,OAAOlB,QAAQ,CAACyB,EAAE,IAAI;aAC5C,IAAIW,IAAIpC,QAAQ,KAAK,QAAQkB,OAAOlB,QAAQ,CAAC0B,IAAI,IAAI;aACrDR,OAAOlB,QAAQ,CAAC2B,IAAI,IAAI;QAE7B,MAAMe,OAAMX,YAAAA,KAAKM,GAAG,CAACD,IAAIrD,KAAK,aAAlBgD,YAAuB;YACjChD,OAAOqD,IAAIrD,KAAK;YAChBvB,UAAU;YACV4C,aAAa;YACbC,cAAc;YACdC,iBAAiB;YACjBC,kBAAkB;YAClBhD,iBAAiB;YACjBmE,MAAM;QACR;QACAgB,IAAIlF,QAAQ,IAAI;QAChBkF,IAAItC,WAAW,IAAIgC,IAAIhC,WAAW;QAClCsC,IAAIrC,YAAY,IAAI+B,IAAI/B,YAAY;QACpCqC,IAAIpC,eAAe,IAAI8B,IAAI9B,eAAe;QAC1CoC,IAAInC,gBAAgB,IAAI6B,IAAI7B,gBAAgB;QAC5CmC,IAAInF,eAAe,IAAI6E,IAAI7E,eAAe;QAC1C,IAAI6E,IAAIpC,QAAQ,KAAK,QAAQ0C,IAAIhB,IAAI,IAAI;QACzCK,KAAKS,GAAG,CAACJ,IAAIrD,KAAK,EAAE2D;QAEpB;;;;;;KAMC,GACD,IAAIN,IAAIpC,QAAQ,KAAK,UAAU,CAACoC,IAAI5B,SAAS,CAAC3C,MAAM,EAAE;YACpDmE,gBAAgBO,IAAI,CAAC;gBACnBxD,OAAOqD,IAAIrD,KAAK;gBAChBa,YAAYwC,IAAIxC,UAAU;gBAC1BF,OAAO0C,IAAI1C,KAAK,IAAI;gBACpBM,UAAUoC,IAAIpC,QAAQ;gBACtB2C,UAAUP,IAAI5B,SAAS,CAAC3C,MAAM,GAAG;YACnC;QACF;QAEA,IAAI,CAACuE,IAAI5B,SAAS,CAAC3C,MAAM,EAAE;gBAOXiE;YANd,oEAAoE;YACpE,gEAAgE;YAChE,gEAAgE;YAChEI,uBAAuB;YACvB,IAAIE,IAAIpC,QAAQ,KAAK,QAAQmC,kBAAkB;YAC/C,MAAMzC,QAAQ0C,IAAI1C,KAAK,IAAI;YAC3B,MAAMkD,SAAQd,wBAAAA,iBAAiBO,GAAG,CAAC3C,kBAArBoC,wBAA+B;gBAC3CpC;gBACAmD,WAAW;gBACXnB,MAAM;YACR;YACAkB,MAAMC,SAAS,IAAI;YACnB,IAAIT,IAAIpC,QAAQ,KAAK,QAAQ4C,MAAMlB,IAAI,IAAI;YAC3CI,iBAAiBU,GAAG,CAAC9C,OAAOkD;YAC5B;QACF;QAEA,oEAAoE;QACpE,uEAAuE;QACvE,uEAAuE;QACvE,mEAAmE;QACnE,wEAAwE;QACxE,KAAK,MAAMnC,QAAQ,IAAIqC,IAAIV,IAAI5B,SAAS,EAAG;gBAC3BoB;YAAd,MAAMgB,SAAQhB,YAAAA,KAAKS,GAAG,CAAC5B,iBAATmB,YAAkB;gBAC9BQ,KAAK;oBAAE3B;oBAAMoC,WAAW;oBAAGpB,IAAI;oBAAGC,MAAM;oBAAGnE,iBAAiB;gBAAE;gBAC9DwE,MAAM,IAAIe;YACZ;YACAF,MAAMR,GAAG,CAACS,SAAS,IAAI;YACvBD,MAAMR,GAAG,CAAC7E,eAAe,IAAI6E,IAAI7E,eAAe;YAChD,IAAI6E,IAAIpC,QAAQ,KAAK,MAAM4C,MAAMR,GAAG,CAACX,EAAE,IAAI;YAC3C,IAAIW,IAAIpC,QAAQ,KAAK,QAAQ4C,MAAMR,GAAG,CAACV,IAAI,IAAI;YAC/CkB,MAAMb,IAAI,CAACgB,GAAG,CAACX,IAAIrD,KAAK;YACxB6C,KAAKY,GAAG,CAAC/B,MAAMmC;QACjB;IACF;IAEA;;;;;;GAMC,GACDZ,gBAAgB5E,IAAI,CAAC,CAACC,GAAGC;QACvB,MAAMS,OAAO,CAACiF,YACZA,UAAUhD,QAAQ,KAAK,SAAS,IAAI;QACtC,OAAOjC,KAAKV,KAAKU,KAAKT;IACxB;IAEA4D,OAAOE,aAAa,GAAGzE,eAAe;QACpCsG,OAAO/B,OAAOd,WAAW;QACzB8C,QAAQhC,OAAOZ,eAAe;QAC9B6C,YAAYjC,OAAOX,gBAAgB;IACrC;IACA,KAAK,MAAM,QAAkC0B,MAAO;YAAzC,CAAC/E,YAA6B,SAAvB,EAAEoF,OAAO,EAAa,UAARvB;;;QAC9BG,OAAOK,MAAM,CAACrE,KAAK,GAAG,aACjB6D;YACHqC,WAAW1F,sBAAsB4E,SAAS;YAC1Ce,cAAc1G,eAAe;gBAC3BsG,OAAOlC,OAAOX,WAAW;gBACzB8C,QAAQnC,OAAOT,eAAe;gBAC9B6C,YAAYpC,OAAOR,gBAAgB;YACrC;;IAEJ;IACAW,OAAOC,cAAc,GAAGD,OAAO1D,QAAQ,GACnC0D,OAAOL,SAAS,GAAGK,OAAO1D,QAAQ,GAClC;IAEJ,MAAM8F,WAAW;WAAI1B,KAAKjE,MAAM;KAAG,CAChCV,GAAG,CAAC,CAAC,EAAEmF,GAAG,EAAEL,MAAMwB,MAAM,EAAE;QACzB,MAAMC,QAAQpB,IAAIX,EAAE,GAAGW,IAAIV,IAAI;QAC/B,OAAO,aACFU;YACHL,MAAMwB,OAAOE,IAAI;YACjBC,UAAUF,QAAQpB,IAAIV,IAAI,GAAG8B,QAAQ;;IAEzC,EACA,uEAAuE;IACvE,yEAAyE;IACzE,sEAAsE;IACtE,gEAAgE;KAC/DpG,IAAI,CAAC,CAACC,GAAGC,IAAMA,EAAEoE,IAAI,GAAGrE,EAAEqE,IAAI,IAAIpE,EAAEuF,SAAS,GAAGxF,EAAEwF,SAAS,EAC3DzD,KAAK,CAAC,GAAGP;IAEZ,MAAM8E,sBAAsB;WAAI7B,iBAAiBnE,MAAM;KAAG,CAACP,IAAI,CAC7D,CAACC,GAAGC,IAAMA,EAAEuF,SAAS,GAAGxF,EAAEwF,SAAS,IAAIvF,EAAEoE,IAAI,GAAGrE,EAAEqE,IAAI;IAExD,MAAMkC,UAAU;WAAI7B,KAAKpE,MAAM;KAAG,CAACP,IAAI,CACrC,CAACC,GAAGC,IAAMA,EAAEC,eAAe,GAAGF,EAAEE,eAAe,IAAID,EAAEE,QAAQ,GAAGH,EAAEG,QAAQ;IAG5E,OAAO;QACLqG,SAASjF,KAAKf,MAAM;QACpBiG,WAAWnD,QAAQM,QAAQ6C,SAAS;QACpC5C;QACAoC;QACAjE,QAAQ;YACN,kEAAkE;YAClE,oEAAoE;YACpE,mCAAmC;YACnCiE,UAAU1B,KAAK6B,IAAI;YACnB3B,kBAAkBA,iBAAiB2B,IAAI;YACvC1B,MAAMA,KAAK0B,IAAI;QACjB;QACAzB,iBAAiBA,gBAAgB5C,KAAK,CAAC,GAAGP;QAC1CkF,YAAY;YACVlB,WAAWX;YACXR,MAAMS;YACN6B,QAAQL,oBAAoBvE,KAAK,CAAC,GAAGP;QACvC;QACAkD,MAAM6B,QAAQxE,KAAK,CAAC,GAAGP;IACzB;AACF"}