@opensearch-project/agent-health 0.6.0 → 0.7.0

package/lib/dist/lib/runInsights.js

@@ -0,0 +1,185 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+const UNCATEGORIZED = 'Uncategorized';
+/**
+ * Group rows by test-case category and tally pass/fail/errored/total.
+ * Deterministic order: largest category first, ties broken alphabetically.
+ */
+export function computeCategoryBars(rows) {
+    const map = new Map();
+    for (const row of rows) {
+        const category = (row.category || '').trim() || UNCATEGORIZED;
+        let bar = map.get(category);
+        if (!bar) {
+            bar = { category, passed: 0, failed: 0, errored: 0, total: 0 };
+            map.set(category, bar);
+        }
+        bar.total++;
+        if (row.status === 'passed')
+            bar.passed++;
+        else if (row.status === 'errored')
+            bar.errored++;
+        else if (row.status === 'failed')
+            bar.failed++;
+    }
+    return Array.from(map.values()).sort((a, b) => b.total - a.total || a.category.localeCompare(b.category));
+}
+// ── Failure-theme clustering ───────────────────────────────────────────────
+/**
+ * Normalize a judge-reasoning string down to its first sentence,
+ * lowercased, punctuation-stripped, whitespace-collapsed. Used both as the
+ * clustering input and as the theme's stable `key`.
+ */
+export function normalizeReasoningKey(reasoning) {
+    const trimmed = (reasoning || '').trim();
+    if (!trimmed)
+        return '';
+    const sentenceMatch = trimmed.match(/^[^.!?\n]+[.!?]?/);
+    const firstSentence = (sentenceMatch ? sentenceMatch[0] : trimmed).toLowerCase();
+    return firstSentence.replace(/[^a-z0-9\s]/g, ' ').replace(/\s+/g, ' ').trim();
+}
+/** Returns the literal (non-lowercased) first sentence, trimmed — used as the human-facing sample snippet. */
+function literalFirstSentence(reasoning) {
+    const trimmed = (reasoning || '').trim();
+    if (!trimmed)
+        return '';
+    const sentenceMatch = trimmed.match(/^[^.!?\n]+[.!?]?/);
+    return (sentenceMatch ? sentenceMatch[0] : trimmed).trim();
+}
+function shingles(normalized, size) {
+    const words = normalized.split(' ').filter(Boolean);
+    if (words.length === 0)
+        return [];
+    if (words.length <= size)
+        return [words.join(' ')];
+    const out = [];
+    for (let i = 0; i <= words.length - size; i++) {
+        out.push(words.slice(i, i + size).join(' '));
+    }
+    return out;
+}
+/** Contiguous-word window size used for near-duplicate matching. Paraphrases of the same failure ("agent was unable to retrieve..." vs "agent failed to retrieve...") reliably share at least one 6-word run even when their leading words differ. */
+const DEFAULT_SHINGLE_SIZE = 6;
+/** Reasoning first-sentences shorter than this many words don't carry enough signal to safely dedupe against unrelated failures — left as their own singleton theme rather than risk clustering unrelated short reasons together (e.g. "The agent failed to retrieve the required information."). */
+const MIN_WORDS_FOR_SHINGLING = 3;
+/**
+ * Cluster failing test cases into "why they failed" themes using a
+ * deterministic, LLM-free heuristic: normalize each case's judge-reasoning
+ * first sentence, then union-find cases that share at least one contiguous
+ * N-word shingle. This is robust to minor paraphrasing (a judge saying
+ * "unable to retrieve" vs "failed to retrieve" the same underlying tool
+ * connectivity failure) while still keeping genuinely distinct failure
+ * modes (e.g. "missing required facts" vs "MCP server unavailable")
+ * separate, because they share no contiguous phrase.
+ *
+ * Verified against a real production run (418-verify, 64 failing cases):
+ * 57 of 64 connectivity-flavored reasonings collapse into ONE dominant
+ * theme; the remaining 7 ("Required facts evaluation: ...", a genuinely
+ * different failure shape) form a second, correctly separate theme.
+ *
+ * Output order: largest theme first, ties broken by the theme's
+ * lowest-sorting testCaseId (deterministic, no dependency on input order).
+ */
+export function clusterFailureThemes(items, shingleSize = DEFAULT_SHINGLE_SIZE) {
+    const n = items.length;
+    if (n === 0)
+        return [];
+    const parent = Array.from({ length: n }, (_, i) => i);
+    function find(i) {
+        while (parent[i] !== i) {
+            parent[i] = parent[parent[i]];
+            i = parent[i];
+        }
+        return i;
+    }
+    function union(a, b) {
+        const ra = find(a);
+        const rb = find(b);
+        if (ra !== rb)
+            parent[Math.max(ra, rb)] = Math.min(ra, rb);
+    }
+    const normalized = items.map(it => normalizeReasoningKey(it.reasoning));
+    const shingleBuckets = new Map(); // shingle -> first index seen
+    normalized.forEach((norm, idx) => {
+        const words = norm.split(' ').filter(Boolean);
+        if (words.length < MIN_WORDS_FOR_SHINGLING)
+            return;
+        for (const sh of shingles(norm, shingleSize)) {
+            const firstIdx = shingleBuckets.get(sh);
+            if (firstIdx === undefined)
+                shingleBuckets.set(sh, idx);
+            else
+                union(firstIdx, idx);
+        }
+    });
+    const groups = new Map();
+    for (let i = 0; i < n; i++) {
+        const root = find(i);
+        const arr = groups.get(root);
+        if (arr)
+            arr.push(i);
+        else
+            groups.set(root, [i]);
+    }
+    const themes = [];
+    for (const idxs of groups.values()) {
+        // Representative snippet: the most frequent literal first-sentence
+        // phrasing within the cluster (ties broken by first occurrence) - so a
+        // theme with 4 identical sentences + a handful of near-duplicate
+        // paraphrases surfaces the exact sentence, not an arbitrary member.
+        const counts = new Map();
+        for (const idx of idxs) {
+            const key = normalized[idx];
+            const snippet = literalFirstSentence(items[idx].reasoning);
+            const existing = counts.get(key);
+            if (existing)
+                existing.count++;
+            else
+                counts.set(key, { count: 1, firstIdx: idx, snippet });
+        }
+        let best = null;
+        for (const v of counts.values()) {
+            if (!best || v.count > best.count || (v.count === best.count && v.firstIdx < best.firstIdx))
+                best = v;
+        }
+        const testCaseIds = idxs.map(idx => items[idx].testCaseId);
+        themes.push({
+            key: normalized[idxs[0]] || `theme-${idxs[0]}`,
+            count: idxs.length,
+            sampleSnippet: best?.snippet || '',
+            testCaseIds,
+        });
+    }
+    themes.sort((a, b) => {
+        if (b.count !== a.count)
+            return b.count - a.count;
+        const aMin = [...a.testCaseIds].sort()[0] || '';
+        const bMin = [...b.testCaseIds].sort()[0] || '';
+        return aMin < bMin ? -1 : aMin > bMin ? 1 : 0;
+    });
+    return themes;
+}
+/**
+ * "Based on N of M failing cases" note shown under the theme list when the
+ * reasoning fetch was capped (RunInsightsPane caps at the first 100 failing
+ * cases). Returns null when nothing was capped (fetchedCount >= totalCount).
+ */
+export function formatCappedNote(fetchedCount, totalFailingCount) {
+    if (totalFailingCount <= fetchedCount)
+        return null;
+    return `Based on ${fetchedCount} of ${totalFailingCount} failing cases`;
+}
+/**
+ * Top-N cases by a numeric value (duration, cost, ...), descending.
+ * Cases with a null/undefined/NaN value are excluded. Deterministic tie
+ * break: lower testCaseId first.
+ */
+export function pickTopN(cases, n) {
+    return cases
+        .filter((c) => typeof c.value === 'number' && Number.isFinite(c.value))
+        .sort((a, b) => (b.value !== a.value ? b.value - a.value : a.testCaseId.localeCompare(b.testCaseId)))
+        .slice(0, n);
+}
+//# sourceMappingURL=runInsights.js.map

