labre-mcp 0.1.0

package/dist/work-on-evolution/write/lib/evolution-input-validation.mjs

@@ -0,0 +1,51 @@
+// Input validation and classification resolution for one-shot evolution estimation
+//
+// Single responsibility:
+//   - validateOneShotInput: Zod-validates the raw input bag (same schema as the
+//     estimateEvolution MCP tool since both share the same public surface)
+//   - resolveClassification: resolves classification via pre-set space or
+//     classification gate
+//   - VALID_SPACES: canonical list of valid Wardley spaces (kept for legacy imports)
+import { classifyComponent } from '../routing/classification-gate.mjs';
+import { EstimateEvolutionInputSchema } from '../../../schemas/estimate-evolution.schema.mjs';
+// ─── Valid Spaces ────────────────────────────────────────────────────────────
+export const VALID_SPACES = ['economic', 'social_good', 'common_good'];
+// ─── Input Validation ────────────────────────────────────────────────────────
+/**
+ * Validate one-shot input parameters via Zod.
+ * Throws a ZodError on invalid inputs (with structured `issues`).
+ *
+ * Delegates to EstimateEvolutionInputSchema — the MCP tool and the direct
+ * programmatic API share the same input contract.
+ */
+export function validateOneShotInput(input) {
+    return EstimateEvolutionInputSchema.parse(input);
+}
+// ─── Classification Resolution ──────────────────────────────────────────────
+/**
+ * Resolve classification: use provided space or auto-detect via classification gate.
+ *
+ * @param {string} name - Component name
+ * @param {string} description - Context/description
+ * @param {string|undefined} space - Pre-classified space or undefined
+ * @returns {import('../routing/classification-gate.mjs').ClassificationResult}
+ */
+export function resolveClassification(name, description, space) {
+    if (space) {
+        // Use the provided space directly — skip the classification gate
+        const requiresReQuestion = space !== 'economic';
+        const reasons = {
+            economic: `"${name}" pre-classified as economic — suitable for Wardley evolution evaluation.`,
+            social_good: `"${name}" pre-classified as social_good — naturally available resource outside economic space.`,
+            common_good: `"${name}" pre-classified as common_good — collectively managed resource beyond economic space.`,
+        };
+        return {
+            space,
+            reason: reasons[space],
+            requiresReQuestion,
+        };
+    }
+    // Auto-detect via classification gate
+    return classifyComponent(name, description);
+}
+//# sourceMappingURL=evolution-input-validation.mjs.map

package/dist/work-on-evolution/write/lib/evolution-input-validation.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"evolution-input-validation.mjs","sourceRoot":"","sources":["../../../../src/work-on-evolution/write/lib/evolution-input-validation.mts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,EAAE;AACF,yBAAyB;AACzB,gFAAgF;AAChF,2EAA2E;AAC3E,0EAA0E;AAC1E,0BAA0B;AAC1B,qFAAqF;AAErF,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AACvE,OAAO,EAAE,4BAA4B,EAAE,MAAM,gDAAgD,CAAC;AAE9F,gFAAgF;AAEhF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,UAAU,EAAE,aAAa,EAAE,aAAa,CAAU,CAAC;AAEhF,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAc;IACjD,OAAO,4BAA4B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACnD,CAAC;AAED,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAY,EAAE,WAAmB,EAAE,KAAyB;IAChG,IAAI,KAAK,EAAE,CAAC;QACV,iEAAiE;QACjE,MAAM,kBAAkB,GAAG,KAAK,KAAK,UAAU,CAAC;QAChD,MAAM,OAAO,GAA2B;YACtC,QAAQ,EAAE,IAAI,IAAI,2EAA2E;YAC7F,WAAW,EAAE,IAAI,IAAI,wFAAwF;YAC7G,WAAW,EAAE,IAAI,IAAI,wFAAwF;SAC9G,CAAC;QAEF,OAAO;YACL,KAAK;YACL,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC;YACtB,kBAAkB;SACnB,CAAC;IACJ,CAAC;IAED,sCAAsC;IACtC,OAAO,iBAAiB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;AAC9C,CAAC"}

package/dist/work-on-evolution/write/patent/cpc-mapper.d.mts

