@code-rag/core 0.1.0

package/dist/parser/tree-sitter-parser.js

@@ -0,0 +1,146 @@
+import TSParser from 'web-tree-sitter';
+import { ok, err } from 'neverthrow';
+import { ParseError } from '../types/provider.js';
+import { LanguageRegistry } from './language-registry.js';
+/**
+ * Extract a human-readable name from a tree-sitter AST node.
+ *
+ * Tries the following strategies in order:
+ * 1. `childForFieldName('name')` — works for most declarations
+ * 2. `childForFieldName('declaration')` then its 'name' child — for export wrappers
+ * 3. `childForFieldName('declarator')` then its 'name' child — for C/C++ style declarations
+ *
+ * Returns undefined if no name can be extracted.
+ */
+function extractNodeName(node) {
+    // Strategy 1: direct 'name' field
+    const nameNode = node.childForFieldName('name');
+    if (nameNode) {
+        return nameNode.text;
+    }
+    // Strategy 2: 'declaration' field with a 'name' sub-field
+    const declarationNode = node.childForFieldName('declaration');
+    if (declarationNode) {
+        const declName = declarationNode.childForFieldName('name');
+        if (declName) {
+            return declName.text;
+        }
+    }
+    // Strategy 3: 'declarator' field with a 'name' sub-field
+    const declaratorNode = node.childForFieldName('declarator');
+    if (declaratorNode) {
+        const declrName = declaratorNode.childForFieldName('name');
+        if (declrName) {
+            return declrName.text;
+        }
+        // Some declarators (e.g. simple variable declarators) have the name directly as text
+        if (declaratorNode.type === 'identifier') {
+            return declaratorNode.text;
+        }
+    }
+    return undefined;
+}
+/**
+ * Walk the top-level children of a root AST node and extract declaration names.
+ *
+ * Only nodes whose type is in the provided `declarationTypes` set are considered.
+ */
+function extractDeclarations(rootNode, declarationTypes) {
+    const declarations = [];
+    for (let i = 0; i < rootNode.childCount; i++) {
+        const child = rootNode.child(i);
+        if (!child)
+            continue;
+        if (!declarationTypes.has(child.type))
+            continue;
+        const name = extractNodeName(child);
+        if (name) {
+            declarations.push(name);
+        }
+    }
+    return declarations;
+}
+/**
+ * A Parser implementation that uses tree-sitter WASM bindings
+ * to parse source files and extract top-level declarations.
+ */
+export class TreeSitterParser {
+    parser = null;
+    registry = null;
+    initialized = false;
+    /**
+     * Initialize the tree-sitter WASM runtime and create internal instances.
+     * Must be called before `parse()`.
+     */
+    async initialize() {
+        try {
+            await TSParser.init();
+            this.parser = new TSParser();
+            this.registry = new LanguageRegistry();
+            this.initialized = true;
+            return ok(undefined);
+        }
+        catch (error) {
+            const message = error instanceof Error ? error.message : String(error);
+            return err(new ParseError(`Failed to initialize tree-sitter: ${message}`));
+        }
+    }
+    /**
+     * Parse a source file and extract its top-level declarations.
+     *
+     * Detects the language from the file path, loads the corresponding WASM grammar,
+     * parses the content into an AST, and extracts declaration names.
+     */
+    async parse(filePath, content) {
+        if (!this.initialized || !this.parser || !this.registry) {
+            return err(new ParseError('TreeSitterParser not initialized. Call initialize() first.'));
+        }
+        const language = this.registry.detectLanguage(filePath);
+        if (!language) {
+            return err(new ParseError(`Unsupported file type: ${filePath}`));
+        }
+        try {
+            const tsLanguage = await this.registry.loadLanguage(language);
+            this.parser.setLanguage(tsLanguage);
+            const tree = this.parser.parse(content);
+            if (!tree) {
+                return err(new ParseError(`Failed to parse file: ${filePath}`));
+            }
+            const declarationTypes = this.registry.getDeclarationNodeTypes(language);
+            const declarations = extractDeclarations(tree.rootNode, declarationTypes);
+            tree.delete();
+            return ok({
+                filePath,
+                language,
+                content,
+                declarations,
+            });
+        }
+        catch (error) {
+            const message = error instanceof Error
+                ? (error.message || error.constructor.name)
+                : String(error);
+            return err(new ParseError(`Error parsing ${filePath}: ${message}`));
+        }
+    }
+    /**
+     * Get the list of all file extensions / languages this parser supports.
+     */
+    supportedLanguages() {
+        if (!this.registry) {
+            return [];
+        }
+        return this.registry.supportedLanguages();
+    }
+    /**
+     * Clean up parser resources.
+     */
+    dispose() {
+        if (this.parser) {
+            this.parser.delete();
+            this.parser = null;
+        }
+        this.registry = null;
+        this.initialized = false;
+    }
+}