package/lib/dist/lib/runInsights.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runInsights.js","sourceRoot":"","sources":["../../runInsights.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA+BH,MAAM,aAAa,GAAG,eAAe,CAAC;AAEtC;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAyB;IAC3D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,aAAa,CAAC;QAC9D,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAC/D,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC;QACD,GAAG,CAAC,KAAK,EAAE,CAAC;QACZ,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ;YAAE,GAAG,CAAC,MAAM,EAAE,CAAC;aACrC,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;YAAE,GAAG,CAAC,OAAO,EAAE,CAAC;aAC5C,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ;YAAE,GAAG,CAAC,MAAM,EAAE,CAAC;IACjD,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAClC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CACpE,CAAC;AACJ,CAAC;AAED,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,SAAiB;IACrD,MAAM,OAAO,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACzC,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IACxB,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACxD,MAAM,aAAa,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;IACjF,OAAO,aAAa,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAChF,CAAC;AAED,8GAA8G;AAC9G,SAAS,oBAAoB,CAAC,SAAiB;IAC7C,MAAM,OAAO,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACzC,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IACxB,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACxD,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;AAC7D,CAAC;AAED,SAAS,QAAQ,CAAC,UAAkB,EAAE,IAAY;IAChD,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI;QAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAgBD,sPAAsP;AACtP,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAC/B,qSAAqS;AACrS,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAA0B,EAC1B,cAAsB,oBAAoB;IAE1C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,SAAS,IAAI,CAAC,CAAS;QACrB,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,EAAE;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,qBAAqB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IACxE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,8BAA8B;IAChF,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,KAAK,CAAC,MAAM,GAAG,uBAAuB;YAAE,OAAO;QACnD,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,QAAQ,KAAK,SAAS;gBAAE,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;;gBACnD,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAChB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACnC,mEAAmE;QACnE,uEAAuE;QACvE,iEAAiE;QACjE,oEAAoE;QACpE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgE,CAAC;QACvF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;YAC5B,MAAM,OAAO,GAAG,oBAAoB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;YAC3D,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,QAAQ;gBAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;;gBAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,IAAI,GAAgE,IAAI,CAAC;QAC7E,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAAE,IAAI,GAAG,CAAC,CAAC;QACxG,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAC3D,MAAM,CAAC,IAAI,CAAC;YACV,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE;YAC9C,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,aAAa,EAAE,IAAI,EAAE,OAAO,IAAI,EAAE;YAClC,WAAW;SACZ,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChD,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,YAAoB,EAAE,iBAAyB;IAC9E,IAAI,iBAAiB,IAAI,YAAY;QAAE,OAAO,IAAI,CAAC;IACnD,OAAO,YAAY,YAAY,OAAO,iBAAiB,gBAAgB,CAAC;AAC1E,CAAC;AASD;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAiE,EAAE,CAAS;IACnG,OAAO,KAAK;SACT,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SACvF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;SACpG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACjB,CAAC"}