@@ -0,0 +1,128 @@
+import type { CpcEntry, CpcMappingResult } from '../../../types/patent.mjs';
+import type { LLMCall } from '../../../types/llm.mjs';
+/**
+ * Regex for a valid CPC code at any level of the hierarchy:
+ *   - Subclass:  G06F           (4 chars)
+ *   - Group:     G06F9/         (subclass + digits + slash)
+ *   - Subgroup:  G06F9/455      (group + digits)
+ *   - Full:      G06F9/45558    (group + longer digits)
+ */
+export declare const CPC_CODE_REGEX: RegExp;
+/**
+ * Validate a CPC code string at any hierarchy level.
+ * @param {string} code
+ * @returns {boolean}
+ */
+export declare function isValidCpcCode(code: unknown): boolean;
+export declare function parseCpcPickClass(response: string): string | null;
+export declare function parseCpcPickFromList(response: string, ctx: {
+    codeEntries: CpcEntry[];
+}): string[];
+export declare function parseCpcFallback(response: string): string[];
+/**
+ * Ask LLM to identify the CPC class (3 chars) for a capability.
+ * @param {string} capability
+ * @param {function} llmCall
+ * @returns {Promise<string|null>} 3-char class code or null
+ */
+declare function llmPickClass(capability: string, llmCall: LLMCall): Promise<string | null>;
+/**
+ * Ask LLM to pick from a list of real CPC codes (with titles and parent context).
+ * @param {string} capability
+ * @param {Array<{code: string, cnt: number, title?: string}>} codeEntries - Available codes
+ * @param {function} llmCall
+ * @param {Object} [options]
+ * @param {Array<{code: string, title: string}>} [options.parentPath] - Breadcrumb of parent selections
+ * @returns {Promise<string[]>} Selected codes (1-3)
+ */
+declare function llmPickFromList(capability: string, codeEntries: CpcEntry[], llmCall: LLMCall, options?: {
+    parentPath?: Array<{
+        code: string;
+        title: string;
+    }>;
+}): Promise<string[]>;
+/**
+ * Format a number for display (e.g., 8780599 → "8.8M").
+ * @param {number} n
+ * @returns {string}
+ */
+declare function formatCount(n: number): string;
+/**
+ * Fallback: ask LLM to produce CPC codes without progressive discovery.
+ * Used when BigQuery/cache is unavailable.
+ * @param {string} capability
+ * @param {function} llmCall
+ * @returns {Promise<string[]>} Array of 4-char CPC codes
+ */
+declare function llmFallbackMapping(capability: string, llmCall: LLMCall): Promise<string[]>;
+/**
+ * Progressively discover CPC codes through the hierarchy.
+ *
+ * Flow:
+ *   1. LLM picks class (3 chars)
+ *   2. Cache → subclasses (with titles) → LLM picks (4 chars)
+ *   3. Cache → groups (with titles) → LLM picks (e.g., "G06F9/")
+ *   4. Cache → subgroups (with titles) → LLM picks (e.g., "G06F9/455")
+ *
+ * At each level, the LLM sees:
+ *   - The parent classification path (breadcrumb)
+ *   - Code titles from cpc.definition (not just raw codes)
+ *
+ * @param {string} capability - Technology capability text
+ * @param {function} llmCall - LLM call function
+ * @param {import('./cpc-taxonomy-cache.mjs').CpcTaxonomyCache} taxonomyCache
+ * @returns {Promise<{codes: string[], titles: Record<string, string>}>}
+ */
+declare function progressiveDiscovery(capability: string, llmCall: LLMCall, taxonomyCache: {
+    getSubclasses: (c: string) => Promise<CpcEntry[]>;
+    getGroups: (c: string) => Promise<CpcEntry[]>;
+    getSubgroups: (c: string) => Promise<CpcEntry[]>;
+}): Promise<CpcMappingResult>;
+/**
+ * Default CPC code returned when all resolution paths fail.
+ * @type {string[]}
+ */
+declare const ULTIMATE_DEFAULT_CODES: string[];
+/**
+ * Map a capability string to 1-5 CPC codes via progressive discovery.
+ *
+ * Resolution cascade:
+ *   1. Progressive discovery (LLM + cache/BigQuery hierarchy with titles)
+ *   2. LLM fallback (no cache — LLM guesses from training knowledge)
+ *   3. Ultimate default: ['G06F']
+ *
+ * **Return contract:** Always returns { codes: string[] (1-5), titles: Record<string,string> }.
+ * Never throws, codes never empty.
+ *
+ * @param {string} capability - Technology capability or component description
+ * @param {Object} [options]
+ * @param {function} [options.llmCall] - Injected LLM call function
+ * @param {import('./cpc-taxonomy-cache.mjs').CpcTaxonomyCache} [options.taxonomyCache] - CPC cache
+ * @returns {Promise<{codes: string[], titles: Record<string, string>}>}
+ */
+export declare function mapCapabilityToCPC(capability: string, options?: {
+    llmCall?: LLMCall;
+    taxonomyCache?: any;
+}): Promise<CpcMappingResult>;
+/**
+ * Map a component to CPC codes.
+ *
+ * Uses component.capability (from identify-capability pipeline) if available,
+ * otherwise falls back to component.name.
+ *
+ * @param {import('../strategies/capacity/base-strategy.mjs').ComponentInput} component
+ * @param {function} [llmCall] - Optional LLM call function
+ * @param {Object} [options]
+ * @param {import('./cpc-taxonomy-cache.mjs').CpcTaxonomyCache} [options.taxonomyCache]
+ * @returns {Promise<{codes: string[], titles: Record<string, string>}>}
+ */
+export declare function mapComponentToCpc(component: {
+    name?: string;
+    capability?: string;
+    description?: string;
+    metadata?: Record<string, unknown>;
+}, llmCall: LLMCall, options?: {
+    taxonomyCache?: any;
+}): Promise<CpcMappingResult>;
+export { llmPickClass, llmPickFromList, llmFallbackMapping, progressiveDiscovery, formatCount, ULTIMATE_DEFAULT_CODES, };
+//# sourceMappingURL=cpc-mapper.d.mts.map