package/dist/parser/tree-sitter-parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-sitter-parser.js","sourceRoot":"","sources":["../../src/parser/tree-sitter-parser.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,iBAAiB,CAAC;AAEvC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAe,MAAM,YAAY,CAAC;AAElD,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE1D;;;;;;;;;GASG;AACH,SAAS,eAAe,CAAC,IAAY;IACnC,kCAAkC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,QAAQ,CAAC,IAAI,CAAC;IACvB,CAAC;IAED,0DAA0D;IAC1D,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;IAC9D,IAAI,eAAe,EAAE,CAAC;QACpB,MAAM,QAAQ,GAAG,eAAe,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,QAAQ,CAAC,IAAI,CAAC;QACvB,CAAC;IACH,CAAC;IAED,yDAAyD;IACzD,MAAM,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;IAC5D,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,SAAS,GAAG,cAAc,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,SAAS,CAAC,IAAI,CAAC;QACxB,CAAC;QACD,qFAAqF;QACrF,IAAI,cAAc,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YACzC,OAAO,cAAc,CAAC,IAAI,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAC1B,QAAgB,EAChB,gBAAqC;IAErC,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,SAAS;QAEhD,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAI,EAAE,CAAC;YACT,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IACnB,MAAM,GAAoB,IAAI,CAAC;IAC/B,QAAQ,GAA4B,IAAI,CAAC;IACzC,WAAW,GAAG,KAAK,CAAC;IAE5B;;;OAGG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC;YACH,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,GAAG,IAAI,gBAAgB,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;QACvB,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvE,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,qCAAqC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,KAAK,CAAC,QAAgB,EAAE,OAAe;QAC3C,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxD,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,4DAA4D,CAAC,CAAC,CAAC;QAC3F,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,0BAA0B,QAAQ,EAAE,CAAC,CAAC,CAAC;QACnE,CAAC;QAED,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC9D,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAEpC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,yBAAyB,QAAQ,EAAE,CAAC,CAAC,CAAC;YAClE,CAAC;YAED,MAAM,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YACzE,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;YAE1E,IAAI,CAAC,MAAM,EAAE,CAAC;YAEd,OAAO,EAAE,CAAC;gBACR,QAAQ;gBACR,QAAQ;gBACR,OAAO;gBACP,YAAY;aACb,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK;gBACpC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC;gBAC3C,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAClB,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,iBAAiB,QAAQ,KAAK,OAAO,EAAE,CAAC,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,kBAAkB,EAAE,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;CACF"}

package/dist/retrieval/context-expander.d.ts

@@ -0,0 +1,51 @@
+import type { SearchResult } from '../types/index.js';
+import type { GraphNode, GraphEdge } from '../graph/index.js';
+/** Read-only graph interface for dependency inversion. */
+export interface ReadonlyGraph {
+    getNode(id: string): GraphNode | undefined;
+    getEdges(nodeId: string): GraphEdge[];
+    getIncomingEdges(nodeId: string): GraphEdge[];
+}
+export type RelationshipType = 'imports' | 'imported_by' | 'test_for' | 'interface_of' | 'sibling' | 'backlog';
+export interface RelatedChunk {
+    chunk: SearchResult;
+    relationship: RelationshipType;
+    distance: number;
+}
+export interface GraphExcerpt {
+    nodes: string[];
+    edges: Array<{
+        from: string;
+        to: string;
+        type: string;
+    }>;
+}
+export interface ExpandedContext {
+    primaryResults: SearchResult[];
+    relatedChunks: RelatedChunk[];
+    graphExcerpt: GraphExcerpt;
+}
+export declare class ContextExpander {
+    private readonly graph;
+    private readonly chunkLookup;
+    constructor(dependencyGraph: ReadonlyGraph, chunkLookup: (chunkId: string) => SearchResult | undefined);
+    /**
+     * Expand search results with graph-based context.
+     * For each result, walks the dependency graph to find related chunks
+     * and classifies their relationships.
+     */
+    expand(results: SearchResult[], maxRelated?: number): ExpandedContext;
+    /**
+     * Classify the relationship between two nodes based on graph edges and naming conventions.
+     */
+    private classifyRelationship;
+    /**
+     * Single-pass BFS from source, returning a Map of nodeId → distance
+     * for all nodes reachable within 2 hops (excludes the source itself).
+     */
+    private computeDistances;
+    /**
+     * Collect graph edges from a node and its related nodes for the excerpt.
+     */
+    private collectEdges;
+}