package/lib/dist/lib/runName.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Validation for renaming an evaluation run (PATCH /api/storage/evaluation-runs/:id
+ * `{ name }`). This is the server route's authoritative check.
+ *
+ * Rename is intentionally narrow: it only ever touches `name`. No version bump,
+ * no stats recompute — this file has no opinion on anything but the string.
+ */
+/** Renamed evaluation runs are capped at this length (arbitrary but generous —
+ *  long enough for any real run name, short enough to keep list/table UIs sane). */
+export declare const MAX_RUN_NAME_LENGTH = 200;
+export type RunNameValidation = {
+    ok: true;
+    value: string;
+} | {
+    ok: false;
+    error: string;
+};
+/**
+ * Validate + normalize a candidate evaluation-run name.
+ *
+ * - Must be a string.
+ * - Trimmed value must be non-empty.
+ * - Trimmed value must be at most {@link MAX_RUN_NAME_LENGTH} characters.
+ *
+ * Returns the trimmed value on success so callers persist a normalized name
+ * (no leading/trailing whitespace) rather than the raw input.
+ */
+export declare function validateRunNameUpdate(name: unknown): RunNameValidation;
+//# sourceMappingURL=runName.d.ts.map

package/lib/dist/lib/runName.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"runName.d.ts","sourceRoot":"","sources":["../../runName.ts"],"names":[],"mappings":"AAKA;;;;;;GAMG;AAEH;oFACoF;AACpF,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAEvC,MAAM,MAAM,iBAAiB,GACzB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC3B;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEjC;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,OAAO,GAAG,iBAAiB,CAYtE"}

package/lib/dist/lib/runName.js