package/dist/work-on-evolution/write/patent/cpc-mapper.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cpc-mapper.d.mts","sourceRoot":"","sources":["../../../../src/work-on-evolution/write/patent/cpc-mapper.mts"],"names":[],"mappings":"AAoBA,OAAO,KAAK,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC5E,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAMtD;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,QAAsC,CAAC;AAElE;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,OAAO,GAAG,OAAO,CAErD;AAQD,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAGjE;AAED,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE;IAAE,WAAW,EAAE,QAAQ,EAAE,CAAA;CAAE,GAAG,MAAM,EAAE,CAOjG;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAM3D;AAID;;;;;GAKG;AACH,iBAAe,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAKxF;AAED;;;;;;;;GAQG;AACH,iBAAe,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAE;IAAE,UAAU,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAqBtL;AAED;;;;GAIG;AACH,iBAAS,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAItC;AAMD;;;;;;GAMG;AACH,iBAAe,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAKzF;AAID;;;;;;;;;;;;;;;;;GAiBG;AACH,iBAAe,oBAAoB,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE;IAAE,aAAa,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;IAAC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;IAAC,YAAY,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAA;CAAE,GAAG,OAAO,CAAC,gBAAgB,CAAC,CA+D1Q;AAID;;;GAGG;AACH,QAAA,MAAM,sBAAsB,UAAW,CAAC;AAExC;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAsB,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,GAAE;IAAE,OAAO,CAAC,EAAE,OAAO,CAAC;IAAC,aAAa,CAAC,EAAE,GAAG,CAAA;CAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAwChJ;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,iBAAiB,CAAC,SAAS,EAAE;IAAE,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,GAAG,CAAA;CAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAMvO;AAID,OAAO,EACL,YAAY,EACZ,eAAe,EACf,kBAAkB,EAClB,oBAAoB,EACpB,WAAW,EACX,sBAAsB,GACvB,CAAC"}

package/dist/work-on-evolution/write/patent/cpc-mapper.mjs

