causantic 0.9.3 → 0.10.0

package/dist/eval/experiments/rescorer-ceiling/run-experiment.js

@@ -0,0 +1,226 @@
+/**
+ * Re-scorer Ceiling Analysis
+ *
+ * Measures how much headroom a second-stage re-scorer would have by answering:
+ *   1. At high K values, what % of ground-truth chunks appear in vector search?
+ *   2. When found, what's their rank distribution?
+ *   3. If a perfect re-scorer promoted every found target to rank 1,
+ *      what would budget assembly look like?
+ *
+ * Tests both raw chunk search and index entry search paths.
+ *
+ * Usage:
+ *   npx tsx src/eval/experiments/rescorer-ceiling/run-experiment.ts [--sample-size=50]
+ */
+import { getDb } from '../../../storage/db.js';
+import { vectorStore, indexVectorStore } from '../../../storage/vector-store.js';
+import { getChunkById } from '../../../storage/chunk-store.js';
+import { getIndexEntryCount, getIndexedChunkCount, dereferenceToChunkIds, } from '../../../storage/index-entry-store.js';
+import { getAllClusters, getClusterChunkIds } from '../../../storage/cluster-store.js';
+import { Embedder } from '../../../models/embedder.js';
+import { getModel } from '../../../models/model-registry.js';
+import { loadConfig, toRuntimeConfig } from '../../../config/loader.js';
+import { generateSearchQueries } from '../index-vs-chunk/query-generator.js';
+// ── Helpers ────────────────────────────────────────────────────────────────
+function createRng(seed) {
+    let s = seed;
+    return () => {
+        s = (s * 1664525 + 1013904223) & 0x7fffffff;
+        return s / 0x7fffffff;
+    };
+}
+function sampleChunks(sampleSize, seed) {
+    getDb();
+    const clusters = getAllClusters();
+    if (clusters.length === 0)
+        throw new Error('No clusters found.');
+    const rng = createRng(seed);
+    const result = [];
+    const shuffled = [...clusters].sort(() => rng() - 0.5);
+    for (const cluster of shuffled) {
+        if (result.length >= sampleSize)
+            break;
+        const chunkIds = getClusterChunkIds(cluster.id);
+        if (chunkIds.length < 2)
+            continue;
+        const numPicks = Math.min(2, Math.ceil(sampleSize / clusters.length), chunkIds.length);
+        const shuffledIds = [...chunkIds].sort(() => rng() - 0.5);
+        for (let i = 0; i < numPicks && result.length < sampleSize; i++) {
+            const chunk = getChunkById(shuffledIds[i]);
+            if (!chunk || chunk.content.length < 100)
+                continue;
+            result.push({
+                id: chunk.id,
+                sessionSlug: chunk.sessionSlug,
+                content: chunk.content,
+                clusterId: cluster.id,
+                clusterName: cluster.name,
+            });
+        }
+    }
+    return result;
+}
+function percentile(sorted, p) {
+    if (sorted.length === 0)
+        return 0;
+    const idx = Math.ceil((p / 100) * sorted.length) - 1;
+    return sorted[Math.max(0, idx)];
+}
+// ── Search functions ───────────────────────────────────────────────────────
+async function searchChunkPath(embedding, targetId, limit) {
+    const results = await vectorStore.search(embedding, limit);
+    const rank = results.findIndex((r) => r.id === targetId) + 1;
+    return { found: rank > 0, rank };
+}
+async function searchIndexPath(embedding, targetId, limit, entriesPerChunk) {
+    const indexLimit = Math.ceil(limit * entriesPerChunk);
+    const results = await indexVectorStore.search(embedding, indexLimit);
+    // Check each result — an index entry may dereference to multiple chunks
+    for (let i = 0; i < results.length; i++) {
+        const chunkIds = dereferenceToChunkIds([results[i].id]);
+        if (chunkIds.includes(targetId)) {
+            return { found: true, rank: i + 1 };
+        }
+    }
+    return { found: false, rank: 0 };
+}
+// ── Main ───────────────────────────────────────────────────────────────────
+async function runAnalysis() {
+    const args = process.argv.slice(2);
+    const sampleSizeArg = args.find((a) => a.startsWith('--sample-size='));
+    const sampleSize = sampleSizeArg ? parseInt(sampleSizeArg.split('=')[1], 10) : 50;
+    const seed = 42;
+    console.log('=== Re-scorer Ceiling Analysis ===\n');
+    getDb();
+    const externalConfig = loadConfig();
+    const config = toRuntimeConfig(externalConfig);
+    const maxTokens = config.mcpMaxResponseTokens;
+    const useIndex = config.semanticIndex.useForSearch && getIndexEntryCount() > 0;
+    let entriesPerChunk = 1;
+    if (useIndex) {
+        const indexedChunks = getIndexedChunkCount();
+        entriesPerChunk = indexedChunks > 0 ? getIndexEntryCount() / indexedChunks : 1;
+    }
+    console.log(`Search path: ${useIndex ? 'INDEX' : 'CHUNK'}`);
+    if (useIndex)
+        console.log(`Entries per chunk: ${entriesPerChunk.toFixed(1)}`);
+    console.log(`Max response tokens: ${maxTokens}`);
+    vectorStore.setModelId(config.embeddingModel);
+    if (useIndex)
+        indexVectorStore.setModelId(config.embeddingModel);
+    // 1. Sample and generate queries
+    console.log(`\nSampling ${sampleSize} chunks...`);
+    const sampledChunks = sampleChunks(sampleSize, seed);
+    console.log(`  Sampled ${sampledChunks.length} chunks`);
+    console.log('Generating queries...');
+    const queries = await generateSearchQueries(sampledChunks, config.clusterRefreshModel);
+    console.log(`  Generated ${queries.length} queries`);
+    // Get token sizes for budget analysis
+    const chunkTokenSizes = new Map();
+    for (const q of queries) {
+        const chunk = getChunkById(q.groundTruthChunkId);
+        if (chunk)
+            chunkTokenSizes.set(q.groundTruthChunkId, chunk.approxTokens || 500);
+    }
+    // 2. Prepare embedder
+    const embedder = new Embedder();
+    await embedder.load(getModel(config.embeddingModel));
+    console.log('Embedding queries...');
+    const queryEmbeddings = [];
+    for (const q of queries) {
+        const { embedding } = await embedder.embed(q.query, true);
+        queryEmbeddings.push(embedding);
+    }
+    console.log(`  Embedded ${queryEmbeddings.length} queries\n`);
+    // 3. Sweep K values
+    const kValues = [50, 100, 200, 500, 1000, 2000];
+    console.log(`K values: ${kValues.join(', ')}\n`);
+    const resultsByK = new Map();
+    for (const k of kValues) {
+        const ranks = [];
+        let misses = 0;
+        for (let qi = 0; qi < queries.length; qi++) {
+            const q = queries[qi];
+            const embedding = queryEmbeddings[qi];
+            const result = useIndex
+                ? await searchIndexPath(embedding, q.groundTruthChunkId, k, entriesPerChunk)
+                : await searchChunkPath(embedding, q.groundTruthChunkId, k);
+            if (result.found) {
+                ranks.push(result.rank);
+            }
+            else {
+                misses++;
+            }
+        }
+        resultsByK.set(k, { ranks, misses });
+        const total = queries.length;
+        const found = ranks.length;
+        const recall = ((found / total) * 100).toFixed(1);
+        const sortedRanks = [...ranks].sort((a, b) => a - b);
+        const p50 = percentile(sortedRanks, 50);
+        const p90 = percentile(sortedRanks, 90);
+        const p99 = percentile(sortedRanks, 99);
+        console.log(`── K=${k} ──`);
+        console.log(`  Recall: ${found}/${total} (${recall}%)`);
+        if (found > 0) {
+            console.log(`  Rank distribution: median=${p50}, p90=${p90}, p99=${p99}, max=${sortedRanks[sortedRanks.length - 1]}`);
+        }
+    }
+    // 4. Budget ceiling analysis
+    console.log('\n══ Re-scorer Ceiling (perfect re-ranker) ══\n');
+    console.log('If a perfect re-scorer promoted every found target to the top of results,');
+    console.log(`how many would fit within the ${maxTokens}-token budget?\n`);
+    for (const k of kValues) {
+        const { ranks: _ranks, misses: _misses } = resultsByK.get(k);
+        const total = queries.length;
+        // Every found chunk would be promoted to position 1 by a perfect re-scorer
+        // so budget is the only constraint
+        let fitsInBudget = 0;
+        let tooLarge = 0;
+        for (let qi = 0; qi < queries.length; qi++) {
+            const targetId = queries[qi].groundTruthChunkId;
+            const result = useIndex
+                ? await searchIndexPath(queryEmbeddings[qi], targetId, k, entriesPerChunk)
+                : await searchChunkPath(queryEmbeddings[qi], targetId, k);
+            if (!result.found)
+                continue;
+            const tokens = chunkTokenSizes.get(targetId) ?? 500;
+            if (tokens <= maxTokens) {
+                fitsInBudget++;
+            }
+            else {
+                tooLarge++;
+            }
+        }
+        const ceiling = ((fitsInBudget / total) * 100).toFixed(1);
+        const currentBest = resultsByK.get(k);
+        console.log(`  K=${k}: ceiling=${ceiling}% (${fitsInBudget}/${total})  [recall=${((currentBest.ranks.length / total) * 100).toFixed(1)}%, oversized=${tooLarge}]`);
+    }
+    // 5. Rank bucket analysis — where do found targets cluster?
+    console.log('\n══ Rank Buckets (K=2000) ══\n');
+    const best = resultsByK.get(kValues[kValues.length - 1]);
+    if (best && best.ranks.length > 0) {
+        const buckets = [
+            { label: '1-10', min: 1, max: 10 },
+            { label: '11-50', min: 11, max: 50 },
+            { label: '51-100', min: 51, max: 100 },
+            { label: '101-200', min: 101, max: 200 },
+            { label: '201-500', min: 201, max: 500 },
+            { label: '501-1000', min: 501, max: 1000 },
+            { label: '1001-2000', min: 1001, max: 2000 },
+        ];
+        for (const { label, min, max } of buckets) {
+            const count = best.ranks.filter((r) => r >= min && r <= max).length;
+            const bar = '█'.repeat(Math.ceil(count / queries.length * 50));
+            console.log(`  ${label.padStart(10)}: ${String(count).padStart(3)}  ${bar}`);
+        }
+        console.log(`  ${'miss'.padStart(10)}: ${String(best.misses).padStart(3)}`);
+    }
+    await embedder.dispose();
+    console.log('\nDone.');
+}
+runAnalysis().catch((err) => {
+    console.error('Analysis failed:', err);
+    process.exit(1);
+});
+//# sourceMappingURL=run-experiment.js.map

