contextpro-mcp 0.0.0-stage → 1.5.0

package/build/tools/evidence-retrieval.js

@@ -0,0 +1,200 @@
+// Shared, bounded candidate assembly. Relations here are indexed heuristics,
+// never compiler-resolved references. Source selection happens in context.ts.
+import { getDB } from "../core/db.js";
+import { basename, dirname } from "node:path";
+import { searchTerms, withQueryEmbeddingCache } from "../core/embeddings.js";
+import { unifiedSearchData, extractIdentifierHints } from "./search.js";
+import { discoveryPathWeight, facetPathWeight, mentionedFiles, queryLiterals } from "./discovery-hints.js";
+import { findTestsForFiles, isTestEvidence, isTestFile } from "./retrieval-helpers.js";
+import { maybeChatRerankPlanningFiles } from "./planning-helpers.js";
+export const connectedRetrievalEnabled = () => process.env.CONTEXTPRO_CONNECTED_CONTEXT === "true";
+export async function retrieveEvidence(options) {
+    return withQueryEmbeddingCache(async () => {
+        const { rootDir, query } = options;
+        const search = await unifiedSearchData({ rootDir, query, mode: "hybrid", topK: 24,
+            preset: options.preset ?? "balanced", fusion: "rrf", inlineCode: "off", expandCallers: false, persistArtifact: false });
+        const db = await getDB(rootDir), files = db.getAllFiles();
+        const byId = new Map(files.map(file => [file.id, file.path]));
+        const pool = new Map();
+        const facetOwners = new Set();
+        const topicOwners = new Set();
+        let weakSemanticMatches = 0;
+        const add = (path, rank, lane, role = "implementation", anchor, symbols = []) => {
+            if (isTestEvidence(path))
+                role = "test";
+            const prior = discoveryPathWeight(query, path, lane === "named definition");
+            // Graph links are evidence in their own right, including tests that do not
+            // repeat the query words. Lexical decoys still receive the normal penalty.
+            const weight = lane.startsWith("graph:") || lane === "test association" ? 1 : prior;
+            const item = pool.get(path) ?? { path, score: 0, reason: "", symbols: [], roles: [], anchors: [] };
+            // RRF contributes once per file per lane. Ten identifiers in one test
+            // file are not ten independent retrieval signals for that file.
+            if (!item.reason.split("; ").includes(lane))
+                item.score += weight / (60 + rank + 1);
+            item.reason = [...new Set([...item.reason.split("; ").filter(Boolean), lane])].join("; ");
+            if (!item.roles.includes(role))
+                item.roles.push(role);
+            if (anchor && !item.anchors.includes(anchor))
+                item.anchors.push(anchor);
+            item.symbols = [...new Set([...item.symbols, ...symbols])];
+            pool.set(path, item);
+        };
+        // Rank fusion must not turn weak, zero-overlap neighbors into graph seeds.
+        // Match the existing search caller-expansion floor (40/100 cosine score).
+        // This is a conservative retrieval heuristic, not a calibrated probability.
+        const supported = (item) => {
+            const accepted = item.keywordScore > 0 || item.semanticScore > 40;
+            if (!accepted && item.semanticScore > 0)
+                weakSemanticMatches++;
+            return accepted;
+        };
+        (search.files?.results ?? []).forEach((file, rank) => {
+            if (!supported(file))
+                return;
+            add(file.path, rank, "file retrieval", "implementation", undefined, file.matchedSymbols);
+            pool.get(file.path).semanticScore = file.semanticScore;
+        });
+        (search.identifiers?.results ?? []).forEach((symbol, rank) => {
+            if (!supported(symbol))
+                return;
+            add(symbol.path, rank, "symbol retrieval", "implementation", undefined, [symbol.name]);
+            const item = pool.get(symbol.path);
+            item.semanticScore = Math.max(item.semanticScore ?? 0, symbol.semanticScore);
+        });
+        const terms = new Set(searchTerms(query));
+        if (options.preset !== "semantic_only") {
+            db.searchFileText(query, 32).forEach((file, rank) => add(file.path, rank, "source text"));
+            for (const literal of queryLiterals(query).slice(0, 8))
+                db.searchFileText(literal, 8, true).forEach((file, rank) => add(file.path, rank, "literal"));
+            // A broad OR query can fill every slot with one popular topic. Give each
+            // concrete query term its own small lane before truncating the union.
+            const generic = new Set(["find", "where", "implementation", "function", "code", "file", "files", "explain", "logic", "checks", "check", "system", "does", "which", "existing", "relevant", "include", "only", "all", "any", "remaining", "identify", "paths", "path", "across", "locate", "source"]);
+            for (const term of [...terms].filter(term => term.length >= 3 && !generic.has(term)).slice(0, 24)) {
+                const hits = db.searchFileText(term, 64).sort((a, b) => facetPathWeight(query, term, b.path) - facetPathWeight(query, term, a.path) || a.score - b.score || a.path.localeCompare(b.path));
+                hits.slice(0, 2).forEach((hit, rank) => add(hit.path, rank, `facet:${term}`));
+                if (hits[0])
+                    facetOwners.add(hits[0].path);
+            }
+            mentionedFiles(rootDir, query, files).slice(0, 8).forEach((file, rank) => add(file, rank, "explicit path"));
+            files.map(file => ({ path: file.path, hits: searchTerms(file.path).filter(term => terms.has(term)).length }))
+                .filter(file => file.hits > 0).sort((a, b) => b.hits - a.hits || a.path.localeCompare(b.path)).slice(0, 16)
+                .forEach((file, rank) => add(file.path, rank, "path terms"));
+            // A basename carrying several concrete query topics is stronger than a
+            // ubiquitous directory token (tests, web, native). Keep those modules in
+            // the union even when unrelated single-term facets have many matches.
+            const topics = new Set([...terms].filter(term => !generic.has(term) && !["tests", "test", "web", "native", "server", "api"].includes(term)));
+            files.map(file => ({ path: file.path, hits: new Set(searchTerms(basename(file.path)).filter(term => topics.has(term))).size }))
+                .filter(file => file.hits >= 2).sort((a, b) => b.hits - a.hits || (pool.get(b.path)?.score ?? 0) - (pool.get(a.path)?.score ?? 0) || a.path.localeCompare(b.path)).slice(0, 8)
+                .forEach((file, rank) => { add(file.path, rank, "path topics"); topicOwners.add(file.path); });
+            for (const hint of extractIdentifierHints(query).slice(0, 16)) {
+                const matches = db.searchSymbolsByName(hint).filter(symbol => symbol.name === hint);
+                const hasImplementation = matches.some(symbol => {
+                    const path = byId.get(symbol.file_id);
+                    return path && !isTestEvidence(path) && discoveryPathWeight(query, path, true) >= 1;
+                });
+                for (const symbol of matches.filter(symbol => {
+                    const path = byId.get(symbol.file_id);
+                    return path && (!hasImplementation || !isTestEvidence(path) || discoveryPathWeight(query, path) >= 1);
+                }).slice(0, 8)) {
+                    const path = byId.get(symbol.file_id);
+                    if (path && discoveryPathWeight(query, path, true) >= 1)
+                        add(path, 0, "named definition", "implementation", symbol.line_start, [hint]);
+                }
+            }
+        }
+        const ranked = () => [...pool.values()].sort((a, b) => Number(b.reason.includes("named definition")) - Number(a.reason.includes("named definition")) || b.score - a.score || a.path.localeCompare(b.path));
+        // Four seeds leave space for connected evidence instead of saturating all
+        // slots with repetitive hits before graph expansion starts.
+        const seedPool = ranked().filter(item => !isTestFile(item.path));
+        const seeds = [], coveredFacets = new Set();
+        while (seeds.length < 4 && seedPool.length) {
+            const facets = (item) => item.reason.split("; ").filter(reason => reason.startsWith("facet:"));
+            seedPool.sort((a, b) => (facets(b).filter(term => !coveredFacets.has(term)).length - facets(a).filter(term => !coveredFacets.has(term)).length) || b.score - a.score || a.path.localeCompare(b.path));
+            const seed = seedPool.shift();
+            seeds.push(seed);
+            facets(seed).forEach(term => coveredFacets.add(term));
+        }
+        const graphLimit = Math.min(16, Math.max(0, options.graphMaxFiles ?? 8));
+        const linked = new Set(), visited = new Set(seeds.map(item => item.path));
+        // Broad multi-topic questions need a hop from each represented facet, not
+        // just the first four globally popular files. Visit edges round-robin so a
+        // large import hub cannot spend the entire expansion budget on its own.
+        let frontier = [...new Map([...seeds, ...ranked().filter(item => facetOwners.has(item.path) && !isTestFile(item.path))].map(item => [item.path, item])).values()].slice(0, 16);
+        for (const item of frontier)
+            visited.add(item.path);
+        for (let depth = 0; depth < (options.graphHops ?? 1) && frontier.length && linked.size < graphLimit; depth++) {
+            const next = [];
+            const queues = frontier.map(seed => {
+                const file = db.getFile(seed.path);
+                if (!file)
+                    return [];
+                const edges = [
+                    ...db.getImportsFrom(file.id).map(edge => ({ path: edge.target_file_id ? byId.get(edge.target_file_id) : undefined, role: "dependency", reason: `graph: imported by ${seed.path}` })),
+                    ...db.getImportersOf(file.id).map(edge => ({ path: byId.get(edge.source_file_id), role: "caller", reason: `graph: imports ${seed.path}` })),
+                ];
+                // Name-only call links may be ambiguous. Retrieve their source files,
+                // but do not infer binding identity from them.
+                for (const symbol of seed.symbols.slice(0, 4))
+                    for (const call of db.getCallersOf(symbol).slice(0, 12)) {
+                        edges.push({ path: byId.get(call.file_id), role: "caller", reason: `graph: textual caller of ${symbol} (ambiguous binding)` });
+                    }
+                edges.sort((a, b) => {
+                    const score = (edge) => edge.path ?
+                        (edge.role === "dependency" ? 1 : 0) + (dirname(edge.path) === dirname(seed.path) ? 2 : 0)
+                            + Math.min(4, searchTerms(edge.path).filter(term => terms.has(term)).length) * .2 : -1;
+                    return score(b) - score(a) || (a.path ?? "").localeCompare(b.path ?? "");
+                });
+                return edges.filter(edge => edge.path && edge.path !== seed.path);
+            });
+            while (queues.some(queue => queue.length) && linked.size < graphLimit)
+                for (const queue of queues) {
+                    while (queue.length) {
+                        const edge = queue.shift();
+                        if (!edge.path)
+                            continue;
+                        const role = isTestFile(edge.path) ? "test" : edge.role;
+                        if (visited.has(edge.path)) {
+                            // Existing seeds/previous-hop paths may gain a role, but consume no
+                            // expansion slot and must not be queued or score-boosted again.
+                            const existing = pool.get(edge.path);
+                            if (existing) {
+                                if (!existing.roles.includes(role))
+                                    existing.roles.push(role);
+                                existing.reason = [...new Set([...existing.reason.split("; "), edge.reason, "indexed heuristic"])].join("; ");
+                            }
+                            continue;
+                        }
+                        if (!linked.has(edge.path) && linked.size >= graphLimit)
+                            break;
+                        add(edge.path, depth, edge.reason + "; indexed heuristic", role);
+                        linked.add(edge.path);
+                        visited.add(edge.path);
+                        next.push(pool.get(edge.path));
+                        break;
+                    }
+                }
+            frontier = next;
+        }
+        const tests = options.includeTests === false ? [] : (await findTestsForFiles(rootDir, seeds.map(seed => seed.path))).slice(0, 4);
+        tests.forEach((test, rank) => add(test.path, rank, "test association", "test"));
+        const order = ranked();
+        // Reserve at most 4 seeds + 16 graph files + 4 associated tests first.
+        // Facet/topic owners share the remaining slots; an oversized owner union
+        // must not silently evict the connected evidence we already budgeted for.
+        const selected = new Set([...seeds.map(seed => seed.path), ...linked, ...tests.map(test => test.path)]);
+        const owners = order.filter(item => facetOwners.has(item.path) || topicOwners.has(item.path));
+        for (const item of [...owners, ...order]) {
+            if (selected.size >= 32)
+                break;
+            selected.add(item.path);
+        }
+        let candidates = order.filter(item => selected.has(item.path));
+        const reordered = await maybeChatRerankPlanningFiles(rootDir, query, candidates);
+        const map = new Map(candidates.map(item => [item.path, item]));
+        candidates = reordered.map(item => ({ ...map.get(item.path), score: item.score, reason: item.reason }));
+        return { search, candidates, tests, limited: pool.size > 32,
+            relevanceNotice: weakSemanticMatches ? "Weak semantic-only neighbors omitted before graph expansion; no lexical match or sufficient absolute similarity. Use exact targets if scope is known." : undefined,
+            relationNotice: candidates.some(item => item.reason.includes("graph:")) ? "Connected paths use indexed import/test and name-only call heuristics; verify bindings with exact_references." : undefined };
+    });
+}
+//# sourceMappingURL=evidence-retrieval.js.map