@@ -0,0 +1,38 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/**
+ * Validation for renaming an evaluation run (PATCH /api/storage/evaluation-runs/:id
+ * `{ name }`). This is the server route's authoritative check.
+ *
+ * Rename is intentionally narrow: it only ever touches `name`. No version bump,
+ * no stats recompute — this file has no opinion on anything but the string.
+ */
+/** Renamed evaluation runs are capped at this length (arbitrary but generous —
+ *  long enough for any real run name, short enough to keep list/table UIs sane). */
+export const MAX_RUN_NAME_LENGTH = 200;
+/**
+ * Validate + normalize a candidate evaluation-run name.
+ *
+ * - Must be a string.
+ * - Trimmed value must be non-empty.
+ * - Trimmed value must be at most {@link MAX_RUN_NAME_LENGTH} characters.
+ *
+ * Returns the trimmed value on success so callers persist a normalized name
+ * (no leading/trailing whitespace) rather than the raw input.
+ */
+export function validateRunNameUpdate(name) {
+    if (typeof name !== 'string') {
+        return { ok: false, error: 'name must be a string' };
+    }
+    const trimmed = name.trim();
+    if (!trimmed) {
+        return { ok: false, error: 'name must not be empty' };
+    }
+    if (trimmed.length > MAX_RUN_NAME_LENGTH) {
+        return { ok: false, error: `name must be ${MAX_RUN_NAME_LENGTH} characters or fewer` };
+    }
+    return { ok: true, value: trimmed };
+}
+//# sourceMappingURL=runName.js.map

package/lib/dist/lib/runName.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runName.js","sourceRoot":"","sources":["../../runName.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;GAMG;AAEH;oFACoF;AACpF,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAMvC;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAa;IACjD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,uBAAuB,EAAE,CAAC;IACvD,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,wBAAwB,EAAE,CAAC;IACxD,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;QACzC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,gBAAgB,mBAAmB,sBAAsB,EAAE,CAAC;IACzF,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AACtC,CAAC"}

package/lib/dist/lib/runReportPath.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Canonical run-report path for a run surfaced on the compare page.
+ *
+ * Benchmark runs (embedded in a benchmark's `runs[]`) resolve at
+ * `/evaluations/benchmarks/:benchmarkId/runs/:runId`; everything else —
+ * ad-hoc / SDK eval-runs, or runs whose `benchmarkId` is merely a label — goes
+ * to the bare `/evaluations/runs/:runId` route (the benchmark route would
+ * 404/redirect for those, and the bare route 404s for benchmark run ids).
+ *
+ * Shared by the scoreboard's run-name link, its "Open run" icon, and the
+ * per-case table's run headers so the three can never disagree. Callers pass
+ * the benchmarkId from `ComparisonPage`'s `runBenchmarkIdById` map (which is
+ * `undefined` unless the run is a real benchmark member).
+ */
+export declare const runReportPath: (runId: string, benchmarkId?: string) => string;
+//# sourceMappingURL=runReportPath.d.ts.map

package/lib/dist/lib/runReportPath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"runReportPath.d.ts","sourceRoot":"","sources":["../../runReportPath.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,MAAM,EAAE,cAAc,MAAM,KAAG,MAGd,CAAC"}

package/lib/dist/lib/runReportPath.js

@@ -0,0 +1,22 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/**
+ * Canonical run-report path for a run surfaced on the compare page.
+ *
+ * Benchmark runs (embedded in a benchmark's `runs[]`) resolve at
+ * `/evaluations/benchmarks/:benchmarkId/runs/:runId`; everything else —
+ * ad-hoc / SDK eval-runs, or runs whose `benchmarkId` is merely a label — goes
+ * to the bare `/evaluations/runs/:runId` route (the benchmark route would
+ * 404/redirect for those, and the bare route 404s for benchmark run ids).
+ *
+ * Shared by the scoreboard's run-name link, its "Open run" icon, and the
+ * per-case table's run headers so the three can never disagree. Callers pass
+ * the benchmarkId from `ComparisonPage`'s `runBenchmarkIdById` map (which is
+ * `undefined` unless the run is a real benchmark member).
+ */
+export const runReportPath = (runId, benchmarkId) => benchmarkId
+    ? `/evaluations/benchmarks/${encodeURIComponent(benchmarkId)}/runs/${encodeURIComponent(runId)}`
+    : `/evaluations/runs/${encodeURIComponent(runId)}`;
+//# sourceMappingURL=runReportPath.js.map

package/lib/dist/lib/runReportPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runReportPath.js","sourceRoot":"","sources":["../../runReportPath.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAAoB,EAAU,EAAE,CAC3E,WAAW;IACT,CAAC,CAAC,2BAA2B,kBAAkB,CAAC,WAAW,CAAC,SAAS,kBAAkB,CAAC,KAAK,CAAC,EAAE;IAChG,CAAC,CAAC,qBAAqB,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC"}