package/dist/eval/experiments/rescorer-ceiling/run-experiment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-experiment.js","sourceRoot":"","sources":["../../../../src/eval/experiments/rescorer-ceiling/run-experiment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AACjF,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EACL,kBAAkB,EAClB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AACvF,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,mCAAmC,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AACxE,OAAO,EAAE,qBAAqB,EAAyB,MAAM,sCAAsC,CAAC;AAUpG,8EAA8E;AAE9E,SAAS,SAAS,CAAC,IAAY;IAC7B,IAAI,CAAC,GAAG,IAAI,CAAC;IACb,OAAO,GAAG,EAAE;QACV,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC;QAC5C,OAAO,CAAC,GAAG,UAAU,CAAC;IACxB,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,UAAkB,EAAE,IAAY;IACpD,KAAK,EAAE,CAAC;IACR,MAAM,QAAQ,GAAG,cAAc,EAAE,CAAC;IAClC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;IAEjE,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC;IAEvD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,MAAM,CAAC,MAAM,IAAI,UAAU;YAAE,MAAM;QACvC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAChD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAElC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QACvF,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC;QAE1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChE,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG;gBAAE,SAAS;YACnD,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,KAAK,CAAC,EAAE;gBACZ,WAAW,EAAE,KAAK,CAAC,WAAW;gBAC9B,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,SAAS,EAAE,OAAO,CAAC,EAAE;gBACrB,WAAW,EAAE,OAAO,CAAC,IAAI;aAC1B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,UAAU,CAAC,MAAgB,EAAE,CAAS;IAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACrD,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,8EAA8E;AAE9E,KAAK,UAAU,eAAe,CAC5B,SAAmB,EACnB,QAAgB,EAChB,KAAa;IAEb,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC3D,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC7D,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,SAAmB,EACnB,QAAgB,EAChB,KAAa,EACb,eAAuB;IAEvB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,CAAC;IACtD,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAErE,wEAAwE;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,qBAAqB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,IAAI,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACtC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;AACnC,CAAC;AAED,8EAA8E;AAE9E,KAAK,UAAU,WAAW;IACxB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACvE,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAClF,MAAM,IAAI,GAAG,EAAE,CAAC;IAEhB,OAAO,CAAC,GAAG,CAAC,sCAAsC,CAAC,CAAC;IAEpD,KAAK,EAAE,CAAC;IACR,MAAM,cAAc,GAAG,UAAU,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,MAAM,CAAC,oBAAoB,CAAC;IAE9C,MAAM,QAAQ,GAAG,MAAM,CAAC,aAAa,CAAC,YAAY,IAAI,kBAAkB,EAAE,GAAG,CAAC,CAAC;IAC/E,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,aAAa,GAAG,oBAAoB,EAAE,CAAC;QAC7C,eAAe,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,gBAAgB,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IAC5D,IAAI,QAAQ;QAAE,OAAO,CAAC,GAAG,CAAC,sBAAsB,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9E,OAAO,CAAC,GAAG,CAAC,wBAAwB,SAAS,EAAE,CAAC,CAAC;IAEjD,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IAC9C,IAAI,QAAQ;QAAE,gBAAgB,CAAC,UAAU,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IAEjE,iCAAiC;IACjC,OAAO,CAAC,GAAG,CAAC,cAAc,UAAU,YAAY,CAAC,CAAC;IAClD,MAAM,aAAa,GAAG,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACrD,OAAO,CAAC,GAAG,CAAC,aAAa,aAAa,CAAC,MAAM,SAAS,CAAC,CAAC;IAExD,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,MAAM,qBAAqB,CAAC,aAAa,EAAE,MAAM,CAAC,mBAAmB,CAAC,CAAC;IACvF,OAAO,CAAC,GAAG,CAAC,eAAe,OAAO,CAAC,MAAM,UAAU,CAAC,CAAC;IAErD,sCAAsC;IACtC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;QACjD,IAAI,KAAK;YAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB,EAAE,KAAK,CAAC,YAAY,IAAI,GAAG,CAAC,CAAC;IAClF,CAAC;IAED,sBAAsB;IACtB,MAAM,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;IAChC,MAAM,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;IAErD,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;IACpC,MAAM,eAAe,GAAe,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC1D,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,cAAc,eAAe,CAAC,MAAM,YAAY,CAAC,CAAC;IAE9D,oBAAoB;IACpB,MAAM,OAAO,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAChD,OAAO,CAAC,GAAG,CAAC,aAAa,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEjD,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+C,CAAC;IAE1E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACtB,MAAM,SAAS,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;YAEtC,MAAM,MAAM,GAAG,QAAQ;gBACrB,CAAC,CAAC,MAAM,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,kBAAkB,EAAE,CAAC,EAAE,eAAe,CAAC;gBAC5E,CAAC,CAAC,MAAM,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;YAE9D,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,CAAC;YACX,CAAC;QACH,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAErC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3B,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAElD,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,GAAG,GAAG,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QAExC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,aAAa,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,CAAC,CAAC;QACxD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,GAAG,CAAC,+BAA+B,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACxH,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,OAAO,CAAC,GAAG,CAAC,iDAAiD,CAAC,CAAC;IAC/D,OAAO,CAAC,GAAG,CAAC,2EAA2E,CAAC,CAAC;IACzF,OAAO,CAAC,GAAG,CAAC,iCAAiC,SAAS,kBAAkB,CAAC,CAAC;IAE1E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAC9D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;QAE7B,2EAA2E;QAC3E,mCAAmC;QACnC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,kBAAkB,CAAC;YAChD,MAAM,MAAM,GAAG,QAAQ;gBACrB,CAAC,CAAC,MAAM,eAAe,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,eAAe,CAAC;gBAC1E,CAAC,CAAC,MAAM,eAAe,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YAE5D,IAAI,CAAC,MAAM,CAAC,KAAK;gBAAE,SAAS;YAE5B,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;YACpD,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;gBACxB,YAAY,EAAE,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,QAAQ,EAAE,CAAC;YACb,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QACvC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,OAAO,MAAM,YAAY,IAAI,KAAK,cAAc,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,QAAQ,GAAG,CAAC,CAAC;IACrK,CAAC;IAED,4DAA4D;IAC5D,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG;YACd,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;YAClC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;YACpC,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;YACtC,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;YACxC,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;YACxC,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE;YAC1C,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE;SAC7C,CAAC;QAEF,KAAK,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,OAAO,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;YACpE,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;YAC/D,OAAO,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,QAAQ,CAAC,OAAO,EAAE,CAAC;IACzB,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACzB,CAAC;AAED,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;IAC1B,OAAO,CAAC,KAAK,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC;IACvC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC"}