package/build/tools/evidence-retrieval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evidence-retrieval.js","sourceRoot":"","sources":["../../src/tools/evidence-retrieval.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,8EAA8E;AAC9E,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AACtC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAC7E,OAAO,EAAE,iBAAiB,EAAE,sBAAsB,EAA6B,MAAM,aAAa,CAAC;AACnG,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAC3G,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACvF,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AASrE,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAY,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,4BAA4B,KAAK,MAAM,CAAC;AAE5G,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,OAGtC;IACC,OAAO,uBAAuB,CAAC,KAAK,IAAI,EAAE;QACxC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,iBAAiB,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE;YAC/E,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC,CAAC;QAC1H,MAAM,EAAE,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,GAAG,EAA6B,CAAC;QAClD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,IAAY,EAAE,IAAY,EAAE,OAAqB,gBAAgB,EAAE,MAAe,EAAE,UAAoB,EAAE,EAAE,EAAE;YACvI,IAAI,cAAc,CAAC,IAAI,CAAC;gBAAE,IAAI,GAAG,MAAM,CAAC;YACxC,MAAM,KAAK,GAAG,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,KAAK,kBAAkB,CAAC,CAAC;YAC5E,2EAA2E;YAC3E,2EAA2E;YAC3E,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,IAAI,KAAK,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACpF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YACnG,sEAAsE;YACtE,gEAAgE;YAChE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YACpF,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1F,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxE,IAAI,CAAC,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC;QACF,2EAA2E;QAC3E,0EAA0E;QAC1E,4EAA4E;QAC5E,MAAM,SAAS,GAAG,CAAC,IAAqD,EAAE,EAAE;YAC1E,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,GAAG,CAAC,IAAI,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;YAClE,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC;gBAAE,mBAAmB,EAAE,CAAC;YAC/D,OAAO,QAAQ,CAAC;QAClB,CAAC,CAAC;QACF,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE;YACnD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;gBAAE,OAAO;YAC7B,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,SAAS,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YACzF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC1D,CAAC,CAAC,CAAC;QACH,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;YAC3D,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,OAAO;YAC/B,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACvF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC;YACpC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;QAC/E,CAAC,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,IAAI,OAAO,CAAC,MAAM,KAAK,eAAe,EAAE,CAAC;YACvC,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC;YAC1F,KAAK,MAAM,OAAO,IAAI,aAAa,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,EAAE,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;YACrJ,yEAAyE;YACzE,sEAAsE;YACtE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;YACrS,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAClG,MAAM,IAAI,GAAG,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC1L,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC9E,IAAI,IAAI,CAAC,CAAC,CAAC;oBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC7C,CAAC;YACD,cAAc,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC;YAC5G,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;iBAC1G,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;iBAC1G,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC;YAC/D,uEAAuE;YACvE,yEAAyE;YACzE,sEAAsE;YACtE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7I,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;iBAC5H,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;iBAC7K,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,KAAK,MAAM,IAAI,IAAI,sBAAsB,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC9D,MAAM,OAAO,GAAG,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;gBACpF,MAAM,iBAAiB,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;oBAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBACtC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtF,CAAC,CAAC,CAAC;gBACH,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;oBAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBACtC,OAAO,IAAI,IAAI,CAAC,CAAC,iBAAiB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACf,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBACtC,IAAI,IAAI,IAAI,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;wBAAE,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBACzI,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3M,0EAA0E;QAC1E,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACjE,MAAM,KAAK,GAAwB,EAAE,EAAE,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACzE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,CAAC,IAAuB,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;YAClH,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACtM,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAG,CAAC;YAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1G,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,EAAE,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAClF,0EAA0E;QAC1E,2EAA2E;QAC3E,wEAAwE;QACxE,IAAI,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/K,KAAK,MAAM,IAAI,IAAI,QAAQ;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;YAC7G,MAAM,IAAI,GAAwB,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBACjC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnC,IAAI,CAAC,IAAI;oBAAE,OAAO,EAAE,CAAC;gBACrB,MAAM,KAAK,GAAG;oBACZ,GAAG,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,EAAE,YAA4B,EAAE,MAAM,EAAE,sBAAsB,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBACrM,GAAG,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,IAAI,EAAE,QAAwB,EAAE,MAAM,EAAE,kBAAkB,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;iBAC5J,CAAC;gBACF,sEAAsE;gBACtE,+CAA+C;gBAC/C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAE,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;wBACvG,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,4BAA4B,MAAM,sBAAsB,EAAE,CAAC,CAAC;oBACjI,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBAClB,MAAM,KAAK,GAAG,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBAC3C,CAAC,IAAI,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;8BACxF,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzF,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;gBAC3E,CAAC,CAAC,CAAC;gBACH,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;YACH,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,UAAU;gBAAE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAClG,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;wBACpB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;wBAC5B,IAAI,CAAC,IAAI,CAAC,IAAI;4BAAE,SAAS;wBACzB,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;wBACxD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;4BAC3B,oEAAoE;4BACpE,gEAAgE;4BAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACrC,IAAI,QAAQ,EAAE,CAAC;gCACb,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;oCAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gCAC9D,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BAChH,CAAC;4BACD,SAAS;wBACX,CAAC;wBACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,IAAI,UAAU;4BAAE,MAAM;wBAC/D,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,qBAAqB,EAAE,IAAI,CAAC,CAAC;wBACjE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACtB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,CAAC;wBACxD,MAAM;oBACR,CAAC;gBACH,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjI,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,kBAAkB,EAAE,MAAM,CAAC,CAAC,CAAC;QAChF,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC;QACvB,uEAAuE;QACvE,yEAAyE;QACzE,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxG,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9F,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YACzC,IAAI,QAAQ,CAAC,IAAI,IAAI,EAAE;gBAAE,MAAM;YAC/B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/D,MAAM,SAAS,GAAG,MAAM,4BAA4B,CAAC,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QACjF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/D,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzG,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE;YACzD,eAAe,EAAE,mBAAmB,CAAC,CAAC,CAAC,uJAAuJ,CAAC,CAAC,CAAC,SAAS;YAC1M,cAAc,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,+GAA+G,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC5M,CAAC,CAAC,CAAC;AACL,CAAC"}