package/lib/dist/lib/runSort.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Comparators for sorting evaluation-run rows and run-groups newest-first.
+ *
+ * Extracted from EvalRunsPage so the "grouped view sorts groups by most
+ * recent run, not alphabetically by benchmark name" rule is a plain,
+ * unit-testable function instead of logic buried inside a `useMemo`.
+ */
+export interface HasCreatedAt {
+    createdAt: string;
+}
+/**
+ * Most recent `createdAt` timestamp (ms since epoch) across a list of runs.
+ * Empty/all-invalid input returns 0 so a group with no valid timestamps
+ * sorts to the oldest position rather than throwing or sorting first.
+ */
+export declare function mostRecentTime(items: HasCreatedAt[]): number;
+/**
+ * Sort groups (e.g. "runs grouped by benchmark") by each group's most
+ * recent run — descending, so the group with the latest activity is first.
+ * Ties (including empty groups, which compare equal at 0) preserve the
+ * original relative order (stable sort).
+ *
+ * @param groups - the groups to sort
+ * @param getItems - extracts the timestamped items (e.g. runs) from a group
+ */
+export declare function sortGroupsByRecency<T>(groups: T[], getItems: (group: T) => HasCreatedAt[]): T[];
+//# sourceMappingURL=runSort.d.ts.map

package/lib/dist/lib/runSort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"runSort.d.ts","sourceRoot":"","sources":["../../runSort.ts"],"names":[],"mappings":"AAKA;;;;;;GAMG;AAEH,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAO5D;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,YAAY,EAAE,GAAG,CAAC,EAAE,CAE/F"}

package/lib/dist/lib/runSort.js

@@ -0,0 +1,31 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/**
+ * Most recent `createdAt` timestamp (ms since epoch) across a list of runs.
+ * Empty/all-invalid input returns 0 so a group with no valid timestamps
+ * sorts to the oldest position rather than throwing or sorting first.
+ */
+export function mostRecentTime(items) {
+    let max = 0;
+    for (const item of items) {
+        const t = new Date(item.createdAt).getTime();
+        if (Number.isFinite(t) && t > max)
+            max = t;
+    }
+    return max;
+}
+/**
+ * Sort groups (e.g. "runs grouped by benchmark") by each group's most
+ * recent run — descending, so the group with the latest activity is first.
+ * Ties (including empty groups, which compare equal at 0) preserve the
+ * original relative order (stable sort).
+ *
+ * @param groups - the groups to sort
+ * @param getItems - extracts the timestamped items (e.g. runs) from a group
+ */
+export function sortGroupsByRecency(groups, getItems) {
+    return [...groups].sort((a, b) => mostRecentTime(getItems(b)) - mostRecentTime(getItems(a)));
+}
+//# sourceMappingURL=runSort.js.map

package/lib/dist/lib/runSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runSort.js","sourceRoot":"","sources":["../../runSort.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAcH;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAqB;IAClD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QAC7C,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAI,MAAW,EAAE,QAAsC;IACxF,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/F,CAAC"}

package/lib/dist/lib/runStats.d.ts

@@ -12,7 +12,7 @@
  * For performance optimization, stats are denormalized onto BenchmarkRun.stats
  * and updated incrementally as test cases complete.
  */
-import type { BenchmarkRun, EvaluationReport, RunStats as RunStatsType } from '../types/index.js';
+import type { BenchmarkRun, EvaluationReport, RunStats as RunStatsType, BenchmarkRunStatus } from '../types/index.js';
 /**
  * Statistics for a benchmark run
  */
@@ -30,15 +30,27 @@ export interface RunStats {
      * pass rates. Issue #242.
      */
     errored: number;
+    /**
+     * Number of planned test cases that never executed (or never finished)
+     * because the run reached a TERMINAL status first — cancelled mid-way, or
+     * the executor crashed. Neither a pass, a fail, nor "pending": nothing is
+     * ever going to happen to them. Excluded from the pass-rate denominator
+     * and rendered as "n not run" (never with an in-progress spinner).
+     */
+    notRun: number;
     /** Total number of test cases in the run */
     total: number;
     /**
-     * Pass rate as a percentage (0-100). Computed over `total - errored`
-     * (the *evaluable* set), not over `total`, so a non-retryable judge
-     * failure can't masquerade as the agent scoring 0%.
+     * Pass rate as a percentage (0-100). Computed over `total - errored -
+     * notRun` (the *evaluable* set), not over `total`, so a non-retryable
+     * judge failure — or a cancellation — can't masquerade as the agent
+     * scoring 0%.
      */
     passRate: number;
 }