package/dist/index-entries/index-generator.d.ts

@@ -0,0 +1,74 @@
+/**
+ * Index entry generation: hybrid jeopardy + summary, heuristic fallback.
+ *
+ * For each chunk, generates:
+ * - 3-5 Jeopardy-style search target queries (embed close to user queries)
+ * - 1 summary description (embed close to chunk content, safety net for recall)
+ *
+ * LLM generation batches chunks into Haiku calls. Each query/summary becomes
+ * a separate index entry. Heuristic fallback extracts the first meaningful
+ * lines when offline.
+ */
+import type { IndexEntryInput } from '../storage/types.js';
+/** Chunk data needed for index entry generation. */
+export interface ChunkForIndexing {
+    id: string;
+    sessionSlug: string;
+    startTime: string;
+    content: string;
+    approxTokens: number;
+    agentId?: string | null;
+    teamName?: string | null;
+}
+/** Options for LLM generation. */
+export interface GenerateOptions {
+    /** Override model. Default: from config (clusterRefreshModel). */
+    model?: string;
+    /** Max tokens per chunk sent to LLM. Default: 500. */
+    maxChunkTokens?: number;
+    /** Target description length (unused for jeopardy, kept for API compat). */
+    targetDescriptionTokens?: number;
+    /** Called before each sub-batch API call for rate limiting. */
+    onBeforeBatch?: () => Promise<void>;
+}
+/** Parsed output for a single chunk from the LLM response. */
+export interface ParsedChunkEntries {
+    /** Summary description (~20-30 words), null if missing. */
+    summary: string | null;
+    /** Jeopardy-style search queries (3-5 per chunk). */
+    queries: string[];
+}
+/**
+ * Generate index entries for a batch of chunks using LLM.
+ *
+ * Produces 3-5 Jeopardy-style queries + 1 summary per chunk.
+ * Each query becomes a 'jeopardy' entry, the summary becomes an 'llm' entry.
+ * Falls back to heuristic if the API call fails.
+ */
+export declare function generateLLMEntries(chunks: ChunkForIndexing[], sessionSlug: string, options?: GenerateOptions): Promise<IndexEntryInput[]>;
+/**
+ * Generate a heuristic index entry for a single chunk.
+ *
+ * Extracts the first meaningful content lines, trimmed to ~130 tokens.
+ * Used as offline fallback or when LLM is unavailable.
+ */
+export declare function generateHeuristicEntry(chunk: ChunkForIndexing, sessionSlug: string): IndexEntryInput;
+/**
+ * Build the LLM prompt for hybrid jeopardy + summary generation.
+ */
+export declare function buildGenerationPrompt(chunks: Array<{
+    index: number;
+    content: string;
+    id: string;
+}>): string;
+/**
+ * Parse the LLM response into a map of chunk index → parsed entries.
+ *
+ * Handles various LLM output formats:
+ * - "0:" header then "- query" bullets + "SUMMARY:" line
+ * - "Chunk 0:" / "**Chunk 0:**" headers
+ * - "0: - query" inline format
+ * - "0: SKIP" for trivial chunks
+ */
+export declare function parseGenerationResponse(text: string, expectedCount: number): Map<number, ParsedChunkEntries>;
+//# sourceMappingURL=index-generator.d.ts.map

