agent-nuvira 3.1.3 → 3.3.0

package/dist/learning/long-form.js

@@ -0,0 +1,521 @@
+/**
+ * Long-form execution — bounded units + a progress ledger for deliverables
+ * that are larger than one LLM generation (enterprise-grade hardening, G8).
+ *
+ * WHY THIS EXISTS (the WhatsApp story audit):
+ * The user asked for a 100-page story. Two facts made that ask IMPOSSIBLE for
+ * any of the 507 eligible models, independently of the model-shortage myth the
+ * failure message told:
+ *
+ *   1. The code writer generates with `maxTokens: 2048` — about 1,500 words,
+ *      roughly 4–5 pages. A 100-page book is ~35,000 words, i.e. 25–40 times
+ *      the largest artifact the pipeline could ever emit.
+ *   2. Nothing in the pipeline decomposed the ask. The plan was 4 steps, none
+ *      of which produced prose, and no component counted words or pages, so
+ *      there was no notion of "partially done" and nothing to resume.
+ *
+ * So the fix is structural, not a bigger prompt: split the work into bounded
+ * units that fit one generation, persist progress per unit, and report honest
+ * completion ("chapter 7 of 39"). This module owns the arithmetic and the
+ * ledger; the writer owns one unit at a time.
+ *
+ * WHY UNIT FILES, NOT APPENDS TO ONE FILE:
+ * The obvious design — append each chapter to `Mahagatha.md` — requires the
+ * writer to rewrite the whole file every unit (the FileChange contract is a
+ * full-content write). By chapter 35 that is ~35k words of input tokens per
+ * generation, which does not fit the context window it was going to be
+ * generated from. One file per unit keeps every generation bounded and makes
+ * the work genuinely resumable. The single document the user asked for is
+ * ASSEMBLED deterministically (pure string concatenation, no LLM, no cost)
+ * once the units are done.
+ *
+ * Storage: `~/.nuvira/memory/long-form.json`, keyed by project + document.
+ * Honours `NUVIRA_MEMORY_DIR` / `BUFF_MEMORY_DIR` like the other ledgers.
+ * Every write is best-effort — the ledger must NEVER break a turn.
+ */
+import { envBuff, resolveNuviraHome } from '../config/paths.js';
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from 'node:fs';
+import { dirname, join, relative, resolve } from 'node:path';
+// ─── Constants ──────────────────────────────────────────────────────────────
+/**
+ * Words per printed page. 350 is the standard estimate for a 12pt manuscript
+ * page (double-spaced manuscript convention is ~250; a typeset book page is
+ * ~350–400). Erring low keeps the plan honest: a "100-page" target that lands
+ * at 35,000 words is comfortably 100 pages, never short of it.
+ */
+export const WORDS_PER_PAGE = 350;
+/**
+ * Words per generation unit. Sized to land inside a raised output cap with
+ * headroom for the model to finish a sentence: 900 words ≈ 1,400 tokens,
+ * comfortably under a 2,048-token floor and well within a 4k–8k cap. Larger
+ * units risk truncation, which is exactly how the original writer failed
+ * ("no parseable output" on a truncated response).
+ */
+export const WORDS_PER_GENERATION = 900;
+/** Words per chapter when the user counts chapters instead of pages. */
+export const WORDS_PER_CHAPTER = 2_500;
+/**
+ * Units planned per turn. A 100-page book is ~39 units; planning all of them
+ * as orchestrator steps would build a plan the run could never finish, and a
+ * single-run attempt is precisely the "bigger ask" the agent kept losing.
+ * Bounded batches let each turn end with CONCRETE delivered text and a
+ * recorded progress line, and the next turn resumes where it stopped.
+ */
+export const MAX_UNITS_PER_RUN = 4;
+/** Largest section count we will ever plan (sanity bound on the ledger). */
+const MAX_SECTIONS = 400;
+const CURRENT_VERSION = 1;
+const FILE_NAME = 'long-form.json';
+// ─── Target parsing ─────────────────────────────────────────────────────────
+/** Default chapter count when a book/novel is requested with no magnitude. */
+const DEFAULT_CHAPTERS = 10;
+/**
+ * Extract the long-form target from a goal, or `null` when the goal does not
+ * name a magnitude (in which case the ask fits one generation and this module
+ * stays out of the way).
+ *
+ * Understands the shapes users actually type — "a 100 page story", "100-page
+ * book", "in 12 chapters", "about 5000 words", "10 पेज", "एक उपन्यास जिसमें 8
+ * अध्याय हों" — and prefers the most specific unit named.
+ */
+export function parseLongFormTarget(goal) {
+    const g = (goal || '').trim();
+    if (!g)
+        return null;
+    // A magnitude must be explicit. Never invent one from "a long story".
+    const pages = g.match(/(\d[\d,]*)\s*[-\s]?\s*(pages?|pg|पेज|पृष्ठ)/i);
+    const chapters = g.match(/(\d[\d,]*)\s*[-\s]?\s*(chapters?|अध्याय)/i);
+    const words = g.match(/(\d[\d,]*)\s*[-\s]?\s*(words?|शब्द)/i);
+    const sections = g.match(/(\d[\d,]*)\s*[-\s]?\s*(sections?|parts?)/i);
+    const num = (raw) => Number.parseInt(raw.replace(/[,\s]/g, ''), 10);
+    // Prefer the unit that most directly describes the deliverable: pages and
+    // chapters are how books are specified; words is a fallback; sections last.
+    if (pages) {
+        return makeTarget('pages', num(pages[1]), `"${pages[0].trim()}"`);
+    }
+    if (chapters) {
+        return makeTarget('chapters', num(chapters[1]), `"${chapters[0].trim()}"`);
+    }
+    if (words) {
+        return makeTarget('words', num(words[1]), `"${words[0].trim()}"`);
+    }
+    if (sections) {
+        return makeTarget('sections', num(sections[1]), `"${sections[0].trim()}"`);
+    }
+    // A book/novel with no magnitude still needs a plan: default to a sensible
+    // chapter count rather than pretending it fits one generation.
+    if (/\b(novel|novella|book|उपन्यास|पुस्तक)\b/i.test(g)) {
+        return makeTarget('chapters', DEFAULT_CHAPTERS, 'default for an unnumbered book/novel');
+    }
+    return null;
+}
+/** Convert a user-facing magnitude into a word target and unit count. */
+function makeTarget(unit, amount, source) {
+    const safeAmount = Math.max(1, Math.min(amount, 10_000));
+    let wordsTarget;
+    let unitCount;
+    switch (unit) {
+        case 'pages':
+            // Pages are not a generation boundary — split into as many bounded units
+            // as the word count needs (100 pages ≈ 39 units of ~900 words).
+            wordsTarget = safeAmount * WORDS_PER_PAGE;
+            unitCount = Math.ceil(wordsTarget / WORDS_PER_GENERATION);
+            break;
+        case 'words':
+            wordsTarget = safeAmount;
+            unitCount = Math.ceil(wordsTarget / WORDS_PER_GENERATION);
+            break;
+        case 'chapters':
+            // A chapter IS the unit the user counted, so one unit per chapter.
+            // Splitting "12 chapters" into 34 fragments would deliver something the
+            // user did not ask for and mislabel every one of them.
+            wordsTarget = safeAmount * WORDS_PER_CHAPTER;
+            unitCount = safeAmount;
+            break;
+        default:
+            wordsTarget = safeAmount * WORDS_PER_GENERATION;
+            unitCount = safeAmount;
+    }
+    return { unit, amount: safeAmount, wordsTarget, unitCount: Math.max(1, Math.min(unitCount, MAX_SECTIONS)), source };
+}
+// ─── Section planning ───────────────────────────────────────────────────────
+/** Filesystem-safe slug for a section title. */
+function slug(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^a-z0-9]+/g, '-')
+        .replace(/^-+|-+$/g, '')
+        .slice(0, 40) || 'unit';
+}
+/** Pad to two digits so chapter files sort lexicographically. */
+function pad(n) {
+    return String(n).padStart(2, '0');
+}
+/** Default display title for a unit, by class. */
+export function sectionTitle(cls, index) {
+    return cls === 'creative' ? `Chapter ${index}` : `Section ${index}`;
+}
+/**
+ * Build the unit list for a target. Word targets are distributed evenly with
+ * the remainder spread over the first units, so the SUM of unit targets always
+ * equals the overall word target — the plan cannot silently undershoot the ask.
+ */
+export function planSections(target, cls, dir = 'chapters') {
+    const count = target.unitCount;
+    const base = Math.floor(target.wordsTarget / count);
+    const remainder = target.wordsTarget - base * count;
+    const sections = [];
+    for (let i = 1; i <= count; i++) {
+        const title = sectionTitle(cls, i);
+        sections.push({
+            index: i,
+            title,
+            path: `${dir}/${pad(i)}-${slug(title)}.md`,
+            targetWords: base + (i <= remainder ? 1 : 0),
+            status: 'pending',
+            words: 0,
+            attempts: 0,
+        });
+    }
+    return sections;
+}
+/** Pages implied by a word count (for progress reporting). */
+export function estimatePages(words) {
+    return Math.max(0, Math.round((words / WORDS_PER_PAGE) * 10) / 10);
+}
+function envBuffSafe(name) {
+    try {
+        return envBuff(name);
+    }
+    catch {
+        return undefined;
+    }
+}
+/** Memory dir, honouring the test/dev override. */
+function memoryDir() {
+    const override = envBuffSafe('MEMORY_DIR');
+    if (override)
+        return override;
+    try {
+        return join(resolveNuviraHome(), 'memory');
+    }
+    catch {
+        return join(process.cwd(), '.nuvira-memory');
+    }
+}
+function ledgerPath() {
+    return join(memoryDir(), FILE_NAME);
+}
+function readLedger() {
+    try {
+        const raw = readFileSync(ledgerPath(), 'utf-8');
+        const parsed = JSON.parse(raw);
+        if (parsed && typeof parsed === 'object' && parsed.jobs && typeof parsed.jobs === 'object') {
+            return { version: parsed.version ?? CURRENT_VERSION, jobs: parsed.jobs };
+        }
+    }
+    catch {
+        // Missing or corrupt — start clean. A ledger read must never throw.
+    }
+    return { version: CURRENT_VERSION, jobs: {} };
+}
+function writeLedger(data) {
+    try {
+        const dir = memoryDir();
+        if (!existsSync(dir))
+            mkdirSync(dir, { recursive: true });
+        // Bounded: keep the most recent 30 jobs so the file cannot grow forever.
+        const entries = Object.entries(data.jobs);
+        if (entries.length > 30) {
+            entries.sort((a, b) => b[1].updatedAt - a[1].updatedAt);
+            data.jobs = Object.fromEntries(entries.slice(0, 30));
+        }
+        writeFileSync(ledgerPath(), JSON.stringify({ ...data, version: CURRENT_VERSION }, null, 2), 'utf-8');
+    }
+    catch {
+        // Best-effort — persistence must never break a turn.
+    }
+}
+/** Stable key for a (project, document) pair. */
+export function longFormKey(projectPath, docPath) {
+    return `${resolve(projectPath)}::${resolve(docPath)}`;
+}
+/** Both `chapters/03-chapter-3.md` (relative) and absolute path forms. */
+export function sectionAbsolutePath(projectPath, sectionPath) {
+    return resolve(projectPath, sectionPath);
+}
+// ─── Job lifecycle ──────────────────────────────────────────────────────────
+/**
+ * Start a job, or RESUME an existing one for the same document.
+ *
+ * Resuming is the whole point: the failing session re-derived the same plan
+ * six times and lost every partial result. A resumed job keeps its existing
+ * units, their statuses and their word counts, so the caller can ask for the
+ * next pending batch and make real forward progress per turn.
+ */
+export function startOrResumeJob(input) {
+    const key = longFormKey(input.projectPath, input.docPath);
+    const data = readLedger();
+    const existing = data.jobs[key];
+    const now = Date.now();
+    if (existing && existing.status === 'in_progress') {
+        // Reconcile with disk: a unit marked done whose file vanished is pending
+        // again (the user deleted it, or a write failed after the ledger write).
+        let repaired = false;
+        for (const s of existing.sections) {
+            if (s.status === 'done' && !existsSync(sectionAbsolutePath(existing.projectPath, s.path))) {
+                s.status = 'pending';
+                s.words = 0;
+                repaired = true;
+            }
+        }
+        if (repaired)
+            recalcWords(existing);
+        existing.goal = input.goal;
+        existing.updatedAt = now;
+        data.jobs[key] = existing;
+        writeLedger(data);
+        return { job: existing, resumed: true };
+    }
+    const sections = planSections(input.target, input.deliverableClass, input.dir);
+    const job = {
+        key,
+        goal: input.goal,
+        projectPath: resolve(input.projectPath),
+        docPath: resolve(input.docPath),
+        deliverableClass: input.deliverableClass,
+        target: input.target,
+        sections,
+        words: 0,
+        status: 'in_progress',
+        createdAt: now,
+        updatedAt: now,
+    };
+    data.jobs[key] = job;
+    writeLedger(data);
+    return { job, resumed: false };
+}
+/** Read a job without creating one. */
+export function getJob(projectPath, docPath) {
+    const data = readLedger();
+    return data.jobs[longFormKey(projectPath, docPath)] ?? null;
+}
+/**
+ * The most recently updated job for a project REGARDLESS of status, or null.
+ *
+ * The unattended runner needs this: after the last batch completes the job it
+ * must be able to read the FINISHED record to confirm the document exists, and
+ * `findInProgressJob` (correctly) hides those.
+ */
+export function findLatestJob(projectPath) {
+    const data = readLedger();
+    const key = resolve(projectPath);
+    const candidates = Object.values(data.jobs)
+        .filter((j) => j.projectPath === key)
+        .sort((a, b) => b.updatedAt - a.updatedAt);
+    return candidates[0] ?? null;
+}
+/**
+ * The most recently updated UNFINISHED job for a project, or null.
+ *
+ * WHY: a follow-up turn says "continue" — which names no document, no length,
+ * and no class. Re-deriving the job from that text would land on the default
+ * filename and start a SECOND book from scratch, which is the "agent goes in a
+ * loop and never delivers" behaviour this ledger exists to end. The in-flight
+ * job for this project is the correct target for a continuation.
+ */
+export function findInProgressJob(projectPath) {
+    const data = readLedger();
+    const key = resolve(projectPath);
+    const candidates = Object.values(data.jobs)
+        .filter((j) => j.projectPath === key && j.status === 'in_progress')
+        .sort((a, b) => b.updatedAt - a.updatedAt);
+    return candidates[0] ?? null;
+}
+/** Number of words in a body of text (whitespace-delimited). */
+export function countWords(text) {
+    const t = (text || '').trim();
+    if (!t)
+        return 0;
+    return t.split(/\s+/).filter(Boolean).length;
+}
+function recalcWords(job) {
+    job.words = job.sections.reduce((sum, s) => sum + (s.status === 'done' ? s.words : 0), 0);
+}
+/**
+ * Record the outcome of ONE unit.
+ *
+ * `ok` requires actual content: a unit whose file is missing or empty is a
+ * FAILURE even if the writer reported success. That is the G10 principle
+ * applied to long-form work — "the step ran" is not "the work exists".
+ */
+export function recordSectionOutcome(job, index, outcome) {
+    const section = job.sections.find((s) => s.index === index);
+    if (!section)
+        return job;
+    section.attempts += 1;
+    if (outcome.ok) {
+        section.status = 'done';
+        section.words = outcome.words ?? section.words;
+        delete section.lastError;
+    }
+    else {
+        section.status = 'failed';
+        section.lastError = (outcome.error || 'unknown error').slice(0, 300);
+    }
+    recalcWords(job);
+    job.status = job.sections.every((s) => s.status === 'done') ? 'done' : 'in_progress';
+    job.updatedAt = Date.now();
+    const data = readLedger();
+    data.jobs[job.key] = job;
+    writeLedger(data);
+    return job;
+}
+/**
+ * Persist a job that the caller has already mutated (e.g. after writing unit
+ * files). Kept separate from `recordSectionOutcome` so batch callers write
+ * once instead of once per unit.
+ */
+export function saveJob(job) {
+    job.updatedAt = Date.now();
+    recalcWords(job);
+    job.status = job.sections.every((s) => s.status === 'done') ? 'done' : 'in_progress';
+    const data = readLedger();
+    data.jobs[job.key] = job;
+    writeLedger(data);
+}
+/**
+ * The next pending units to execute — bounded per run so a turn always ends
+ * with delivered text rather than an unfinished marathon.
+ */
+export function nextPendingSections(job, limit = MAX_UNITS_PER_RUN) {
+    return job.sections.filter((s) => s.status !== 'done').slice(0, Math.max(1, limit));
+}
+export function jobProgress(job) {
+    const total = job.sections.length;
+    const done = job.sections.filter((s) => s.status === 'done').length;
+    const words = job.sections.reduce((sum, s) => sum + (s.status === 'done' ? s.words : 0), 0);
+    const wordsPercent = job.target.wordsTarget > 0
+        ? Math.min(100, Math.round((words / job.target.wordsTarget) * 100))
+        : 0;
+    // The completion percentage is the MINIMUM of the two ways the deliverable can
+    // be incomplete, and that is deliberate. Writers routinely OVERSHOOT the per-
+    // chapter target — a live 100-page run hit 43,906 words against a 35,000 target
+    // by chapter 31 of 39 — so a word-only percentage saturated at 100 while eight
+    // units were still owed: the progress line read "31/39 complete … 100%", which
+    // is the same class of contradiction as a listing count presented as a
+    // capability. Units are the generation boundary and the work still outstanding,
+    // so the lower of the two is the honest number, and 100% means the deliverable
+    // EXISTS (all units done) rather than "the word count ran out of road".
+    const unitPercent = total > 0 ? Math.round((done / total) * 100) : 0;
+    const percent = Math.min(wordsPercent, unitPercent);
+    return {
+        done,
+        total,
+        words,
+        wordsTarget: job.target.wordsTarget,
+        pages: estimatePages(words),
+        pagesTarget: estimatePages(job.target.wordsTarget),
+        percent,
+        complete: total > 0 && done === total,
+    };
+}
+/**
+ * The honest progress line — reported to the user every turn.
+ *
+ * Deliberately quotes BOTH the unit count and the words, because the user
+ * asked in pages and a word count alone would look like a dodge. This is the
+ * sentence the original session could never produce: it had no idea how much
+ * of the book existed.
+ */
+export function formatProgress(job) {
+    const p = jobProgress(job);
+    const noun = job.deliverableClass === 'creative' ? 'chapter' : 'section';
+    return `📖 ${noun} ${p.done}/${p.total} complete · ${p.words.toLocaleString()}/${p.wordsTarget.toLocaleString()} words (${p.pages} of ~${p.pagesTarget} pages, ${p.percent}%)`;
+}
+/** The next `limit` units as a plan the writer can execute one at a time. */
+export function nextUnitBrief(job, limit = MAX_UNITS_PER_RUN) {
+    const briefs = [];
+    for (const s of nextPendingSections(job, limit)) {
+        briefs.push({
+            index: s.index,
+            title: s.title,
+            path: s.path,
+            targetWords: s.targetWords,
+            previousTail: readTail(sectionAbsolutePath(job.projectPath, prevSectionPath(job, s.index)), 1_200),
+        });
+    }
+    return briefs;
+}
+/** Path of the unit before `index`, or '' when there is none. */
+function prevSectionPath(job, index) {
+    const prev = job.sections.find((s) => s.index === index - 1);
+    return prev ? prev.path : '';
+}
+/** Last `chars` of a file, or '' when it does not exist. */
+export function readTail(absolutePath, chars) {
+    try {
+        if (!absolutePath || !existsSync(absolutePath))
+            return '';
+        const text = readFileSync(absolutePath, 'utf-8');
+        return text.length <= chars ? text : text.slice(text.length - chars);
+    }
+    catch {
+        return '';
+    }
+}
+/**
+ * Deterministically assemble the finished document from its unit files.
+ *
+ * Pure concatenation — no LLM, no cost, no drift. Runs only when every unit is
+ * done, so the assembled document is never a half-book presented as complete.
+ * Returns null when the job is not finished (the caller must not claim
+ * completion, and must keep reporting progress instead).
+ */
+export function assembleDocument(job) {
+    const progress = jobProgress(job);
+    if (!progress.complete)
+        return null;
+    const parts = [];
+    for (const s of job.sections) {
+        const abs = sectionAbsolutePath(job.projectPath, s.path);
+        let body = '';
+        try {
+            if (existsSync(abs))
+                body = readFileSync(abs, 'utf-8').trim();
+        }
+        catch {
+            body = '';
+        }
+        if (body)
+            parts.push(`# ${s.title}\n\n${body}`);
+    }
+    if (parts.length === 0)
+        return null;
+    const text = `${parts.join('\n\n---\n\n')}\n`;
+    try {
+        const dir = dirname(job.docPath);
+        if (!existsSync(dir))
+            mkdirSync(dir, { recursive: true });
+        writeFileSync(job.docPath, text, 'utf-8');
+    }
+    catch {
+        return null;
+    }
+    const words = countWords(text);
+    return { path: job.docPath, files: parts.length, words, pages: estimatePages(words) };
+}
+/** Relative path display, for a concise log line. */
+export function displayPath(projectPath, absolute) {
+    try {
+        return relative(projectPath, absolute) || absolute;
+    }
+    catch {
+        return absolute;
+    }
+}
+/** Test/reset hook: forget every job. */
+export function clearLongFormJobs() {
+    writeLedger({ version: CURRENT_VERSION, jobs: {} });
+}
+//# sourceMappingURL=long-form.js.map