@@ -0,0 +1,298 @@
+// CPC Mapper: translate Wardley component capabilities into CPC codes
+// via progressive discovery through the CPC hierarchy.
+//
+// Resolution strategy:
+//   1. LLM identifies the CPC section + class (e.g., "G06")
+//   2. Cache/BigQuery provides real subclasses → LLM picks (e.g., "G06F")
+//   3. Cache/BigQuery provides real groups → LLM picks (e.g., "G06F9/")
+//   4. Optionally: cache provides subgroups → LLM picks (e.g., "G06F9/455")
+//
+// At each level, the LLM chooses from REAL codes that exist in the patent
+// database — no guessing in the void.
+//
+// Fallback: if BigQuery/cache is unavailable, the LLM returns a 4-char code
+// from its training knowledge (graceful degradation).
+//
+// Pipeline integration:
+//   cpc-evolution-strategy.mjs calls mapCapabilityToCPC(capability, options)
+//   which returns 1-5 CPC codes at the most specific level discovered.
+import { getStrategyLLM } from '../../../lib/llm/registry.mjs';
+import { getPrompt } from '../../../lib/prompts/registry.mjs';
+import { getCurrentCollector } from '../../../lib/degradation/index.mjs';
+// ─── CPC code validation ───────────────────────────────────────────────────
+/**
+ * Regex for a valid CPC code at any level of the hierarchy:
+ *   - Subclass:  G06F           (4 chars)
+ *   - Group:     G06F9/         (subclass + digits + slash)
+ *   - Subgroup:  G06F9/455      (group + digits)
+ *   - Full:      G06F9/45558    (group + longer digits)
+ */
+export const CPC_CODE_REGEX = /^[A-H]\d{2}[A-Z](\d+\/([\d]+)?)?$/;
+/**
+ * Validate a CPC code string at any hierarchy level.
+ * @param {string} code
+ * @returns {boolean}
+ */
+export function isValidCpcCode(code) {
+    return typeof code === 'string' && CPC_CODE_REGEX.test(code);
+}
+// ─── LLM prompt templates ──────────────────────────────────────────────────
+// Prompt text lives in prompts/cpc-mapper.{pick-class,pick-from-list,fallback}.md.
+// ─── Response parsers (registered in src/lib/prompts/init.mts) ─────────────
+export function parseCpcPickClass(response) {
+    const match = response.match(/\b([A-H]\d{2})\b/);
+    return match ? match[1] : null;
+}
+export function parseCpcPickFromList(response, ctx) {
+    const availableCodes = new Set(ctx.codeEntries.map(e => e.code));
+    const selected = response
+        .split(/[\s,;\n]+/)
+        .map(s => s.trim())
+        .filter(s => availableCodes.has(s));
+    return [...new Set(selected)].slice(0, 3);
+}
+export function parseCpcFallback(response) {
+    const codes = response
+        .split(/[\s,;\n]+/)
+        .map(s => s.trim().toUpperCase())
+        .filter(s => /^[A-H]\d{2}[A-Z]$/.test(s));
+    return [...new Set(codes)].slice(0, 5);
+}
+// ─── Internal LLM helpers ───────────────────────────────────────────────────
+/**
+ * Ask LLM to identify the CPC class (3 chars) for a capability.
+ * @param {string} capability
+ * @param {function} llmCall
+ * @returns {Promise<string|null>} 3-char class code or null
+ */
+async function llmPickClass(capability, llmCall) {
+    const p = getPrompt('cpc-mapper', 'pick-class');
+    const built = p.build({ capability });
+    const response = await llmCall(built.user, undefined, { systemPrompt: built.system });
+    return p.parse(response);
+}
+/**
+ * Ask LLM to pick from a list of real CPC codes (with titles and parent context).
+ * @param {string} capability
+ * @param {Array<{code: string, cnt: number, title?: string}>} codeEntries - Available codes
+ * @param {function} llmCall
+ * @param {Object} [options]
+ * @param {Array<{code: string, title: string}>} [options.parentPath] - Breadcrumb of parent selections
+ * @returns {Promise<string[]>} Selected codes (1-3)
+ */
+async function llmPickFromList(capability, codeEntries, llmCall, options = {}) {
+    if (codeEntries.length === 0)
+        return [];
+    if (codeEntries.length === 1)
+        return [codeEntries[0].code];
+    // Format codes with titles and patent counts
+    const codesList = codeEntries
+        .map(e => {
+        const title = e.title && e.title !== e.code ? ` — ${e.title}` : '';
+        return `${e.code}${title} (${formatCount(e.cnt)} patents)`;
+    })
+        .join('\n');
+    // Format parent context as breadcrumb
+    const parentContext = options.parentPath?.length
+        ? `\nParent classification path:\n${options.parentPath.map((p) => `  ${p.code} (${p.title})`).join(' > ')}\n`
+        : '';
+    const p = getPrompt('cpc-mapper', 'pick-from-list');
+    const built = p.build({ capability, parent_context: parentContext, codes_list: codesList });
+    const response = await llmCall(built.user, undefined, { systemPrompt: built.system });
+    return p.parse(response, { codeEntries });
+}
+/**
+ * Format a number for display (e.g., 8780599 → "8.8M").
+ * @param {number} n
+ * @returns {string}
+ */
+function formatCount(n) {
+    if (n >= 1_000_000)
+        return (n / 1_000_000).toFixed(1) + 'M';
+    if (n >= 1_000)
+        return (n / 1_000).toFixed(0) + 'K';
+    return String(n);
+}
+// ─── Standalone LLM fallback (no cache) ─────────────────────────────────────
+// LLM_FALLBACK_PROMPT moved to prompts/cpc-mapper.fallback.md.
+/**
+ * Fallback: ask LLM to produce CPC codes without progressive discovery.
+ * Used when BigQuery/cache is unavailable.
+ * @param {string} capability
+ * @param {function} llmCall
+ * @returns {Promise<string[]>} Array of 4-char CPC codes
+ */
+async function llmFallbackMapping(capability, llmCall) {
+    const p = getPrompt('cpc-mapper', 'fallback');
+    const built = p.build({ capability });
+    const response = await llmCall(built.user, undefined, { systemPrompt: built.system });
+    return p.parse(response);
+}
+// ─── Progressive discovery engine ───────────────────────────────────────────
+/**
+ * Progressively discover CPC codes through the hierarchy.
+ *
+ * Flow:
+ *   1. LLM picks class (3 chars)
+ *   2. Cache → subclasses (with titles) → LLM picks (4 chars)
+ *   3. Cache → groups (with titles) → LLM picks (e.g., "G06F9/")
+ *   4. Cache → subgroups (with titles) → LLM picks (e.g., "G06F9/455")
+ *
+ * At each level, the LLM sees:
+ *   - The parent classification path (breadcrumb)
+ *   - Code titles from cpc.definition (not just raw codes)
+ *
+ * @param {string} capability - Technology capability text
+ * @param {function} llmCall - LLM call function
+ * @param {import('./cpc-taxonomy-cache.mjs').CpcTaxonomyCache} taxonomyCache
+ * @returns {Promise<{codes: string[], titles: Record<string, string>}>}
+ */
+async function progressiveDiscovery(capability, llmCall, taxonomyCache) {
+    const parentPath = [];
+    const titles = {};
+    // Helper: find entry by code in a list
+    const findEntry = (list, code) => list.find((e) => e.code === code);
+    // Step 1: LLM identifies the class
+    const classCode = await llmPickClass(capability, llmCall);
+    if (!classCode)
+        return { codes: [], titles };
+    // Step 2: Get real subclasses from cache/BigQuery (with titles)
+    const subclasses = await taxonomyCache.getSubclasses(classCode);
+    if (subclasses.length === 0)
+        return { codes: [], titles };
+    const selectedSubclasses = await llmPickFromList(capability, subclasses, llmCall, { parentPath });
+    if (selectedSubclasses.length === 0)
+        return { codes: [], titles };
+    // Record titles and build parent path
+    for (const code of selectedSubclasses) {
+        const entry = findEntry(subclasses, code);
+        if (entry?.title)
+            titles[code] = entry.title;
+    }
+    const scEntry = findEntry(subclasses, selectedSubclasses[0]);
+    parentPath.push({ code: selectedSubclasses[0], title: scEntry?.title || selectedSubclasses[0] });
+    // Step 3: For each selected subclass, get groups
+    const allGroups = [];
+    for (const sc of selectedSubclasses.slice(0, 2)) {
+        const groups = await taxonomyCache.getGroups(sc);
+        if (groups.length > 0)
+            allGroups.push(...groups);
+    }
+    if (allGroups.length === 0)
+        return { codes: selectedSubclasses, titles };
+    const selectedGroups = await llmPickFromList(capability, allGroups, llmCall, { parentPath });
+    if (selectedGroups.length === 0)
+        return { codes: selectedSubclasses, titles };
+    for (const code of selectedGroups) {
+        const entry = findEntry(allGroups, code);
+        if (entry?.title)
+            titles[code] = entry.title;
+    }
+    const grpEntry = findEntry(allGroups, selectedGroups[0]);
+    parentPath.push({ code: selectedGroups[0], title: grpEntry?.title || selectedGroups[0] });
+    // Step 4: For each selected group, get subgroups
+    const allSubgroups = [];
+    for (const grp of selectedGroups.slice(0, 2)) {
+        const subgroups = await taxonomyCache.getSubgroups(grp);
+        if (subgroups.length > 0)
+            allSubgroups.push(...subgroups);
+    }
+    if (allSubgroups.length === 0)
+        return { codes: selectedGroups, titles };
+    const selectedSubgroups = await llmPickFromList(capability, allSubgroups, llmCall, { parentPath });
+    if (selectedSubgroups.length === 0)
+        return { codes: selectedGroups, titles };
+    for (const code of selectedSubgroups) {
+        const entry = findEntry(allSubgroups, code);
+        if (entry?.title)
+            titles[code] = entry.title;
+    }
+    return { codes: selectedSubgroups, titles };
+}
+// ─── Main public API ────────────────────────────────────────────────────────
+/**
+ * Default CPC code returned when all resolution paths fail.
+ * @type {string[]}
+ */
+const ULTIMATE_DEFAULT_CODES = ['G06F'];
+/**
+ * Map a capability string to 1-5 CPC codes via progressive discovery.
+ *
+ * Resolution cascade:
+ *   1. Progressive discovery (LLM + cache/BigQuery hierarchy with titles)
+ *   2. LLM fallback (no cache — LLM guesses from training knowledge)
+ *   3. Ultimate default: ['G06F']
+ *
+ * **Return contract:** Always returns { codes: string[] (1-5), titles: Record<string,string> }.
+ * Never throws, codes never empty.
+ *
+ * @param {string} capability - Technology capability or component description
+ * @param {Object} [options]
+ * @param {function} [options.llmCall] - Injected LLM call function
+ * @param {import('./cpc-taxonomy-cache.mjs').CpcTaxonomyCache} [options.taxonomyCache] - CPC cache
+ * @returns {Promise<{codes: string[], titles: Record<string, string>}>}
+ */
+export async function mapCapabilityToCPC(capability, options = {}) {
+    const cap = (typeof capability === 'string' ? capability : '').trim();
+    if (!cap)
+        return { codes: [...ULTIMATE_DEFAULT_CODES], titles: {} };
+    // Resolve LLM call function
+    const llmCall = typeof options.llmCall === 'function'
+        ? options.llmCall
+        : getStrategyLLM('cpc-mapper');
+    // Path 1: Progressive discovery with taxonomy cache. Failures fall
+    // through to the LLM fallback below — record on the ambient collector
+    // so the user can correlate the eventual ULTIMATE_DEFAULT_CODES path
+    // with its root cause.
+    if (options.taxonomyCache) {
+        const collector = getCurrentCollector();
+        try {
+            const result = await progressiveDiscovery(cap, llmCall, options.taxonomyCache);
+            if (result.codes.length > 0) {
+                return { codes: result.codes.slice(0, 5), titles: result.titles };
+            }
+        }
+        catch (err) {
+            if (collector)
+                collector.recordError('cpc-mapper:progressive', err, { recoverable: true });
+        }
+    }
+    // Path 2: LLM fallback (no cache, returns 4-char codes, no titles)
+    {
+        const collector = getCurrentCollector();
+        try {
+            const codes = await llmFallbackMapping(cap, llmCall);
+            if (codes.length > 0) {
+                return { codes: codes.slice(0, 5), titles: {} };
+            }
+        }
+        catch (err) {
+            if (collector)
+                collector.recordError('cpc-mapper:llm', err, { recoverable: true });
+        }
+    }
+    // Path 3: Ultimate default
+    return { codes: [...ULTIMATE_DEFAULT_CODES], titles: {} };
+}
+/**
+ * Map a component to CPC codes.
+ *
+ * Uses component.capability (from identify-capability pipeline) if available,
+ * otherwise falls back to component.name.
+ *
+ * @param {import('../strategies/capacity/base-strategy.mjs').ComponentInput} component
+ * @param {function} [llmCall] - Optional LLM call function
+ * @param {Object} [options]
+ * @param {import('./cpc-taxonomy-cache.mjs').CpcTaxonomyCache} [options.taxonomyCache]
+ * @returns {Promise<{codes: string[], titles: Record<string, string>}>}
+ */
+export async function mapComponentToCpc(component, llmCall, options = {}) {
+    const capability = component.capability || component.name || '';
+    return mapCapabilityToCPC(capability, {
+        llmCall,
+        taxonomyCache: options.taxonomyCache,
+    });
+}
+// ─── Exports for testing ────────────────────────────────────────────────────
+export { llmPickClass, llmPickFromList, llmFallbackMapping, progressiveDiscovery, formatCount, ULTIMATE_DEFAULT_CODES, };
+//# sourceMappingURL=cpc-mapper.mjs.map