package/dist/retrieval/context-expander.js

@@ -0,0 +1,218 @@
+const DEFAULT_MAX_RELATED = 10;
+export class ContextExpander {
+    graph;
+    chunkLookup;
+    constructor(dependencyGraph, chunkLookup) {
+        this.graph = dependencyGraph;
+        this.chunkLookup = chunkLookup;
+    }
+    /**
+     * Expand search results with graph-based context.
+     * For each result, walks the dependency graph to find related chunks
+     * and classifies their relationships.
+     */
+    expand(results, maxRelated = DEFAULT_MAX_RELATED) {
+        const relatedMap = new Map();
+        const graphNodes = new Set();
+        const graphEdges = [];
+        const primaryIds = new Set(results.map((r) => r.chunkId));
+        for (const result of results) {
+            const nodeId = result.chunkId;
+            graphNodes.add(nodeId);
+            // Single BFS pass: get related nodes and their distances in one traversal
+            const distanceMap = this.computeDistances(nodeId);
+            const relatedNodeIds = new Set(distanceMap.keys());
+            for (const relatedId of relatedNodeIds) {
+                graphNodes.add(relatedId);
+                // Don't add primary results as related chunks
+                if (primaryIds.has(relatedId))
+                    continue;
+                // Don't add duplicates — keep the one with shortest distance
+                if (relatedMap.has(relatedId))
+                    continue;
+                const relatedResult = this.chunkLookup(relatedId);
+                if (!relatedResult)
+                    continue;
+                const relationship = this.classifyRelationship(nodeId, relatedId);
+                const distance = distanceMap.get(relatedId) ?? 3;
+                relatedMap.set(relatedId, {
+                    chunk: relatedResult,
+                    relationship,
+                    distance,
+                });
+            }
+            // Collect edges for graph excerpt
+            this.collectEdges(nodeId, relatedNodeIds, graphEdges);
+        }
+        // Sort related chunks by distance (closest first), then limit
+        const relatedChunks = [...relatedMap.values()]
+            .sort((a, b) => a.distance - b.distance)
+            .slice(0, maxRelated);
+        return {
+            primaryResults: results,
+            relatedChunks,
+            graphExcerpt: {
+                nodes: [...graphNodes],
+                edges: deduplicateEdges(graphEdges),
+            },
+        };
+    }
+    /**
+     * Classify the relationship between two nodes based on graph edges and naming conventions.
+     */
+    classifyRelationship(sourceId, relatedId) {
+        const sourceNode = this.graph.getNode(sourceId);
+        const relatedNode = this.graph.getNode(relatedId);
+        // Check if either node is a backlog item
+        if (sourceNode?.type === 'backlog' || relatedNode?.type === 'backlog') {
+            return 'backlog';
+        }
+        // Check if the related file is a test file for the source
+        if (relatedNode?.filePath && isTestFileFor(relatedNode.filePath, sourceNode?.filePath)) {
+            return 'test_for';
+        }
+        if (sourceNode?.filePath && isTestFileFor(sourceNode.filePath, relatedNode?.filePath)) {
+            return 'test_for';
+        }
+        // Check direct edges for imports / imported_by
+        const outgoingEdges = this.graph.getEdges(sourceId);
+        for (const edge of outgoingEdges) {
+            if (edge.target === relatedId) {
+                if (edge.type === 'implements') {
+                    return 'interface_of';
+                }
+                return 'imports';
+            }
+        }
+        const incomingEdges = this.graph.getIncomingEdges(sourceId);
+        for (const edge of incomingEdges) {
+            if (edge.source === relatedId) {
+                if (edge.type === 'implements') {
+                    return 'interface_of';
+                }
+                return 'imported_by';
+            }
+        }
+        // Check if they share the same directory (siblings)
+        if (sourceNode?.filePath &&
+            relatedNode?.filePath &&
+            sameDirectory(sourceNode.filePath, relatedNode.filePath)) {
+            return 'sibling';
+        }
+        // Default: treat as imports if connected at all
+        return 'imports';
+    }
+    /**
+     * Single-pass BFS from source, returning a Map of nodeId → distance
+     * for all nodes reachable within 2 hops (excludes the source itself).
+     */
+    computeDistances(sourceId) {
+        const distances = new Map();
+        const visited = new Set();
+        const queue = [
+            { id: sourceId, depth: 0 },
+        ];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (visited.has(current.id))
+                continue;
+            visited.add(current.id);
+            if (current.id !== sourceId) {
+                distances.set(current.id, current.depth);
+            }
+            if (current.depth < 2) {
+                const neighbors = [
+                    ...this.graph.getEdges(current.id).map((e) => e.target),
+                    ...this.graph.getIncomingEdges(current.id).map((e) => e.source),
+                ];
+                for (const neighbor of neighbors) {
+                    if (!visited.has(neighbor)) {
+                        queue.push({ id: neighbor, depth: current.depth + 1 });
+                    }
+                }
+            }
+        }
+        return distances;
+    }
+    /**
+     * Collect graph edges from a node and its related nodes for the excerpt.
+     */
+    collectEdges(nodeId, relatedNodeIds, graphEdges) {
+        const relevantIds = new Set([nodeId, ...relatedNodeIds]);
+        // Add outgoing edges from the node
+        for (const edge of this.graph.getEdges(nodeId)) {
+            if (relevantIds.has(edge.target)) {
+                graphEdges.push({
+                    from: edge.source,
+                    to: edge.target,
+                    type: edge.type,
+                });
+            }
+        }
+        // Add incoming edges to the node
+        for (const edge of this.graph.getIncomingEdges(nodeId)) {
+            if (relevantIds.has(edge.source)) {
+                graphEdges.push({
+                    from: edge.source,
+                    to: edge.target,
+                    type: edge.type,
+                });
+            }
+        }
+        // Add edges between related nodes
+        for (const relatedId of relatedNodeIds) {
+            for (const edge of this.graph.getEdges(relatedId)) {
+                if (relevantIds.has(edge.target)) {
+                    graphEdges.push({
+                        from: edge.source,
+                        to: edge.target,
+                        type: edge.type,
+                    });
+                }
+            }
+        }
+    }
+}
+/** Check if `testPath` is a test file for `sourcePath`. */
+function isTestFileFor(testPath, sourcePath) {
+    if (!sourcePath)
+        return false;
+    // Check patterns: foo.test.ts, foo.spec.ts, __tests__/foo.ts
+    const testPatterns = ['.test.', '.spec.', '/__tests__/'];
+    const isTestFile = testPatterns.some((p) => testPath.includes(p));
+    if (!isTestFile)
+        return false;
+    // Check if the base file names match
+    const sourceBase = getBaseName(sourcePath);
+    const testBase = getBaseName(testPath)
+        .replace(/\.test$/, '')
+        .replace(/\.spec$/, '');
+    return sourceBase === testBase;
+}
+/** Extract base file name without extension. */
+function getBaseName(filePath) {
+    const parts = filePath.split('/');
+    const fileName = parts[parts.length - 1] ?? '';
+    // Remove all extensions
+    const dotIndex = fileName.indexOf('.');
+    return dotIndex === -1 ? fileName : fileName.substring(0, dotIndex);
+}
+/** Check if two file paths share the same directory. */
+function sameDirectory(pathA, pathB) {
+    const dirA = pathA.substring(0, pathA.lastIndexOf('/'));
+    const dirB = pathB.substring(0, pathB.lastIndexOf('/'));
+    return dirA === dirB && dirA.length > 0;
+}
+/** Deduplicate graph edges by from+to+type. */
+function deduplicateEdges(edges) {
+    const seen = new Set();
+    const result = [];
+    for (const edge of edges) {
+        const key = `${edge.from}|${edge.to}|${edge.type}`;
+        if (!seen.has(key)) {
+            seen.add(key);
+            result.push(edge);
+        }
+    }
+    return result;
+}