package/build/tools/exact-references.d.ts

@@ -0,0 +1,10 @@
+export interface ExactReferencesOptions {
+    rootDir: string;
+    symbolName: string;
+    file?: string;
+    line?: number;
+    limit?: number;
+    format?: "text" | "json";
+}
+export declare function exactReferencesTool(options: ExactReferencesOptions): Promise<string>;
+//# sourceMappingURL=exact-references.d.ts.map

package/build/tools/exact-references.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"exact-references.d.ts","sourceRoot":"","sources":["../../src/tools/exact-references.ts"],"names":[],"mappings":"AAWA,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CAC1B;AA4TD,wBAAsB,mBAAmB,CAAC,OAAO,EAAE,sBAAsB,GAAG,OAAO,CAAC,MAAM,CAAC,CAqD1F"}

package/build/tools/exact-references.js

@@ -0,0 +1,351 @@
+// TypeScript language-service backed exact reference lookup
+// FEATURE: Exact references — local TS/JS adapter with LSP-grade symbol references
+import { readFile } from "fs/promises";
+import { extname } from "path";
+import ts from "typescript";
+import { getDB } from "../core/db.js";
+import { resolveProjectPath, toProjectRelativePath } from "../core/path-guard.js";
+import { findScipReferences } from "../core/scip-index.js";
+import { pythonLanguageServerConfigured, pythonOperation } from "../core/python-language-server.js";
+function isTypeScriptLike(path) {
+    return [".ts", ".tsx", ".js", ".jsx", ".mjs", ".cjs"].includes(extname(path).toLowerCase());
+}
+function isPython(path) {
+    return extname(path).toLowerCase() === ".py";
+}
+const EXACT_REF_STRUCTURAL_KINDS = new Set(["function", "method", "class", "interface", "enum", "type", "struct", "trait", "export"]);
+function looksLikeTestPath(path) {
+    return /(^|\/)(test|tests|__tests__|spec)(\/|$)|\.(test|spec)\./.test(path);
+}
+async function resolveTarget(options) {
+    if (options.file && options.line !== undefined) {
+        return {
+            file: toProjectRelativePath(options.rootDir, options.file, "file"),
+            line: options.line,
+        };
+    }
+    const relativeFile = options.file ? toProjectRelativePath(options.rootDir, options.file, "file") : null;
+    if (relativeFile && isTypeScriptLike(relativeFile)) {
+        // The structural index intentionally omits some declarations (notably
+        // interface properties). Infer from current syntax, including the name's
+        // actual line rather than a stale index or the declaration's first line.
+        const source = await readFile(resolveProjectPath(options.rootDir, relativeFile, "reference target"), "utf8");
+        const syntax = ts.createSourceFile(relativeFile, source, ts.ScriptTarget.Latest, true);
+        const candidates = [];
+        const visit = (node) => {
+            if (ts.isFunctionDeclaration(node) || ts.isFunctionExpression(node) || ts.isClassDeclaration(node)
+                || ts.isClassExpression(node) || ts.isInterfaceDeclaration(node) || ts.isTypeAliasDeclaration(node)
+                || ts.isEnumDeclaration(node) || ts.isModuleDeclaration(node) || ts.isVariableDeclaration(node)
+                || ts.isBindingElement(node) || ts.isParameter(node) || ts.isMethodDeclaration(node)
+                || ts.isMethodSignature(node) || ts.isPropertyDeclaration(node) || ts.isPropertySignature(node)
+                || ts.isPropertyAssignment(node) || ts.isShorthandPropertyAssignment(node)
+                || ts.isGetAccessorDeclaration(node) || ts.isSetAccessorDeclaration(node) || ts.isEnumMember(node)) {
+                const name = node.name;
+                if (name && (ts.isIdentifier(name) || ts.isStringLiteral(name)) && name.text === options.symbolName) {
+                    candidates.push({ file: relativeFile, line: syntax.getLineAndCharacterOfPosition(name.getStart(syntax)).line + 1,
+                        kind: ts.SyntaxKind[node.kind] });
+                }
+            }
+            ts.forEachChild(node, visit);
+        };
+        visit(syntax);
+        const selected = candidates[0];
+        return selected ? { file: relativeFile, line: selected.line,
+            ...(candidates.length > 1 ? { ambiguousCandidates: candidates.slice(0, 5) } : {}) } : null;
+    }
+    const db = await getDB(options.rootDir);
+    const exact = db.searchSymbolsByName(options.symbolName)
+        .filter((symbol) => symbol.name === options.symbolName);
+    if (relativeFile) {
+        const dbFile = db.getFile(relativeFile);
+        if (dbFile) {
+            const inFile = exact
+                .filter((symbol) => symbol.file_id === dbFile.id)
+                .sort((a, b) => a.line_start - b.line_start);
+            if (inFile.length > 0) {
+                return { file: relativeFile, line: inFile[0].line_start,
+                    ...(inFile.length > 1 ? { ambiguousCandidates: inFile.slice(0, 5).map(symbol => ({ file: relativeFile, line: symbol.line_start, kind: symbol.kind })) } : {}) };
+            }
+        }
+        return null;
+    }
+    const files = db.getAllFiles();
+    const fileById = new Map(files.map((file) => [file.id, file]));
+    // Prefer a real structural definition (function/class/...) over a same-named local
+    // variable, and a non-test file over a test file, before falling back to line order —
+    // this is a best-guess ranking, not a resolution: multiple distinct sites still surface
+    // as an ambiguity warning below rather than being silently picked between.
+    const ranked = exact
+        .map((symbol) => ({ symbol, file: fileById.get(symbol.file_id) }))
+        .filter((entry) => Boolean(entry.file))
+        .sort((a, b) => {
+        const structural = Number(EXACT_REF_STRUCTURAL_KINDS.has(b.symbol.kind)) - Number(EXACT_REF_STRUCTURAL_KINDS.has(a.symbol.kind));
+        if (structural !== 0)
+            return structural;
+        const nonTest = Number(looksLikeTestPath(a.file.path)) - Number(looksLikeTestPath(b.file.path));
+        if (nonTest !== 0)
+            return nonTest;
+        return a.symbol.line_start - b.symbol.line_start;
+    });
+    const selected = ranked[0];
+    if (!selected)
+        return null;
+    const distinctSites = new Set(ranked.map((entry) => `${entry.file.path}:${entry.symbol.line_start}`));
+    const ambiguousCandidates = distinctSites.size > 1
+        ? ranked.slice(0, 5).map((entry) => ({ file: entry.file.path, line: entry.symbol.line_start, kind: entry.symbol.kind }))
+        : undefined;
+    return { file: selected.file.path, line: selected.symbol.line_start, ambiguousCandidates };
+}
+function formatReferencePayload(input) {
+    const ambiguousCandidates = input.target?.ambiguousCandidates ?? [];
+    const total = input.total ?? input.references.length;
+    const truncated = total > input.references.length;
+    const warnings = [...(input.warnings ?? []), ...(truncated ? ["Only the first results are shown; raise limit up to 500, or verify the remaining matches with native tools."] : [])];
+    const callFilesTruncated = input.callFileCount !== undefined && input.callFileCount > (input.callsByFile?.length ?? 0);
+    if (callFilesTruncated)
+        warnings.push(`Call-file summary shows ${input.callsByFile?.length ?? 0} of ${input.callFileCount} files; aggregate call count includes all checked files.`);
+    const scope = input.scope ?? { kind: "indexed_candidates", completeness: "not_guaranteed" };
+    if (input.format === "json") {
+        return JSON.stringify({
+            symbol: input.symbolName,
+            target: input.target,
+            ambiguous: ambiguousCandidates.length > 0,
+            ambiguousCandidates,
+            confidence: input.confidence,
+            scipSymbols: input.scipSymbols,
+            references: input.references,
+            total, returned: input.references.length, truncated, counts: input.counts, scope, warnings,
+            ...(input.callsByFile ? { callsByFile: input.callsByFile, callFileCount: input.callFileCount, callFilesTruncated } : {}),
+        }, null, 2);
+    }
+    const ambiguityLines = ambiguousCandidates.length > 0
+        ? [
+            `⚠ AMBIGUOUS: "${input.symbolName}" matched multiple declaration sites; showing up to five candidates. The inferred target is a best guess; with a supplied file, its first declaration is selected:`,
+            ...ambiguousCandidates.map((c) => `    ${c.file}:L${c.line} [${c.kind}]`),
+            `  Pass file/line explicitly to disambiguate if this looks wrong.`,
+            "",
+        ]
+        : [];
+    if (input.references.length === 0) {
+        // Files the compiler could not check make an empty result unproven, not "no references".
+        const unchecked = warnings.some(w => w.includes("could not be checked"));
+        return [...ambiguityLines, ...warnings.map(w => `Warning: ${w}`), `${unchecked ? "Unverified: " : ""}No exact references found for "${input.symbolName}"${input.target ? ` from ${input.target.file}:${input.target.line}` : ""}.${unchecked ? " Some files were not checked; install the project's dependencies (for example npm install) and retry." : ""}`].join("\n");
+    }
+    const lines = [
+        `Exact references for "${input.symbolName}": ${input.references.length} returned of ${total} matched occurrences${truncated ? " (TRUNCATED)" : ""}`,
+        ...(input.target ? [`Target: ${input.target.file}:${input.target.line}`] : []),
+        `Evidence: ${input.confidence}; scope is limited to indexed files, not all possible runtime references.`,
+        ...(input.counts ? [`Occurrences: ${Object.entries(input.counts).map(([kind, count]) => `${kind}=${count}`).join(", ")}`] : []),
+        ...(input.callsByFile?.length ? [`Calls by file (before result limit): ${input.callsByFile.map(entry => `${entry.file}=${entry.calls}`).join(", ")}`] : []),
+        ...warnings.map(w => `Warning: ${w}`),
+        "",
+        ...ambiguityLines,
+    ];
+    const shownSnippets = new Set();
+    let repeatedSnippets = 0;
+    for (const ref of input.references) {
+        lines.push(`${ref.file}:${ref.line}:${ref.column}${ref.kind ? ` [${ref.kind}]` : ref.isDefinition ? " [definition]" : ""}`);
+        if (ref.context) {
+            const key = JSON.stringify([ref.file, ref.context]);
+            if (shownSnippets.has(key))
+                repeatedSnippets++;
+            else {
+                shownSnippets.add(key);
+                lines.push(`  ${ref.context}`);
+            }
+        }
+    }
+    if (repeatedSnippets)
+        lines.push(`Identical snippets shown once per file (${repeatedSnippets} repeats); all returned locations retained.`);
+    return lines.join("\n");
+}
+async function formatScipFallback(options, target, warnings = []) {
+    const scip = await findScipReferences({
+        rootDir: options.rootDir,
+        symbolName: options.symbolName,
+        file: target?.file ?? options.file,
+        line: target?.line ?? options.line,
+        limit: options.limit,
+    });
+    if (!scip)
+        return null;
+    return formatReferencePayload({
+        symbolName: options.symbolName,
+        target,
+        confidence: "SCIP_RESOLVED",
+        references: scip.references.map((ref) => ({
+            file: ref.file,
+            line: ref.line,
+            column: ref.column,
+            context: ref.context,
+            isDefinition: ref.isDefinition,
+            confidence: "SCIP_RESOLVED",
+        })),
+        format: options.format,
+        scipSymbols: scip.symbols,
+        total: scip.total,
+        warnings: [...warnings, "Imported SCIP evidence has not been checked against the current source revision; reimport after source changes."],
+        scope: { kind: "imported_scip", completeness: "not_guaranteed", freshness: "unverified" },
+    });
+}
+function symbolPattern(symbolName) {
+    return new RegExp(`\\b${symbolName.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")}\\b`, "g");
+}
+function escapeRegex(value) {
+    return value.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+async function pythonIndexReferences(options, target) {
+    const db = await getDB(options.rootDir);
+    const targetFile = db.getFile(target.file);
+    if (!targetFile)
+        return null;
+    const indexedFiles = db.getAllFiles();
+    const fileById = new Map(indexedFiles.map((file) => [file.id, file]));
+    const candidates = new Set([targetFile.id]);
+    const queue = [{ fileId: targetFile.id, depth: 0 }];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        if (current.depth >= 6)
+            continue;
+        for (const importer of db.getImportersOf(current.fileId)) {
+            const source = fileById.get(importer.source_file_id);
+            if (!source || !isPython(source.path) || candidates.has(source.id))
+                continue;
+            candidates.add(source.id);
+            queue.push({ fileId: source.id, depth: current.depth + 1 });
+        }
+    }
+    const graphCandidateCount = candidates.size;
+    for (const call of db.getCallersOf(options.symbolName)) {
+        const source = fileById.get(call.file_id);
+        if (!source || !isPython(source.path))
+            continue;
+        if (graphCandidateCount > 1 && !candidates.has(source.id))
+            continue;
+        candidates.add(source.id);
+    }
+    const definitionLines = new Set(db.getSymbolsByFile(targetFile.id)
+        .filter((symbol) => symbol.name === options.symbolName)
+        .map((symbol) => symbol.line_start));
+    const references = [];
+    const pattern = symbolPattern(options.symbolName);
+    const escapedSymbol = escapeRegex(options.symbolName);
+    for (const fileId of candidates) {
+        const file = fileById.get(fileId);
+        if (!file)
+            continue;
+        let content = "";
+        try {
+            content = await readFile(resolveProjectPath(options.rootDir, file.path, "python reference file"), "utf-8");
+        }
+        catch {
+            continue;
+        }
+        const lines = content.split("\n");
+        for (let lineIndex = 0; lineIndex < lines.length; lineIndex++) {
+            const line = lines[lineIndex];
+            pattern.lastIndex = 0;
+            let match;
+            while ((match = pattern.exec(line)) !== null) {
+                const lineNumber = lineIndex + 1;
+                const trimmed = line.trim();
+                const isDefinition = file.path === target.file && (definitionLines.has(lineNumber)
+                    || new RegExp(`^def\\s+${escapedSymbol}\\b`).test(trimmed)
+                    || new RegExp(`^class\\s+${escapedSymbol}\\b`).test(trimmed));
+                const looksRelevant = isDefinition
+                    || /^from\s+[\w.]+\s+import\b/.test(trimmed)
+                    || /^import\s+[\w.]+/.test(trimmed)
+                    || /\w+\s*\(/.test(trimmed)
+                    || trimmed.includes(options.symbolName);
+                if (!looksRelevant)
+                    continue;
+                references.push({
+                    file: file.path,
+                    line: lineNumber,
+                    column: match.index + 1,
+                    context: trimmed.slice(0, 160),
+                    isDefinition,
+                    confidence: "PYTHON_INDEX_RESOLVED",
+                });
+            }
+        }
+    }
+    const unique = new Map();
+    for (const ref of references)
+        unique.set(`${ref.file}:${ref.line}:${ref.column}:${ref.isDefinition}`, ref);
+    const total = unique.size;
+    const limited = [...unique.values()]
+        .sort((a, b) => Number(b.isDefinition) - Number(a.isDefinition) || a.file.localeCompare(b.file) || a.line - b.line || a.column - b.column)
+        .slice(0, Math.max(1, Math.min(options.limit ?? 100, 500)));
+    if (limited.length === 0)
+        return null;
+    return formatReferencePayload({
+        symbolName: options.symbolName,
+        target,
+        confidence: "PYTHON_INDEX_RESOLVED",
+        total,
+        warnings: ["Python import/call candidates are heuristic; this is not binding-resolved or exhaustive."],
+        references: limited,
+        format: options.format,
+    });
+}
+export async function exactReferencesTool(options) {
+    const target = await resolveTarget(options);
+    if (!target) {
+        const scipResult = await formatScipFallback(options);
+        if (scipResult)
+            return scipResult;
+        if (options.file)
+            return `No declaration found for symbol "${options.symbolName}" in ${options.file}. Provide the line of a known occurrence explicitly, or choose its definition file.`;
+        return `No indexed definition found for symbol "${options.symbolName}". Run reindex, import a SCIP JSON index, or provide file and line.`;
+    }
+    if (!isTypeScriptLike(target.file)) {
+        if (isPython(target.file) && pythonLanguageServerConfigured()) {
+            const source = await readFile(resolveProjectPath(options.rootDir, target.file), "utf8");
+            const line = source.split("\n")[target.line - 1] ?? "";
+            const escaped = options.symbolName.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+            const matches = [...line.matchAll(new RegExp(`(?<![\\p{ID_Continue}])${escaped}(?![\\p{ID_Continue}])`, "gu"))];
+            if (matches.length !== 1)
+                throw new Error("Python reference target is absent or ambiguous on the supplied line.");
+            const db = await getDB(options.rootDir);
+            const found = await pythonOperation({ rootDir: options.rootDir, files: db.getAllFiles().filter(file => isPython(file.path)).map(file => file.path),
+                operation: "references", file: target.file, line: target.line, column: matches[0].index + 1 });
+            const references = (found.references ?? []).map(ref => ({ ...ref, confidence: "LSP_RESOLVED" }));
+            return formatReferencePayload({ symbolName: options.symbolName, target, confidence: "LSP_RESOLVED", references: references.slice(0, Math.max(1, Math.min(options.limit ?? 100, 500))), total: references.length,
+                warnings: found.warnings, scope: { kind: "python_pyright", completeness: "language_server_workspace" }, format: options.format });
+        }
+        const scipResult = await formatScipFallback(options, target);
+        if (scipResult)
+            return scipResult;
+        if (isPython(target.file)) {
+            const pythonResult = await pythonIndexReferences(options, target);
+            if (pythonResult)
+                return pythonResult;
+        }
+        return `Exact references require TypeScript/JavaScript language-service support, Python import/call index evidence, or an imported SCIP JSON index. Target file: ${target.file}`;
+    }
+    const { queryTypeScriptReferences } = await import("../core/typescript-reference-process.js");
+    const db = await getDB(options.rootDir);
+    const found = await queryTypeScriptReferences({
+        rootDir: options.rootDir,
+        files: db.getAllFiles().filter(file => isTypeScriptLike(file.path)).map(file => resolveProjectPath(options.rootDir, file.path, "indexed file")),
+        file: resolveProjectPath(options.rootDir, target.file, "reference target"),
+        line: target.line, symbol: options.symbolName,
+        limit: Math.max(1, Math.min(options.limit ?? 100, 500)),
+    });
+    if (found.total === 0) {
+        const scipResult = await formatScipFallback(options, target, [
+            ...found.warnings, "TypeScript returned no references; using imported SCIP evidence as a fallback.",
+        ]);
+        if (scipResult)
+            return scipResult;
+    }
+    const references = found.references.map(ref => ({ ...ref, confidence: "LSP_RESOLVED" }));
+    return formatReferencePayload({
+        symbolName: options.symbolName, target, confidence: "LSP_RESOLVED",
+        references,
+        total: found.total, counts: found.counts, callsByFile: found.callsByFile, callFileCount: found.callFileCount,
+        warnings: found.warnings, scope: found.scope, format: options.format,
+    });
+}
+//# sourceMappingURL=exact-references.js.map