package/dist/work-on-evolution/write/patent/cpc-mapper.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"cpc-mapper.mjs","sourceRoot":"","sources":["../../../../src/work-on-evolution/write/patent/cpc-mapper.mts"],"names":[],"mappings":"AAAA,sEAAsE;AACtE,uDAAuD;AACvD,EAAE;AACF,uBAAuB;AACvB,4DAA4D;AAC5D,0EAA0E;AAC1E,wEAAwE;AACxE,4EAA4E;AAC5E,EAAE;AACF,0EAA0E;AAC1E,sCAAsC;AACtC,EAAE;AACF,4EAA4E;AAC5E,sDAAsD;AACtD,EAAE;AACF,wBAAwB;AACxB,6EAA6E;AAC7E,uEAAuE;AAEvE,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAG/D,OAAO,EAAE,SAAS,EAAE,MAAM,mCAAmC,CAAC;AAC9D,OAAO,EAAE,mBAAmB,EAAE,MAAM,oCAAoC,CAAC;AAEzE,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,mCAAmC,CAAC;AAElE;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,IAAa;IAC1C,OAAO,OAAO,IAAI,KAAK,QAAQ,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC/D,CAAC;AAED,8EAA8E;AAE9E,mFAAmF;AAEnF,8EAA8E;AAE9E,MAAM,UAAU,iBAAiB,CAAC,QAAgB;IAChD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACjD,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,QAAgB,EAAE,GAAgC;IACrF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACjE,MAAM,QAAQ,GAAG,QAAQ;SACtB,KAAK,CAAC,WAAW,CAAC;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,QAAgB;IAC/C,MAAM,KAAK,GAAG,QAAQ;SACnB,KAAK,CAAC,WAAW,CAAC;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;SAChC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,+EAA+E;AAE/E;;;;;GAKG;AACH,KAAK,UAAU,YAAY,CAAC,UAAkB,EAAE,OAAgB;IAC9D,MAAM,CAAC,GAAG,SAAS,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACtF,OAAO,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;;;GAQG;AACH,KAAK,UAAU,eAAe,CAAC,UAAkB,EAAE,WAAuB,EAAE,OAAgB,EAAE,UAAmE,EAAE;IACjK,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAE3D,6CAA6C;IAC7C,MAAM,SAAS,GAAG,WAAW;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE;QACP,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,OAAO,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC;IAC7D,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,sCAAsC;IACtC,MAAM,aAAa,GAAG,OAAO,CAAC,UAAU,EAAE,MAAM;QAC9C,CAAC,CAAC,kCAAkC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI;QAClH,CAAC,CAAC,EAAE,CAAC;IAEP,MAAM,CAAC,GAAG,SAAS,CAAC,YAAY,EAAE,gBAAgB,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC;IAC5F,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACtF,OAAO,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,CAAS;IAC5B,IAAI,CAAC,IAAI,SAAS;QAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IAC5D,IAAI,CAAC,IAAI,KAAK;QAAE,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACpD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAED,+EAA+E;AAE/E,+DAA+D;AAE/D;;;;;;GAMG;AACH,KAAK,UAAU,kBAAkB,CAAC,UAAkB,EAAE,OAAgB;IACpE,MAAM,CAAC,GAAG,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACtF,OAAO,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;GAiBG;AACH,KAAK,UAAU,oBAAoB,CAAC,UAAkB,EAAE,OAAgB,EAAE,aAAqK;IAC7O,MAAM,UAAU,GAA2C,EAAE,CAAC;IAC9D,MAAM,MAAM,GAA2B,EAAE,CAAC;IAE1C,uCAAuC;IACvC,MAAM,SAAS,GAAG,CAAC,IAAgB,EAAE,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAW,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAElG,mCAAmC;IACnC,MAAM,SAAS,GAAG,MAAM,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC1D,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC;IAE7C,gEAAgE;IAChE,MAAM,UAAU,GAAG,MAAM,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;IAChE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC;IAE1D,MAAM,kBAAkB,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;IAClG,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC;IAElE,sCAAsC;IACtC,KAAK,MAAM,IAAI,IAAI,kBAAkB,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,KAAK,EAAE,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC/C,CAAC;IACD,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEjG,iDAAiD;IACjD,MAAM,SAAS,GAAG,EAAE,CAAC;IACrB,KAAK,MAAM,EAAE,IAAI,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QAChD,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACjD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAEzE,MAAM,cAAc,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;IAC7F,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAE9E,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACzC,IAAI,KAAK,EAAE,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC/C,CAAC;IACD,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,IAAI,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE1F,iDAAiD;IACjD,MAAM,YAAY,GAAG,EAAE,CAAC;IACxB,KAAK,MAAM,GAAG,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACxD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,YAAY,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC5D,CAAC;IAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC;IAExE,MAAM,iBAAiB,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;IACnG,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC;IAE7E,KAAK,MAAM,IAAI,IAAI,iBAAiB,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAI,KAAK,EAAE,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IAC/C,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC;AAC9C,CAAC;AAED,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,sBAAsB,GAAG,CAAC,MAAM,CAAC,CAAC;AAExC;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,UAAkB,EAAE,UAAsD,EAAE;IACnH,MAAM,GAAG,GAAG,CAAC,OAAO,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACtE,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,sBAAsB,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAEpE,4BAA4B;IAC5B,MAAM,OAAO,GAAG,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU;QACnD,CAAC,CAAC,OAAO,CAAC,OAAO;QACjB,CAAC,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;IAEjC,mEAAmE;IACnE,sEAAsE;IACtE,qEAAqE;IACrE,uBAAuB;IACvB,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,mBAAmB,EAAE,CAAC;QACxC,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,oBAAoB,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;YAC/E,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;YACpE,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,SAAS;gBAAE,SAAS,CAAC,WAAW,CAAC,wBAAwB,EAAE,GAAG,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;QAC7F,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,CAAC;QACC,MAAM,SAAS,GAAG,mBAAmB,EAAE,CAAC;QACxC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACrD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YAClD,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,SAAS;gBAAE,SAAS,CAAC,WAAW,CAAC,gBAAgB,EAAE,GAAG,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,sBAAsB,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAC5D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,SAA2G,EAAE,OAAgB,EAAE,UAAmC,EAAE;IAC1M,MAAM,UAAU,GAAG,SAAS,CAAC,UAAU,IAAI,SAAS,CAAC,IAAI,IAAI,EAAE,CAAC;IAChE,OAAO,kBAAkB,CAAC,UAAU,EAAE;QACpC,OAAO;QACP,aAAa,EAAE,OAAO,CAAC,aAAa;KACrC,CAAC,CAAC;AACL,CAAC;AAED,+EAA+E;AAE/E,OAAO,EACL,YAAY,EACZ,eAAe,EACf,kBAAkB,EAClB,oBAAoB,EACpB,WAAW,EACX,sBAAsB,GACvB,CAAC"}