package/dist/learning/long-form.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"long-form.js","sourceRoot":"","sources":["../../src/learning/long-form.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAE7D,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAC;AAElC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAExC,wEAAwE;AACxE,MAAM,CAAC,MAAM,iBAAiB,GAAG,KAAK,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAEnC,4EAA4E;AAC5E,MAAM,YAAY,GAAG,GAAG,CAAC;AAEzB,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,SAAS,GAAG,gBAAgB,CAAC;AA4DnC,+EAA+E;AAE/E,8EAA8E;AAC9E,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9B,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpB,sEAAsE;IACtE,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,8CAA8C,CAAC,CAAC;IACtE,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,2CAA2C,CAAC,CAAC;IACtE,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,2CAA2C,CAAC,CAAC;IAEtE,MAAM,GAAG,GAAG,CAAC,GAAW,EAAU,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpF,0EAA0E;IAC1E,4EAA4E;IAC5E,IAAI,KAAK,EAAE,CAAC;QACV,OAAO,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACpE,CAAC;IACD,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,UAAU,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7E,CAAC;IACD,IAAI,KAAK,EAAE,CAAC;QACV,OAAO,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACpE,CAAC;IACD,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,UAAU,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7E,CAAC;IAED,2EAA2E;IAC3E,+DAA+D;IAC/D,IAAI,0CAA0C,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACvD,OAAO,UAAU,CAAC,UAAU,EAAE,gBAAgB,EAAE,sCAAsC,CAAC,CAAC;IAC1F,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yEAAyE;AACzE,SAAS,UAAU,CAAC,IAAkB,EAAE,MAAc,EAAE,MAAc;IACpE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACzD,IAAI,WAAmB,CAAC;IACxB,IAAI,SAAiB,CAAC;IACtB,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,OAAO;YACV,yEAAyE;YACzE,gEAAgE;YAChE,WAAW,GAAG,UAAU,GAAG,cAAc,CAAC;YAC1C,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,oBAAoB,CAAC,CAAC;YAC1D,MAAM;QACR,KAAK,OAAO;YACV,WAAW,GAAG,UAAU,CAAC;YACzB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,oBAAoB,CAAC,CAAC;YAC1D,MAAM;QACR,KAAK,UAAU;YACb,mEAAmE;YACnE,wEAAwE;YACxE,uDAAuD;YACvD,WAAW,GAAG,UAAU,GAAG,iBAAiB,CAAC;YAC7C,SAAS,GAAG,UAAU,CAAC;YACvB,MAAM;QACR;YACE,WAAW,GAAG,UAAU,GAAG,oBAAoB,CAAC;YAChD,SAAS,GAAG,UAAU,CAAC;IAC3B,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;AACtH,CAAC;AAED,+EAA+E;AAE/E,gDAAgD;AAChD,SAAS,IAAI,CAAC,IAAY;IACxB,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;SAC3B,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC;AAC5B,CAAC;AAED,iEAAiE;AACjE,SAAS,GAAG,CAAC,CAAS;IACpB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,YAAY,CAAC,GAA4B,EAAE,KAAa;IACtE,OAAO,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC;AACtE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAsB,EACtB,GAA4B,EAC5B,GAAG,GAAG,UAAU;IAEhB,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,GAAG,IAAI,GAAG,KAAK,CAAC;IACpD,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACnC,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,CAAC;YACR,KAAK;YACL,IAAI,EAAE,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK;YAC1C,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,EAAE,SAAS;YACjB,KAAK,EAAE,CAAC;YACR,QAAQ,EAAE,CAAC;SACZ,CAAC,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACrE,CAAC;AASD,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,CAAC;QACH,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,mDAAmD;AACnD,SAAS,SAAS;IAChB,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;IAC3C,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC9B,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,iBAAiB,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,gBAAgB,CAAC,CAAC;IAC/C,CAAC;AACH,CAAC;AAED,SAAS,UAAU;IACjB,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,UAAU;IACjB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,EAAE,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAe,CAAC;QAC7C,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3F,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,eAAe,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3E,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,oEAAoE;IACtE,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AAChD,CAAC;AAED,SAAS,WAAW,CAAC,IAAgB;IACnC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,SAAS,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,yEAAyE;QACzE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACxD,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,aAAa,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,eAAe,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACvG,CAAC;IAAC,MAAM,CAAC;QACP,qDAAqD;IACvD,CAAC;AACH,CAAC;AAED,iDAAiD;AACjD,MAAM,UAAU,WAAW,CAAC,WAAmB,EAAE,OAAe;IAC9D,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;AACxD,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,mBAAmB,CAAC,WAAmB,EAAE,WAAmB;IAC1E,OAAO,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;AAC3C,CAAC;AAED,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAOhC;IACC,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;QAClD,yEAAyE;QACzE,yEAAyE;QACzE,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,UAAU,CAAC,mBAAmB,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC1F,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC;gBACrB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,QAAQ;YAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QACpC,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QAC3B,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;QAC1B,WAAW,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC1C,CAAC;IAED,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,gBAAgB,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/E,MAAM,GAAG,GAAgB;QACvB,GAAG;QACH,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,WAAW,EAAE,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC;QACvC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC;QAC/B,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;QACxC,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ;QACR,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,aAAa;QACrB,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,GAAG;KACf,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACrB,WAAW,CAAC,IAAI,CAAC,CAAC;IAClB,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,MAAM,CAAC,WAAmB,EAAE,OAAe;IACzD,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC;IAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC;AAC9D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,WAAmB;IAC/C,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC;IAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;IACjC,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;SACxC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,GAAG,CAAC;SACpC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IAC7C,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,WAAmB;IACnD,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC;IAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;IACjC,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;SACxC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,GAAG,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC;SAClE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IAC7C,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAC/B,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9B,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IACjB,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;AAC/C,CAAC;AAED,SAAS,WAAW,CAAC,GAAgB;IACnC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAClC,GAAgB,EAChB,KAAa,EACb,OAAwD;IAExD,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;IAC5D,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,CAAC;IACzB,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;IACtB,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;QACxB,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;QAC/C,OAAO,OAAO,CAAC,SAAS,CAAC;IAC3B,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,MAAM,GAAG,QAAQ,CAAC;QAC1B,OAAO,CAAC,SAAS,GAAG,CAAC,OAAO,CAAC,KAAK,IAAI,eAAe,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACvE,CAAC;IACD,WAAW,CAAC,GAAG,CAAC,CAAC;IACjB,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC;IACrF,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC;IAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACzB,WAAW,CAAC,IAAI,CAAC,CAAC;IAClB,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,GAAgB;IACtC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,WAAW,CAAC,GAAG,CAAC,CAAC;IACjB,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC;IACrF,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC;IAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACzB,WAAW,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAgB,EAAE,KAAK,GAAG,iBAAiB;IAC7E,OAAO,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACtF,CAAC;AAcD,MAAM,UAAU,WAAW,CAAC,GAAgB;IAC1C,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC;IAClC,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;IACpE,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5F,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC;QAC7C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC,CAAC;IACN,+EAA+E;IAC/E,8EAA8E;IAC9E,gFAAgF;IAChF,+EAA+E;IAC/E,+EAA+E;IAC/E,uEAAuE;IACvE,gFAAgF;IAChF,+EAA+E;IAC/E,wEAAwE;IACxE,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;IACpD,OAAO;QACL,IAAI;QACJ,KAAK;QACL,KAAK;QACL,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,WAAW;QACnC,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC;QAC3B,WAAW,EAAE,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC;QAClD,OAAO;QACP,QAAQ,EAAE,KAAK,GAAG,CAAC,IAAI,IAAI,KAAK,KAAK;KACtC,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,GAAgB;IAC7C,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,gBAAgB,KAAK,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;IACzE,OAAO,MAAM,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,eAAe,CAAC,CAAC,KAAK,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC,WAAW,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,WAAW,WAAW,CAAC,CAAC,OAAO,IAAI,CAAC;AACjL,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,aAAa,CAAC,GAAgB,EAAE,KAAK,GAAG,iBAAiB;IAQvE,MAAM,MAAM,GAAqG,EAAE,CAAC;IACpH,KAAK,MAAM,CAAC,IAAI,mBAAmB,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC;YACV,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,YAAY,EAAE,QAAQ,CAAC,mBAAmB,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACnG,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,iEAAiE;AACjE,SAAS,eAAe,CAAC,GAAgB,EAAE,KAAa;IACtD,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC;IAC7D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/B,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,QAAQ,CAAC,YAAoB,EAAE,KAAa;IAC1D,IAAI,CAAC;QACH,IAAI,CAAC,YAAY,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC;YAAE,OAAO,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IACvE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAWD;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAgB;IAC/C,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,QAAQ,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEpC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,mBAAmB,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACzD,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,CAAC;YACH,IAAI,UAAU,CAAC,GAAG,CAAC;gBAAE,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QAChE,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,GAAG,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,OAAO,IAAI,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;IAC9C,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAC5C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/B,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;AACxF,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,WAAW,CAAC,WAAmB,EAAE,QAAgB;IAC/D,IAAI,CAAC;QACH,OAAO,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,QAAQ,CAAC;IACrD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,QAAQ,CAAC;IAClB,CAAC;AACH,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,iBAAiB;IAC/B,WAAW,CAAC,EAAE,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;AACtD,CAAC"}