package/dist/index-entries/index-generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-generator.d.ts","sourceRoot":"","sources":["../../src/index-entries/index-generator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAI3D,oDAAoD;AACpD,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAED,kCAAkC;AAClC,MAAM,WAAW,eAAe;IAC9B,kEAAkE;IAClE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,sDAAsD;IACtD,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,4EAA4E;IAC5E,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,+DAA+D;IAC/D,aAAa,CAAC,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;CACrC;AAED,8DAA8D;AAC9D,MAAM,WAAW,kBAAkB;IACjC,2DAA2D;IAC3D,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,qDAAqD;IACrD,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAQD;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,MAAM,EAAE,gBAAgB,EAAE,EAC1B,WAAW,EAAE,MAAM,EACnB,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,eAAe,EAAE,CAAC,CA6F5B;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,gBAAgB,EACvB,WAAW,EAAE,MAAM,GAClB,eAAe,CAajB;AA6BD;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,KAAK,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GAC5D,MAAM,CAsCR;AAED;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAyE5G"}

package/dist/index-entries/index-generator.js

@@ -0,0 +1,323 @@
+/**
+ * Index entry generation: hybrid jeopardy + summary, heuristic fallback.
+ *
+ * For each chunk, generates:
+ * - 3-5 Jeopardy-style search target queries (embed close to user queries)
+ * - 1 summary description (embed close to chunk content, safety net for recall)
+ *
+ * LLM generation batches chunks into Haiku calls. Each query/summary becomes
+ * a separate index entry. Heuristic fallback extracts the first meaningful
+ * lines when offline.
+ */
+import Anthropic from '@anthropic-ai/sdk';
+import { getConfig } from '../config/memory-config.js';
+import { approximateTokens } from '../utils/token-counter.js';
+import { createSecretStore } from '../utils/secret-store.js';
+import { createLogger } from '../utils/logger.js';
+const log = createLogger('index-generator');
+/**
+ * Maximum chunks per LLM batch. With 3-5 queries + 1 summary per chunk
+ * (~400 tokens output each), 8 chunks fits within Haiku's 4096 output cap.
+ */
+const MAX_CHUNKS_PER_BATCH = 8;
+/**
+ * Generate index entries for a batch of chunks using LLM.
+ *
+ * Produces 3-5 Jeopardy-style queries + 1 summary per chunk.
+ * Each query becomes a 'jeopardy' entry, the summary becomes an 'llm' entry.
+ * Falls back to heuristic if the API call fails.
+ */
+export async function generateLLMEntries(chunks, sessionSlug, options) {
+    if (chunks.length === 0)
+        return [];
+    const config = getConfig();
+    const model = options?.model ?? config.clusterRefreshModel;
+    const maxChunkTokens = options?.maxChunkTokens ?? 500;
+    // Get Anthropic client
+    const client = await getAnthropicClient();
+    if (!client) {
+        log.info('No API key available, falling back to heuristic generation');
+        return chunks.map((chunk) => generateHeuristicEntry(chunk, sessionSlug));
+    }
+    // Split into sub-batches that fit within Haiku's output limits
+    const allResults = [];
+    for (let batchStart = 0; batchStart < chunks.length; batchStart += MAX_CHUNKS_PER_BATCH) {
+        const batchChunks = chunks.slice(batchStart, batchStart + MAX_CHUNKS_PER_BATCH);
+        // Rate limit before each sub-batch API call
+        if (options?.onBeforeBatch) {
+            await options.onBeforeBatch();
+        }
+        // Truncate chunk content for prompt
+        const truncatedChunks = batchChunks.map((chunk, i) => {
+            const maxChars = maxChunkTokens * 4;
+            const content = chunk.content.length > maxChars
+                ? chunk.content.slice(0, maxChars) + '\n...[truncated]'
+                : chunk.content;
+            return { index: i, content, id: chunk.id };
+        });
+        const prompt = buildGenerationPrompt(truncatedChunks);
+        try {
+            const response = await callWithRetry(client, model, prompt, batchChunks.length);
+            const text = response.content[0].type === 'text' ? response.content[0].text : '';
+            const entriesByChunk = parseGenerationResponse(text, batchChunks.length);
+            for (let i = 0; i < batchChunks.length; i++) {
+                const chunk = batchChunks[i];
+                const parsed = entriesByChunk.get(i);
+                if (parsed && (parsed.queries.length > 0 || parsed.summary)) {
+                    // Create one entry per jeopardy query
+                    for (const query of parsed.queries) {
+                        allResults.push({
+                            chunkIds: [chunk.id],
+                            sessionSlug,
+                            startTime: chunk.startTime,
+                            description: query,
+                            approxTokens: approximateTokens(query),
+                            agentId: chunk.agentId,
+                            teamName: chunk.teamName,
+                            generationMethod: 'jeopardy',
+                        });
+                    }
+                    // Create one entry for the summary
+                    if (parsed.summary) {
+                        allResults.push({
+                            chunkIds: [chunk.id],
+                            sessionSlug,
+                            startTime: chunk.startTime,
+                            description: parsed.summary,
+                            approxTokens: approximateTokens(parsed.summary),
+                            agentId: chunk.agentId,
+                            teamName: chunk.teamName,
+                            generationMethod: 'llm',
+                        });
+                    }
+                }
+                else {
+                    // SKIP or missing — fall back to heuristic
+                    allResults.push(generateHeuristicEntry(chunk, sessionSlug));
+                }
+            }
+        }
+        catch (error) {
+            log.warn('LLM batch failed, falling back to heuristic for batch', {
+                error: error.message,
+                batchStart,
+                batchSize: batchChunks.length,
+            });
+            for (const chunk of batchChunks) {
+                allResults.push(generateHeuristicEntry(chunk, sessionSlug));
+            }
+        }
+    }
+    return allResults;
+}
+/**
+ * Generate a heuristic index entry for a single chunk.
+ *
+ * Extracts the first meaningful content lines, trimmed to ~130 tokens.
+ * Used as offline fallback or when LLM is unavailable.
+ */
+export function generateHeuristicEntry(chunk, sessionSlug) {
+    const description = generateHeuristicDescription(chunk.content);
+    return {
+        chunkIds: [chunk.id],
+        sessionSlug,
+        startTime: chunk.startTime,
+        description,
+        approxTokens: approximateTokens(description),
+        agentId: chunk.agentId,
+        teamName: chunk.teamName,
+        generationMethod: 'heuristic',
+    };
+}
+/**
+ * Generate a heuristic description from chunk content.
+ * Takes the first meaningful lines up to ~130 tokens.
+ */
+function generateHeuristicDescription(content) {
+    const lines = content.split('\n');
+    const meaningful = [];
+    let tokenCount = 0;
+    const targetTokens = 130;
+    for (const line of lines) {
+        const trimmed = line.trim();
+        // Skip empty lines and pure separators
+        if (!trimmed || /^[-=_*]{3,}$/.test(trimmed))
+            continue;
+        // Skip tool use blocks and code fence markers
+        if (trimmed.startsWith('```') || trimmed.startsWith('Tool:'))
+            continue;
+        const lineTokens = approximateTokens(trimmed);
+        if (tokenCount + lineTokens > targetTokens && meaningful.length > 0)
+            break;
+        meaningful.push(trimmed);
+        tokenCount += lineTokens;
+    }
+    return meaningful.join(' ').slice(0, targetTokens * 5); // ~5 chars/token safety cap
+}
+/**
+ * Build the LLM prompt for hybrid jeopardy + summary generation.
+ */
+export function buildGenerationPrompt(chunks) {
+    const chunkTexts = chunks
+        .map((c) => `--- Chunk ${c.index} ---\n${c.content}`)
+        .join('\n\n');
+    return `You are building a search index for a memory system used by AI agents (Claude Opus, Sonnet) and human developers. For each conversation chunk below, produce:
+
+1. **3-5 search queries** — Jeopardy-style: the chunk is the "answer", what are the "questions" a user would type to find it?
+2. **1 summary** — a concise description of what the chunk covers (~20-30 words)
+
+Rules for queries:
+- Each query should be a natural question or search phrase (5-20 words)
+- Queries must be SPECIFIC enough to uniquely target THIS chunk, not the general topic
+- Focus on the concrete outcome, decision, error, or technique — not the topic category
+- Include specific names: file paths, function names, error messages, library names where relevant
+- Do NOT include dates, project names, or agent IDs
+- Do NOT copy text verbatim from the chunk
+
+Rules for summaries:
+- Capture the key topic, action, or decision in ~20-30 words
+- Include specific technical terms that someone might search for
+- Do NOT include dates, project names, or agent IDs
+
+SKIP rules: ONLY write "SKIP" if the chunk is entirely greetings, acknowledgements, or whitespace with absolutely no technical or topical content. If in doubt, do NOT skip.
+
+${chunkTexts}
+
+Respond with entries grouped by chunk number:
+0:
+- [query 1]
+- [query 2]
+- [query 3]
+SUMMARY: [one-sentence summary]
+1:
+- [query 1]
+- [query 2]
+SUMMARY: [summary]
+...`;
+}
+/**
+ * Parse the LLM response into a map of chunk index → parsed entries.
+ *
+ * Handles various LLM output formats:
+ * - "0:" header then "- query" bullets + "SUMMARY:" line
+ * - "Chunk 0:" / "**Chunk 0:**" headers
+ * - "0: - query" inline format
+ * - "0: SKIP" for trivial chunks
+ */
+export function parseGenerationResponse(text, expectedCount) {
+    const results = new Map();
+    const lines = text.split('\n');
+    let currentIndex = -1;
+    const ensureEntry = (idx) => {
+        if (!results.has(idx)) {
+            results.set(idx, { summary: null, queries: [] });
+        }
+    };
+    for (const line of lines) {
+        // Match "0:", "Chunk 0:", "**Chunk 0:**", "## Chunk 0", etc. (header-only line)
+        const indexMatch = line.match(/^(?:\*{0,2})?(?:#{0,3}\s*)?(?:Chunk\s+)?(\d+)(?:\*{0,2})?:(?:\*{0,2})?\s*$/i);
+        if (indexMatch) {
+            const idx = parseInt(indexMatch[1], 10);
+            if (idx >= 0 && idx < expectedCount) {
+                currentIndex = idx;
+                ensureEntry(currentIndex);
+            }
+            continue;
+        }
+        // Handle "0: SKIP" or "Chunk 0: SKIP"
+        const skipMatch = line.match(/^(?:\*{0,2})?(?:Chunk\s+)?(\d+)(?:\*{0,2})?:\s*SKIP\s*$/i);
+        if (skipMatch) {
+            const idx = parseInt(skipMatch[1], 10);
+            if (idx >= 0 && idx < expectedCount) {
+                currentIndex = idx;
+                // Don't add to results — SKIP means no entries
+            }
+            continue;
+        }
+        // Handle "0: - query" or "Chunk 0: - query" on same line
+        const inlineMatch = line.match(/^(?:\*{0,2})?(?:Chunk\s+)?(\d+)(?:\*{0,2})?:\s*[-•]\s*(.+)/i);
+        if (inlineMatch) {
+            const idx = parseInt(inlineMatch[1], 10);
+            if (idx >= 0 && idx < expectedCount) {
+                currentIndex = idx;
+                ensureEntry(currentIndex);
+                const query = inlineMatch[2].trim();
+                if (query) {
+                    results.get(currentIndex).queries.push(query);
+                }
+            }
+            continue;
+        }
+        // Handle SUMMARY: line (with or without ** bold)
+        const summaryMatch = line.match(/^\s*(?:\*{0,2})?SUMMARY(?:\*{0,2})?:(?:\*{0,2})?\s*(.+)/i);
+        if (summaryMatch && currentIndex >= 0 && currentIndex < expectedCount) {
+            const summary = summaryMatch[1].trim();
+            if (summary && summary.toUpperCase() !== 'SKIP') {
+                ensureEntry(currentIndex);
+                results.get(currentIndex).summary = summary;
+            }
+            continue;
+        }
+        // Bullet point under current chunk
+        const queryMatch = line.match(/^\s*[-•]\s*(.+)/);
+        if (queryMatch && currentIndex >= 0 && currentIndex < expectedCount) {
+            const query = queryMatch[1].trim();
+            if (query && query.toUpperCase() !== 'SKIP') {
+                ensureEntry(currentIndex);
+                results.get(currentIndex).queries.push(query);
+            }
+        }
+    }
+    return results;
+}
+/** Max retries for rate-limited or transient API errors. */
+const MAX_RETRIES = 3;
+/**
+ * Call the API with exponential backoff on rate limit (429) and server errors (5xx).
+ */
+async function callWithRetry(client, model, prompt, batchSize) {
+    for (let attempt = 0; attempt <= MAX_RETRIES; attempt++) {
+        try {
+            return await client.messages.create({
+                model,
+                max_tokens: Math.min(4096, Math.max(400, batchSize * 400)),
+                messages: [{ role: 'user', content: prompt }],
+            });
+        }
+        catch (error) {
+            const status = error.status;
+            const isRetryable = status === 429 || (status !== undefined && status >= 500);
+            if (!isRetryable || attempt === MAX_RETRIES) {
+                throw error;
+            }
+            // Exponential backoff: 2s, 8s, 32s
+            const backoffMs = 2000 * Math.pow(4, attempt);
+            log.info(`API ${status} on attempt ${attempt + 1}, retrying in ${backoffMs / 1000}s`);
+            await new Promise((resolve) => setTimeout(resolve, backoffMs));
+        }
+    }
+    // Unreachable, but TypeScript needs it
+    throw new Error('Retry loop exited unexpectedly');
+}
+/**
+ * Get Anthropic client, returning null if no API key is available.
+ */
+async function getAnthropicClient() {
+    if (!process.env.ANTHROPIC_API_KEY) {
+        try {
+            const store = createSecretStore();
+            const storedKey = await store.get('anthropic-api-key');
+            if (storedKey) {
+                process.env.ANTHROPIC_API_KEY = storedKey;
+            }
+        }
+        catch {
+            // Keychain not available
+        }
+    }
+    if (!process.env.ANTHROPIC_API_KEY) {
+        return null;
+    }
+    return new Anthropic();
+}
+//# sourceMappingURL=index-generator.js.map

package/dist/index-entries/index-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-generator.js","sourceRoot":"","sources":["../../src/index-entries/index-generator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,SAAS,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGlD,MAAM,GAAG,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAC;AAiC5C;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAE/B;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,MAA0B,EAC1B,WAAmB,EACnB,OAAyB;IAEzB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,MAAM,CAAC,mBAAmB,CAAC;IAC3D,MAAM,cAAc,GAAG,OAAO,EAAE,cAAc,IAAI,GAAG,CAAC;IAEtD,uBAAuB;IACvB,MAAM,MAAM,GAAG,MAAM,kBAAkB,EAAE,CAAC;IAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,GAAG,CAAC,IAAI,CAAC,4DAA4D,CAAC,CAAC;QACvE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,sBAAsB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,+DAA+D;IAC/D,MAAM,UAAU,GAAsB,EAAE,CAAC;IAEzC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,IAAI,oBAAoB,EAAE,CAAC;QACxF,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,oBAAoB,CAAC,CAAC;QAEhF,4CAA4C;QAC5C,IAAI,OAAO,EAAE,aAAa,EAAE,CAAC;YAC3B,MAAM,OAAO,CAAC,aAAa,EAAE,CAAC;QAChC,CAAC;QAED,oCAAoC;QACpC,MAAM,eAAe,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YACnD,MAAM,QAAQ,GAAG,cAAc,GAAG,CAAC,CAAC;YACpC,MAAM,OAAO,GACX,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,QAAQ;gBAC7B,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,kBAAkB;gBACvD,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;YACpB,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,qBAAqB,CAAC,eAAe,CAAC,CAAC;QAEtD,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;YAEhF,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACjF,MAAM,cAAc,GAAG,uBAAuB,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;YAEzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAErC,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC5D,sCAAsC;oBACtC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;wBACnC,UAAU,CAAC,IAAI,CAAC;4BACd,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;4BACpB,WAAW;4BACX,SAAS,EAAE,KAAK,CAAC,SAAS;4BAC1B,WAAW,EAAE,KAAK;4BAClB,YAAY,EAAE,iBAAiB,CAAC,KAAK,CAAC;4BACtC,OAAO,EAAE,KAAK,CAAC,OAAO;4BACtB,QAAQ,EAAE,KAAK,CAAC,QAAQ;4BACxB,gBAAgB,EAAE,UAAU;yBAC7B,CAAC,CAAC;oBACL,CAAC;oBAED,mCAAmC;oBACnC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;wBACnB,UAAU,CAAC,IAAI,CAAC;4BACd,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;4BACpB,WAAW;4BACX,SAAS,EAAE,KAAK,CAAC,SAAS;4BAC1B,WAAW,EAAE,MAAM,CAAC,OAAO;4BAC3B,YAAY,EAAE,iBAAiB,CAAC,MAAM,CAAC,OAAO,CAAC;4BAC/C,OAAO,EAAE,KAAK,CAAC,OAAO;4BACtB,QAAQ,EAAE,KAAK,CAAC,QAAQ;4BACxB,gBAAgB,EAAE,KAAK;yBACxB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,2CAA2C;oBAC3C,UAAU,CAAC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;gBAC9D,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,GAAG,CAAC,IAAI,CAAC,uDAAuD,EAAE;gBAChE,KAAK,EAAG,KAAe,CAAC,OAAO;gBAC/B,UAAU;gBACV,SAAS,EAAE,WAAW,CAAC,MAAM;aAC9B,CAAC,CAAC;YACH,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;gBAChC,UAAU,CAAC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAAuB,EACvB,WAAmB;IAEnB,MAAM,WAAW,GAAG,4BAA4B,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAEhE,OAAO;QACL,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,WAAW;QACX,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,WAAW;QACX,YAAY,EAAE,iBAAiB,CAAC,WAAW,CAAC;QAC5C,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,gBAAgB,EAAE,WAAW;KAC9B,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,4BAA4B,CAAC,OAAe;IACnD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,YAAY,GAAG,GAAG,CAAC;IAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,uCAAuC;QACvC,IAAI,CAAC,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QACvD,8CAA8C;QAC9C,IAAI,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,SAAS;QAEvE,MAAM,UAAU,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,UAAU,GAAG,UAAU,GAAG,YAAY,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM;QAE3E,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,UAAU,IAAI,UAAU,CAAC;IAC3B,CAAC;IAED,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,4BAA4B;AACtF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAA6D;IAE7D,MAAM,UAAU,GAAG,MAAM;SACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;SACpD,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,OAAO;;;;;;;;;;;;;;;;;;;;EAoBP,UAAU;;;;;;;;;;;;IAYR,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAY,EAAE,aAAqB;IACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAA8B,CAAC;IACtD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAE/B,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;IAEtB,MAAM,WAAW,GAAG,CAAC,GAAW,EAAE,EAAE;QAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACnD,CAAC;IACH,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,gFAAgF;QAChF,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,6EAA6E,CAAC,CAAC;QAC7G,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACxC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,aAAa,EAAE,CAAC;gBACpC,YAAY,GAAG,GAAG,CAAC;gBACnB,WAAW,CAAC,YAAY,CAAC,CAAC;YAC5B,CAAC;YACD,SAAS;QACX,CAAC;QAED,sCAAsC;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,0DAA0D,CAAC,CAAC;QACzF,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,aAAa,EAAE,CAAC;gBACpC,YAAY,GAAG,GAAG,CAAC;gBACnB,+CAA+C;YACjD,CAAC;YACD,SAAS;QACX,CAAC;QAED,yDAAyD;QACzD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,6DAA6D,CAAC,CAAC;QAC9F,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACzC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,aAAa,EAAE,CAAC;gBACpC,YAAY,GAAG,GAAG,CAAC;gBACnB,WAAW,CAAC,YAAY,CAAC,CAAC;gBAC1B,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACpC,IAAI,KAAK,EAAE,CAAC;oBACV,OAAO,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;YACD,SAAS;QACX,CAAC;QAED,iDAAiD;QACjD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,0DAA0D,CAAC,CAAC;QAC5F,IAAI,YAAY,IAAI,YAAY,IAAI,CAAC,IAAI,YAAY,GAAG,aAAa,EAAE,CAAC;YACtE,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACvC,IAAI,OAAO,IAAI,OAAO,CAAC,WAAW,EAAE,KAAK,MAAM,EAAE,CAAC;gBAChD,WAAW,CAAC,YAAY,CAAC,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,OAAO,GAAG,OAAO,CAAC;YAC/C,CAAC;YACD,SAAS;QACX,CAAC;QAED,mCAAmC;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;QACjD,IAAI,UAAU,IAAI,YAAY,IAAI,CAAC,IAAI,YAAY,GAAG,aAAa,EAAE,CAAC;YACpE,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,KAAK,IAAI,KAAK,CAAC,WAAW,EAAE,KAAK,MAAM,EAAE,CAAC;gBAC5C,WAAW,CAAC,YAAY,CAAC,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,4DAA4D;AAC5D,MAAM,WAAW,GAAG,CAAC,CAAC;AAEtB;;GAEG;AACH,KAAK,UAAU,aAAa,CAC1B,MAAiB,EACjB,KAAa,EACb,MAAc,EACd,SAAiB;IAEjB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,WAAW,EAAE,OAAO,EAAE,EAAE,CAAC;QACxD,IAAI,CAAC;YACH,OAAO,MAAM,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAClC,KAAK;gBACL,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,GAAG,GAAG,CAAC,CAAC;gBAC1D,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,MAAM,GAAI,KAA6B,CAAC,MAAM,CAAC;YACrD,MAAM,WAAW,GAAG,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC;YAE9E,IAAI,CAAC,WAAW,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;gBAC5C,MAAM,KAAK,CAAC;YACd,CAAC;YAED,mCAAmC;YACnC,MAAM,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC9C,GAAG,CAAC,IAAI,CAAC,OAAO,MAAM,eAAe,OAAO,GAAG,CAAC,iBAAiB,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;YACtF,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,kBAAkB;IAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC;QACnC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,iBAAiB,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;YACvD,IAAI,SAAS,EAAE,CAAC;gBACd,OAAO,CAAC,GAAG,CAAC,iBAAiB,GAAG,SAAS,CAAC;YAC5C,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,yBAAyB;QAC3B,CAAC;IACH,CAAC;IAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,SAAS,EAAE,CAAC;AACzB,CAAC"}