package/dist/work-on-evolution/write/patent/cpc-taxonomy-cache.d.mts

@@ -0,0 +1,91 @@
+import type { CpcEntry } from '../../../types/patent.mjs';
+/** Default TTL for cached entries: 30 days in milliseconds. */
+export declare const DEFAULT_TTL_MS: number;
+/** Default cache file path. */
+export declare const DEFAULT_CACHE_PATH: string;
+/**
+ * Get the human-readable title for a CPC code.
+ * Resolves from the in-memory title store (populated by cache lookups).
+ *
+ * Fallback chain:
+ *   1. Exact match in title store
+ *   2. Trimmed trailing zeros (G06F9/50 → G06F9/5)
+ *   3. Parent group (G06F9/455 → G06F9/)
+ *   4. The code itself
+ *
+ * @param {string} code - CPC code at any hierarchy level
+ * @returns {string}
+ */
+export declare function getCpcTitle(code: string): string;
+/**
+ * Register a title in the global store.
+ * Called internally when cache entries are loaded, or externally
+ * by the strategy to register titles from progressive discovery.
+ * @param {string} code
+ * @param {string} title
+ */
+export declare function setCpcTitle(code: string, title: string): void;
+export declare class CpcTaxonomyCache {
+    _client: any;
+    _queryOptions: Record<string, unknown>;
+    _cachePath: string;
+    _ttlMs: number;
+    _memory: Map<string, {
+        children: CpcEntry[];
+        fetchedAt: number;
+    }>;
+    _diskLoaded: boolean;
+    constructor({ bigqueryClient, queryOptions, cachePath, ttlMs }?: {
+        bigqueryClient?: any;
+        queryOptions?: Record<string, unknown>;
+        cachePath?: string;
+        ttlMs?: number;
+    });
+    /**
+     * Get subclasses of a CPC class (3-char code → 4-char codes with titles).
+     * @param {string} classCode - 3-char class code (e.g., "G06")
+     * @returns {Promise<CpcEntry[]>}
+     */
+    getSubclasses(classCode: string): Promise<CpcEntry[]>;
+    /**
+     * Get groups of a CPC subclass (4-char code → group prefixes with titles).
+     * @param {string} subclassCode - 4-char subclass code (e.g., "G06F")
+     * @returns {Promise<CpcEntry[]>}
+     */
+    getGroups(subclassCode: string): Promise<CpcEntry[]>;
+    /**
+     * Get subgroups of a CPC group (group prefix → full codes with titles).
+     * @param {string} groupCode - Group prefix (e.g., "G06F9/")
+     * @returns {Promise<CpcEntry[]>}
+     */
+    getSubgroups(groupCode: string): Promise<CpcEntry[]>;
+    /**
+     * Get cached children or fetch from BigQuery.
+     * Registers titles in the global store on load.
+     * @private
+     */
+    _getOrFetch(parentCode: string, sql: string): Promise<CpcEntry[]>;
+    /**
+     * Fetch CPC hierarchy data from BigQuery (with titles from cpc.definition).
+     * @private
+     */
+    _fetchFromBigQuery(parentCode: string, sql: string): Promise<CpcEntry[]>;
+    /** @private */
+    _loadFromDisk(): Promise<void>;
+    /** @private */
+    _saveToDisk(): Promise<void>;
+    /** Clear all cached entries (memory + disk + title store). */
+    clear(): Promise<void>;
+    /** Get the number of cached entries. */
+    get size(): number;
+}
+/**
+ * Create a CpcTaxonomyCache with BigQuery client from environment.
+ * @param {Object} [options]
+ * @returns {Promise<CpcTaxonomyCache>}
+ */
+export declare function createTaxonomyCache(options?: {
+    cachePath?: string;
+    ttlMs?: number;
+}): Promise<CpcTaxonomyCache>;
+//# sourceMappingURL=cpc-taxonomy-cache.d.mts.map