package/dist/learning/model-first-router.d.ts

@@ -74,6 +74,23 @@ export declare function buildModelCandidates(taskDescription: string, complexity
  * Returns the top candidate, or undefined if no models available.
  */
 export declare function pickBestModelCandidate(taskDescription: string, complexity: ComplexityLevel, configManager?: ConfigManager, allowedProviders?: string[]): ModelCandidate | undefined;
+/**
+ * Count what the pool ACTUALLY offers right now.
+ *
+ * WHY THIS EXISTS (G9): the failure report used to decide its closing sentence
+ * from the PARK list alone — and a dead pair (a provider that answered "model
+ * not found") has no expiry, so a report whose only exclusions were dead pairs
+ * printed "No suitable model is available right now". Live, that sentence was
+ * shown while 507 models were eligible and the provider served a request 52
+ * seconds later. A report that cannot count the pool cannot claim it is empty,
+ * so the count is computed through the SAME filtering the router uses (dead
+ * pairs + non-chat models excluded) — the report can never disagree with what
+ * routing would actually consider.
+ */
+export declare function countEligibleModels(allowedProviders?: string[]): {
+    models: number;
+    providers: number;
+};
 /**
  * Get the top N model candidates for failover.
  */

package/dist/learning/model-first-router.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"model-first-router.d.ts","sourceRoot":"","sources":["../../src/learning/model-first-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAoB,KAAK,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAChF,OAAO,EAAsB,KAAK,oBAAoB,EAAwB,MAAM,kCAAkC,CAAC;AACvH,OAAO,EAAqB,KAAK,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAK7E,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAI1D,8CAA8C;AAC9C,MAAM,WAAW,cAAc;IAC7B,0DAA0D;IAC1D,KAAK,EAAE,MAAM,CAAC;IACd,kDAAkD;IAClD,QAAQ,EAAE,MAAM,CAAC;IACjB,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,mCAAmC;IACnC,UAAU,EAAE;QACV,iDAAiD;QACjD,aAAa,EAAE,MAAM,CAAC;QACtB,yCAAyC;QACzC,SAAS,EAAE,MAAM,CAAC;QAClB,yCAAyC;QACzC,aAAa,EAAE,MAAM,CAAC;QACtB,gDAAgD;QAChD,MAAM,EAAE,MAAM,CAAC;QACf,0DAA0D;QAC1D,iBAAiB,EAAE,MAAM,CAAC;QAC1B,kCAAkC;QAClC,aAAa,EAAE,MAAM,CAAC;QACtB,iCAAiC;QACjC,YAAY,EAAE,MAAM,CAAC;KACtB,CAAC;IACF,kCAAkC;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,8CAA8C;IAC9C,KAAK,CAAC,EAAE,kBAAkB,CAAC;IAC3B,yCAAyC;IACzC,OAAO,CAAC,EAAE,oBAAoB,CAAC;CAChC;AAED,6DAA6D;AAC7D,MAAM,WAAW,gBAAgB;IAC/B,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACzC,aAAa,EAAE,OAAO,CAAC;IACvB,YAAY,EAAE,OAAO,CAAC;IACtB,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAID;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,oBAAoB,CAAC,EAAE,MAAM,GAC5B,gBAAgB,CAoClB;AAwID;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,aAAa,CAAC,EAAE,aAAa,EAC7B,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAC1B,cAAc,EAAE,CAyGlB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CACpC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,aAAa,CAAC,EAAE,aAAa,EAC7B,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAC1B,cAAc,GAAG,SAAS,CAG5B;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,CAAC,GAAE,MAAW,EACd,aAAa,CAAC,EAAE,aAAa,EAC7B,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAC1B,cAAc,EAAE,CAGlB;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,aAAa,EAAE,cAAc,EAC7B,aAAa,EAAE,cAAc,EAAE,GAC9B,cAAc,EAAE,CAgBlB;AAED;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,GAAG,OAAO,CAAC;AAEjE;;GAEG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,cAAc,GAAG,cAAc,CAOtE;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,SAAS,EAAE,cAAc,GAAG,OAAO,CASvE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,wBAAwB,CACtC,aAAa,EAAE,cAAc,EAC7B,aAAa,EAAE,cAAc,EAAE,GAC9B,YAAY,EAAE,CA2GhB;AAED,oCAAoC;AACpC,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,YAAY,GAAG,WAAW,GAAG,UAAU,GAAG,aAAa,GAAG,OAAO,GAAG,WAAW,CAAC;IACvF,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,cAAc,EAAE,CAAC;CAC9B"}
+{"version":3,"file":"model-first-router.d.ts","sourceRoot":"","sources":["../../src/learning/model-first-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAoB,KAAK,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAChF,OAAO,EAAsB,KAAK,oBAAoB,EAAwB,MAAM,kCAAkC,CAAC;AACvH,OAAO,EAAqB,KAAK,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAK7E,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAI1D,8CAA8C;AAC9C,MAAM,WAAW,cAAc;IAC7B,0DAA0D;IAC1D,KAAK,EAAE,MAAM,CAAC;IACd,kDAAkD;IAClD,QAAQ,EAAE,MAAM,CAAC;IACjB,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,mCAAmC;IACnC,UAAU,EAAE;QACV,iDAAiD;QACjD,aAAa,EAAE,MAAM,CAAC;QACtB,yCAAyC;QACzC,SAAS,EAAE,MAAM,CAAC;QAClB,yCAAyC;QACzC,aAAa,EAAE,MAAM,CAAC;QACtB,gDAAgD;QAChD,MAAM,EAAE,MAAM,CAAC;QACf,0DAA0D;QAC1D,iBAAiB,EAAE,MAAM,CAAC;QAC1B,kCAAkC;QAClC,aAAa,EAAE,MAAM,CAAC;QACtB,iCAAiC;QACjC,YAAY,EAAE,MAAM,CAAC;KACtB,CAAC;IACF,kCAAkC;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,8CAA8C;IAC9C,KAAK,CAAC,EAAE,kBAAkB,CAAC;IAC3B,yCAAyC;IACzC,OAAO,CAAC,EAAE,oBAAoB,CAAC;CAChC;AAED,6DAA6D;AAC7D,MAAM,WAAW,gBAAgB;IAC/B,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACzC,aAAa,EAAE,OAAO,CAAC;IACvB,YAAY,EAAE,OAAO,CAAC;IACtB,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAID;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,oBAAoB,CAAC,EAAE,MAAM,GAC5B,gBAAgB,CAoClB;AAwID;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,aAAa,CAAC,EAAE,aAAa,EAC7B,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAC1B,cAAc,EAAE,CAyGlB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CACpC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,aAAa,CAAC,EAAE,aAAa,EAC7B,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAC1B,cAAc,GAAG,SAAS,CAG5B;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CAAC,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAAG;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAWtG;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,eAAe,EAC3B,CAAC,GAAE,MAAW,EACd,aAAa,CAAC,EAAE,aAAa,EAC7B,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAC1B,cAAc,EAAE,CAGlB;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,aAAa,EAAE,cAAc,EAC7B,aAAa,EAAE,cAAc,EAAE,GAC9B,cAAc,EAAE,CAgBlB;AAED;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,GAAG,OAAO,CAAC;AAEjE;;GAEG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,cAAc,GAAG,cAAc,CAOtE;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,SAAS,EAAE,cAAc,GAAG,OAAO,CASvE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,wBAAwB,CACtC,aAAa,EAAE,cAAc,EAC7B,aAAa,EAAE,cAAc,EAAE,GAC9B,YAAY,EAAE,CA2GhB;AAED,oCAAoC;AACpC,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,YAAY,GAAG,WAAW,GAAG,UAAU,GAAG,aAAa,GAAG,OAAO,GAAG,WAAW,CAAC;IACvF,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,cAAc,EAAE,CAAC;CAC9B"}

package/dist/learning/model-first-router.js

@@ -308,6 +308,33 @@ export function pickBestModelCandidate(taskDescription, complexity, configManage
     const candidates = buildModelCandidates(taskDescription, complexity, configManager, allowedProviders);
     return candidates[0];
 }
+/**
+ * Count what the pool ACTUALLY offers right now.
+ *
+ * WHY THIS EXISTS (G9): the failure report used to decide its closing sentence
+ * from the PARK list alone — and a dead pair (a provider that answered "model
+ * not found") has no expiry, so a report whose only exclusions were dead pairs
+ * printed "No suitable model is available right now". Live, that sentence was
+ * shown while 507 models were eligible and the provider served a request 52
+ * seconds later. A report that cannot count the pool cannot claim it is empty,
+ * so the count is computed through the SAME filtering the router uses (dead
+ * pairs + non-chat models excluded) — the report can never disagree with what
+ * routing would actually consider.
+ */
+export function countEligibleModels(allowedProviders) {
+    try {
+        // A neutral, class-agnostic description: we want the SIZE of the pool, not
+        // a ranking. Complexity only shifts score weights, never eligibility.
+        const candidates = buildModelCandidates('general task', 'moderate', undefined, allowedProviders);
+        const providers = new Set();
+        for (const c of candidates)
+            providers.add(c.provider);
+        return { models: candidates.length, providers: providers.size };
+    }
+    catch {
+        return { models: 0, providers: 0 };
+    }
+}
 /**
  * Get the top N model candidates for failover.
  */