package/dist/retrieval/context-expander.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-expander.js","sourceRoot":"","sources":["../../src/retrieval/context-expander.ts"],"names":[],"mappings":"AAmCA,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAE/B,MAAM,OAAO,eAAe;IACT,KAAK,CAAgB;IACrB,WAAW,CAAgD;IAE5E,YACE,eAA8B,EAC9B,WAA0D;QAE1D,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,MAAM,CACJ,OAAuB,EACvB,aAAqB,mBAAmB;QAExC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;QACnD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,MAAM,UAAU,GAAsD,EAAE,CAAC;QACzE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAE1D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC;YAC9B,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEvB,0EAA0E;YAC1E,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;YAClD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;YAEnD,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;gBACvC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAE1B,8CAA8C;gBAC9C,IAAI,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,SAAS;gBAExC,6DAA6D;gBAC7D,IAAI,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,SAAS;gBAExC,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;gBAClD,IAAI,CAAC,aAAa;oBAAE,SAAS;gBAE7B,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAClE,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAEjD,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE;oBACxB,KAAK,EAAE,aAAa;oBACpB,YAAY;oBACZ,QAAQ;iBACT,CAAC,CAAC;YACL,CAAC;YAED,kCAAkC;YAClC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;QACxD,CAAC;QAED,8DAA8D;QAC9D,MAAM,aAAa,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;aAC3C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;aACvC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAExB,OAAO;YACL,cAAc,EAAE,OAAO;YACvB,aAAa;YACb,YAAY,EAAE;gBACZ,KAAK,EAAE,CAAC,GAAG,UAAU,CAAC;gBACtB,KAAK,EAAE,gBAAgB,CAAC,UAAU,CAAC;aACpC;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,oBAAoB,CAC1B,QAAgB,EAChB,SAAiB;QAEjB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAElD,yCAAyC;QACzC,IAAI,UAAU,EAAE,IAAI,KAAK,SAAS,IAAI,WAAW,EAAE,IAAI,KAAK,SAAS,EAAE,CAAC;YACtE,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,0DAA0D;QAC1D,IAAI,WAAW,EAAE,QAAQ,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;YACvF,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,IAAI,UAAU,EAAE,QAAQ,IAAI,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,WAAW,EAAE,QAAQ,CAAC,EAAE,CAAC;YACtF,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,+CAA+C;QAC/C,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACpD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;oBAC/B,OAAO,cAAc,CAAC;gBACxB,CAAC;gBACD,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;oBAC/B,OAAO,cAAc,CAAC;gBACxB,CAAC;gBACD,OAAO,aAAa,CAAC;YACvB,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,IACE,UAAU,EAAE,QAAQ;YACpB,WAAW,EAAE,QAAQ;YACrB,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,WAAW,CAAC,QAAQ,CAAC,EACxD,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,gDAAgD;QAChD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACK,gBAAgB,CAAC,QAAgB;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAyC;YAClD,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE;SAC3B,CAAC;QAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAAE,SAAS;YACtC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAExB,IAAI,OAAO,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;gBAC5B,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3C,CAAC;YAED,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,SAAS,GAAG;oBAChB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;oBACvD,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;iBAChE,CAAC;gBACF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACzD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,MAAc,EACd,cAA2B,EAC3B,UAA6D;QAE7D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC;QAEzD,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjC,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,IAAI,CAAC,MAAM;oBACjB,EAAE,EAAE,IAAI,CAAC,MAAM;oBACf,IAAI,EAAE,IAAI,CAAC,IAAI;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjC,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,IAAI,CAAC,MAAM;oBACjB,EAAE,EAAE,IAAI,CAAC,MAAM;oBACf,IAAI,EAAE,IAAI,CAAC,IAAI;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;YACvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClD,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACjC,UAAU,CAAC,IAAI,CAAC;wBACd,IAAI,EAAE,IAAI,CAAC,MAAM;wBACjB,EAAE,EAAE,IAAI,CAAC,MAAM;wBACf,IAAI,EAAE,IAAI,CAAC,IAAI;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED,2DAA2D;AAC3D,SAAS,aAAa,CACpB,QAAgB,EAChB,UAA8B;IAE9B,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAE9B,6DAA6D;IAC7D,MAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAE9B,qCAAqC;IACrC,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC;SACnC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;SACtB,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAE1B,OAAO,UAAU,KAAK,QAAQ,CAAC;AACjC,CAAC;AAED,gDAAgD;AAChD,SAAS,WAAW,CAAC,QAAgB;IACnC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/C,wBAAwB;IACxB,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvC,OAAO,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AACtE,CAAC;AAED,wDAAwD;AACxD,SAAS,aAAa,CAAC,KAAa,EAAE,KAAa;IACjD,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,OAAO,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED,+CAA+C;AAC/C,SAAS,gBAAgB,CACvB,KAAwD;IAExD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAsD,EAAE,CAAC;IAErE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACnD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/retrieval/context-expander.test.d.ts

@@ -0,0 +1 @@
+export {};