package/dist/work-on-evolution/write/patent/cpc-taxonomy-cache.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cpc-taxonomy-cache.d.mts","sourceRoot":"","sources":["../../../../src/work-on-evolution/write/patent/cpc-taxonomy-cache.mts"],"names":[],"mappings":"AAmBA,OAAO,KAAK,EAAE,QAAQ,EAAe,MAAM,2BAA2B,CAAC;AAOvE,+DAA+D;AAC/D,eAAO,MAAM,cAAc,QAA2B,CAAC;AAEvD,+BAA+B;AAC/B,eAAO,MAAM,kBAAkB,QAA0D,CAAC;AAgF1F;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAiBhD;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAI7D;AAID,qBAAa,gBAAgB;IAC3B,OAAO,EAAE,GAAG,CAAC;IACb,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE;QAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAClE,WAAW,EAAE,OAAO,CAAC;gBAET,EAAE,cAAc,EAAE,YAAY,EAAE,SAAS,EAAE,KAAK,EAAE,GAAE;QAAE,cAAc,CAAC,EAAE,GAAG,CAAC;QAAC,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAO;IAWzK;;;;OAIG;IACG,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAK3D;;;;OAIG;IACG,SAAS,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAK1D;;;;OAIG;IACG,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAK1D;;;;OAIG;IACG,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAmCvE;;;OAGG;IACG,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAyB9E,eAAe;IACT,aAAa;IAqBnB,eAAe;IACT,WAAW;IAUjB,8DAA8D;IACxD,KAAK;IAQX,wCAAwC;IACxC,IAAI,IAAI,WAEP;CACF;AAID;;;;GAIG;AACH,wBAAsB,mBAAmB,CAAC,OAAO,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,6BAmB7F"}