+/** Run statuses after which no further per-case progress can happen. */
+export declare const TERMINAL_RUN_STATUSES: ReadonlySet<BenchmarkRunStatus>;
+export declare function isTerminalRunStatus(status: BenchmarkRunStatus | undefined): boolean;
 /**
  * Bucket a run's per-test-case results into passed/failed/errored/pending using
  * ONLY the persisted result fields (status + passFailStatus) — no reports
@@ -55,11 +67,49 @@ export interface RunStats {
  * the evaluator couldn't produce one (judge validation error, trace timeout).
  * Excluded from passed/failed — exactly as calculateRunStats does via the
  * report's metricsStatus.
+ *
+ * `plannedTotal` (bug: runs list showed no in-flight indication, 2026-09-01):
+ * for a genuinely in-progress run, `results` only gets an entry once a test
+ * case has actually STARTED — a run 9 cases into a planned 62 has a
+ * `results` map of length 9, so `total` here would report 9, not 62. Pass
+ * the run's snapshotted test-case count (`testCaseSnapshots.length`) as
+ * `plannedTotal` and the shortfall (planned - observed) is folded into
+ * `pending` so the invariant `total === passed+failed+errored+pending+notRun`
+ * still holds and callers see the true "53 more to go" total instead of a
+ * misleadingly small, already-100%-accounted-for total that looks finished.
+ *
+ * `runStatus` (bug: cancelled/failed runs rendered a phantom "n pending ⟳"
+ * forever, 2026-09-04): the shortfall above is only *pending* while the run
+ * can still make progress. Once the run is TERMINAL (cancelled / failed /
+ * completed) nothing will ever start those cases, so they are bucketed as
+ * `notRun` instead — a cancelled 34/62 run reads "34 executed · 28 not run",
+ * not "28 pending" with a spinner. The same applies to per-case entries a
+ * terminal run left behind in `pending`/`running` (an executor that died
+ * mid-case) and to entries explicitly marked `status: 'cancelled'` (written
+ * for never-started cases when a run is cancelled — see
+ * `EvaluationRun.results` in types/index.ts). Without `runStatus` the legacy
+ * behaviour (shortfall = pending) is preserved.
  */
 export declare function bucketRunResults(results: Record<string, {
     status?: string;
     passFailStatus?: string;
-}> | undefined): Pick<RunStats, 'passed' | 'failed' | 'errored' | 'pending' | 'total'>;
+}> | undefined, plannedTotal?: number, runStatus?: BenchmarkRunStatus): Pick<RunStats, 'passed' | 'failed' | 'errored' | 'pending' | 'notRun' | 'total'>;
+/**
+ * Pass rate (0-100) over the JUDGED set only: `passed / (passed + failed)`.
+ * Excluded: errored (executed, but the evaluator produced no verdict — the
+ * repo-wide #242 convention, same as the benchmark runs table and the run
+ * inspector), pending (not finished) and notRun (never started). So a run
+ * cancelled at 34/62 reports the pass rate of the cases that were actually
+ * judged, and an in-flight run doesn't read as "12%" because 50 cases
+ * haven't happened yet. Named for what it is — callers that surface it
+ * should footnote the excluded errored/notRun counts (the detail page does).
+ * Returns `null` when nothing has been judged so callers can render "—"
+ * rather than a fabricated 0%.
+ */
+export declare function passRateOverJudged(stats: {
+    passed: number;
+    failed: number;
+}): number | null;
 /**
  * Calculate statistics for a benchmark run.
  *
@@ -106,11 +156,41 @@ export declare function getReportIdsFromRun(run: BenchmarkRun): string[];
  * simply ignore the extra `pending` field.
  */
 export declare function computeRunStats(run: {
+    status?: BenchmarkRunStatus;
     results?: Record<string, {
         status?: string;
         passFailStatus?: string;
     }>;
     stats?: Partial<RunStatsType> | null;
-}): Pick<RunStatsType, 'passed' | 'failed' | 'errored' | 'pending' | 'total'>;
+    testCaseSnapshots?: unknown[];
+}): Pick<RunStatsType, 'passed' | 'failed' | 'errored' | 'pending' | 'total'> & {
+    notRun: number;
+};
 export declare function computeRunStatsFromReports(run: BenchmarkRun, reports: EvaluationReport[]): RunStatsType;
+/**
+ * Single canonical "is this run actively in progress" check, shared by every
+ * runs-list surface (bug: the Evaluation Runs page and the benchmark-scoped
+ * Runs panel each grew their own copy of this, and only one of them actually
+ * rendered a running indicator). `status` is authoritative when present
+ * (always true for `EvaluationRun`; `BenchmarkRun.status` is only undefined
+ * for legacy pre-status data). Falls back to inspecting `results` so legacy
+ * runs without a top-level `status` still get a sensible effective status.
+ */
+export declare function getEffectiveRunStatus(run: {
+    status?: BenchmarkRunStatus;
+    results?: Record<string, {
+        status?: string;
+    }>;
+}): BenchmarkRunStatus;
+/**
+ * True when a run has neither reached a terminal status nor accounted for
+ * every planned test case yet. Used to decide whether a runs-list page
+ * should keep polling for live updates.
+ */
+export declare function isRunInProgress(run: {
+    status?: BenchmarkRunStatus;
+    results?: Record<string, {
+        status?: string;
+    }>;
+}): boolean;
 //# sourceMappingURL=runStats.d.ts.map

package/lib/dist/lib/runStats.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"runStats.d.ts","sourceRoot":"","sources":["../../runStats.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,QAAQ,IAAI,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAEjG;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,qEAAqE;IACrE,MAAM,EAAE,MAAM,CAAC;IACf,yFAAyF;IACzF,MAAM,EAAE,MAAM,CAAC;IACf,gFAAgF;IAChF,OAAO,EAAE,MAAM,CAAC;IAChB;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,SAAS,GAChF,IAAI,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,CAAC,CAevE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,YAAY,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,GAAG,IAAI,CAAC,GAC/C,QAAQ,CAuEV;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,EAAE,CAU/D;AAED;;;;;;;GAOG;AACH;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE;IACH,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,cAAc,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvE,KAAK,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC;CACtC,GACA,IAAI,CAAC,YAAY,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,CAAC,CAc3E;AAED,wBAAgB,0BAA0B,CACxC,GAAG,EAAE,YAAY,EACjB,OAAO,EAAE,gBAAgB,EAAE,GAC1B,YAAY,CAed"}
+{"version":3,"file":"runStats.d.ts","sourceRoot":"","sources":["../../runStats.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,QAAQ,IAAI,YAAY,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAErH;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,qEAAqE;IACrE,MAAM,EAAE,MAAM,CAAC;IACf,yFAAyF;IACzF,MAAM,EAAE,MAAM,CAAC;IACf,gFAAgF;IAChF,OAAO,EAAE,MAAM,CAAC;IAChB;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;;;;;OAMG;IACH,MAAM,EAAE,MAAM,CAAC;IACf,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd;;;;;OAKG;IACH,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wEAAwE;AACxE,eAAO,MAAM,qBAAqB,EAAE,WAAW,CAAC,kBAAkB,CAAiD,CAAC;AAEpH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,kBAAkB,GAAG,SAAS,GAAG,OAAO,CAEnF;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,SAAS,EACjF,YAAY,CAAC,EAAE,MAAM,EACrB,SAAS,CAAC,EAAE,kBAAkB,GAC7B,IAAI,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAC,CA6BlF;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,GAAG,IAAI,CAG3F;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,YAAY,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,GAAG,IAAI,CAAC,GAC/C,QAAQ,CA+EV;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,EAAE,CAU/D;AAED;;;;;;;GAOG;AACH;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE;IACH,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,cAAc,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvE,KAAK,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC;IACrC,iBAAiB,CAAC,EAAE,OAAO,EAAE,CAAC;CAC/B,GACA,IAAI,CAAC,YAAY,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,CAAC,GAAG;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,CA6ChG;AA0BD,wBAAgB,0BAA0B,CACxC,GAAG,EAAE,YAAY,EACjB,OAAO,EAAE,gBAAgB,EAAE,GAC1B,YAAY,CAgBd;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE;IAAE,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,GAClF,kBAAkB,CAQpB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE;IAAE,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,GAClF,OAAO,CAET"}