@liendev/lien 0.24.0 → 0.26.0

package/README.md

@@ -4,7 +4,7 @@
 
 **Give AI deep understanding of your codebase through semantic search. 100% local, 100% private.**
 
-Lien connects AI coding assistants like Cursor to your codebase through the Model Context Protocol (MCP). Ask questions in natural language, get precise answers from semantic search—all running locally on your machine.
+Lien connects AI coding assistants like Cursor and Claude Code to your codebase through the Model Context Protocol (MCP). Ask questions in natural language, get precise answers from semantic search—all running locally on your machine.
 
 📚 **[Full Documentation](https://lien.dev)** | 🚀 **[Getting Started](https://lien.dev/guide/getting-started)** | 🔍 **[How It Works](https://lien.dev/how-it-works)**
 
@@ -15,7 +15,7 @@ Lien connects AI coding assistants like Cursor to your codebase through the Mode
 - 🔒 **100% Local & Private** - All code analysis happens on your machine
 - 🚀 **Semantic Search** - Natural language queries: "How does authentication work?"
 - 🌐 **Cross-Repo Search** - Search across all repositories in your organization (Qdrant backend)
-- 🎯 **MCP Integration** - Works seamlessly with Cursor and other MCP-compatible tools
+- 🎯 **MCP Integration** - Works seamlessly with Cursor, Claude Code, and other MCP-compatible tools
 - ⚡ **Fast** - Sub-500ms queries, minutes to index large codebases
 - 🆓 **Free Forever** - No API costs, no subscriptions, no usage limits
 - 📦 **Framework-Aware** - Auto-detects Node.js, Laravel, Shopify; supports 15+ languages
@@ -39,7 +39,7 @@ npm install -g @liendev/lien
   }
 }
 
-# 3. Restart Cursor and start asking questions!
+# 3. Restart your AI assistant (Cursor, Claude Code) and start asking questions!
 ```
 
 That's it—zero configuration needed. Lien auto-detects your project and indexes on first use.
@@ -99,7 +99,7 @@ Lien tracks code complexity with intuitive outputs:
 ## Documentation
 
 - **[Installation](https://lien.dev/guide/installation)** - npm, npx, or local setup
-- **[Getting Started](https://lien.dev/guide/getting-started)** - Step-by-step configuration for Cursor
+- **[Getting Started](https://lien.dev/guide/getting-started)** - Step-by-step configuration for Cursor or Claude Code
 - **[Configuration](https://lien.dev/guide/configuration)** - Customize indexing, thresholds, performance
 - **[CLI Commands](https://lien.dev/guide/cli-commands)** - Full command reference
 - **[MCP Tools](https://lien.dev/guide/mcp-tools)** - Complete API reference for all 6 tools

package/dist/index.js

@@ -8292,11 +8292,17 @@ var SemanticSearchSchema = external_exports.object({
 
 // src/mcp/schemas/similarity.schema.ts
 var FindSimilarSchema = external_exports.object({
-  code: external_exports.string().min(10, "Code snippet must be at least 10 characters").describe(
+  code: external_exports.string().min(24, "Code snippet must be at least 24 characters").describe(
     "Code snippet to find similar implementations for.\n\nProvide a representative code sample that demonstrates the pattern you want to find similar examples of in the codebase."
   ),
   limit: external_exports.number().int().min(1, "Limit must be at least 1").max(20, "Limit cannot exceed 20").default(5).describe(
     "Number of similar code blocks to return.\n\nDefault: 5"
+  ),
+  language: external_exports.string().min(1, "Language filter cannot be empty").optional().describe(
+    "Filter by programming language.\n\nExamples: 'typescript', 'python', 'javascript', 'php'\n\nIf omitted, searches all languages."
+  ),
+  pathHint: external_exports.string().min(1, "Path hint cannot be empty").optional().describe(
+    "Filter by file path substring.\n\nOnly returns results where the file path contains this string (case-insensitive).\n\nExamples: 'src/api', 'components', 'utils'"
   )
 });
 
@@ -8378,7 +8384,13 @@ Results include a relevance category (highly_relevant, relevant, loosely_related
 - Finding duplicate implementations
 - Refactoring similar patterns together
 
-Provide at least 10 characters of code to match against. Results include a relevance category for each match.`
+Provide at least 24 characters of code to match against. Results include a relevance category for each match.
+
+Optional filters:
+- language: Filter by programming language (e.g., "typescript", "python")
+- pathHint: Filter by file path substring (e.g., "src/api", "components")
+
+Low-relevance results (not_relevant) are automatically pruned.`
   ),
   toMCPToolSchema(
     GetFilesContextSchema,
@@ -8553,12 +8565,14 @@ async function handleSemanticSearch(args, ctx) {
       await checkAndReconnect();
       const queryEmbedding = await embeddings.embed(query);
       let results;
+      let crossRepoFallback = false;
       if (crossRepo && vectorDB instanceof QdrantDB) {
         results = await vectorDB.searchCrossRepo(queryEmbedding, limit, { repoIds });
         log(`Found ${results.length} results across ${Object.keys(groupResultsByRepo(results)).length} repos`);
       } else {
         if (crossRepo) {
           log("Warning: crossRepo=true requires Qdrant backend. Falling back to single-repo search.");
+          crossRepoFallback = true;
         }
         results = await vectorDB.search(queryEmbedding, limit, query);
         log(`Found ${results.length} results`);
@@ -8570,12 +8584,28 @@ async function handleSemanticSearch(args, ctx) {
       if (crossRepo && vectorDB instanceof QdrantDB) {
         response.groupedByRepo = groupResultsByRepo(results);
       }
+      if (crossRepoFallback) {
+        response.note = "Cross-repo search requires Qdrant backend. Fell back to single-repo search.";
+      }
       return response;
     }
   )(args);
 }
 
 // src/mcp/handlers/find-similar.ts
+function applyLanguageFilter(results, language) {
+  const lang = language.toLowerCase();
+  return results.filter((r) => r.metadata.language?.toLowerCase() === lang);
+}
+function applyPathHintFilter(results, pathHint) {
+  const hint = pathHint.toLowerCase();
+  return results.filter((r) => (r.metadata.file?.toLowerCase() ?? "").includes(hint));
+}
+function pruneIrrelevantResults(results) {
+  const beforePrune = results.length;
+  const filtered = results.filter((r) => r.relevance !== "not_relevant");
+  return { filtered, prunedCount: beforePrune - filtered.length };
+}
 async function handleFindSimilar(args, ctx) {
   const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;
   return await wrapToolHandler(
@@ -8584,11 +8614,27 @@ async function handleFindSimilar(args, ctx) {
       log(`Finding similar code...`);
       await checkAndReconnect();
       const codeEmbedding = await embeddings.embed(validatedArgs.code);
-      const results = await vectorDB.search(codeEmbedding, validatedArgs.limit, validatedArgs.code);
-      log(`Found ${results.length} similar chunks`);
+      const limit = validatedArgs.limit ?? 5;
+      const extraLimit = limit + 10;
+      let results = await vectorDB.search(codeEmbedding, extraLimit, validatedArgs.code);
+      const filtersApplied = { prunedLowRelevance: 0 };
+      if (validatedArgs.language) {
+        filtersApplied.language = validatedArgs.language;
+        results = applyLanguageFilter(results, validatedArgs.language);
+      }
+      if (validatedArgs.pathHint) {
+        filtersApplied.pathHint = validatedArgs.pathHint;
+        results = applyPathHintFilter(results, validatedArgs.pathHint);
+      }
+      const { filtered, prunedCount } = pruneIrrelevantResults(results);
+      filtersApplied.prunedLowRelevance = prunedCount;
+      const finalResults = filtered.slice(0, limit);
+      log(`Found ${finalResults.length} similar chunks`);
+      const hasFilters = filtersApplied.language || filtersApplied.pathHint || filtersApplied.prunedLowRelevance > 0;
       return {
         indexInfo: getIndexMetadata(),
-        results
+        results: finalResults,
+        ...hasFilters && { filtersApplied }
       };
     }
   )(args);
@@ -8743,6 +8789,25 @@ function buildFilesData(filepaths, fileChunksMap, relatedChunksMap, testAssociat
   });
   return filesData;
 }
+function buildScanLimitNote(hitScanLimit) {
+  return hitScanLimit ? "Scanned 10,000 chunks (limit reached). Test associations may be incomplete for large codebases." : void 0;
+}
+function buildSingleFileResponse(filepath, filesData, indexInfo, note) {
+  return {
+    indexInfo,
+    file: filepath,
+    chunks: filesData[filepath].chunks,
+    testAssociations: filesData[filepath].testAssociations,
+    ...note && { note }
+  };
+}
+function buildMultiFileResponse(filesData, indexInfo, note) {
+  return {
+    indexInfo,
+    files: filesData,
+    ...note && { note }
+  };
+}
 async function handleGetFilesContext(args, ctx) {
   const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;
   return await wrapToolHandler(
@@ -8769,7 +8834,8 @@ async function handleGetFilesContext(args, ctx) {
         );
       }
       const allChunks = await vectorDB.scanWithFilter({ limit: SCAN_LIMIT });
-      if (allChunks.length === SCAN_LIMIT) {
+      const hitScanLimit = allChunks.length === SCAN_LIMIT;
+      if (hitScanLimit) {
         log(
           `Scanned ${SCAN_LIMIT} chunks (limit reached). Test associations may be incomplete for large codebases.`,
           "warning"
@@ -8792,20 +8858,9 @@ async function handleGetFilesContext(args, ctx) {
         0
       );
       log(`Found ${totalChunks} total chunks`);
-      if (isSingleFile) {
-        const filepath = filepaths[0];
-        return {
-          indexInfo: getIndexMetadata(),
-          file: filepath,
-          chunks: filesData[filepath].chunks,
-          testAssociations: filesData[filepath].testAssociations
-        };
-      } else {
-        return {
-          indexInfo: getIndexMetadata(),
-          files: filesData
-        };
-      }
+      const note = buildScanLimitNote(hitScanLimit);
+      const indexInfo = getIndexMetadata();
+      return isSingleFile ? buildSingleFileResponse(filepaths[0], filesData, indexInfo, note) : buildMultiFileResponse(filesData, indexInfo, note);
     }
   )(args);
 }
@@ -9081,6 +9136,14 @@ async function handleGetDependents(args, ctx) {
       log(
         `Found ${analysis.dependents.length} dependent files (risk: ${riskLevel}${analysis.complexityMetrics.filesWithComplexityData > 0 ? ", complexity-boosted" : ""})`
       );
+      const notes = [];
+      const crossRepoFallback = crossRepo && !(vectorDB instanceof QdrantDB3);
+      if (crossRepoFallback) {
+        notes.push("Cross-repo search requires Qdrant backend. Fell back to single-repo search.");
+      }
+      if (analysis.hitLimit) {
+        notes.push("Scanned 10,000 chunks (limit reached). Results may be incomplete.");
+      }
       const response = {
         indexInfo: getIndexMetadata(),
         filepath: validatedArgs.filepath,
@@ -9088,7 +9151,7 @@ async function handleGetDependents(args, ctx) {
         riskLevel,
         dependents: analysis.dependents,
         complexityMetrics: analysis.complexityMetrics,
-        note: analysis.hitLimit ? `Warning: Scanned 10000 chunks (limit reached). Results may be incomplete.` : void 0
+        ...notes.length > 0 && { note: notes.join(" ") }
       };
       if (crossRepo && vectorDB instanceof QdrantDB3) {
         response.groupedByRepo = groupDependentsByRepo(analysis.dependents, analysis.allChunks);
@@ -9135,6 +9198,35 @@ function groupViolationsByRepo(violations, allChunks) {
   }
   return grouped;
 }
+async function fetchCrossRepoChunks(vectorDB, crossRepo, repoIds, log) {
+  if (!crossRepo) {
+    return { chunks: [], fallback: false };
+  }
+  if (vectorDB instanceof QdrantDB4) {
+    const chunks = await vectorDB.scanCrossRepo({ limit: 1e5, repoIds });
+    log(`Scanned ${chunks.length} chunks across repos`);
+    return { chunks, fallback: false };
+  }
+  return { chunks: [], fallback: true };
+}
+function processViolations(report, threshold, top) {
+  const allViolations = (0, import_collect.default)(Object.entries(report.files)).flatMap(
+    ([, fileData]) => fileData.violations.map((v) => transformViolation(v, fileData))
+  ).sortByDesc("complexity").all();
+  const violations = threshold !== void 0 ? allViolations.filter((v) => v.complexity >= threshold) : allViolations;
+  const severityCounts = (0, import_collect.default)(violations).countBy("severity").all();
+  return {
+    violations,
+    topViolations: violations.slice(0, top),
+    bySeverity: {
+      error: severityCounts["error"] || 0,
+      warning: severityCounts["warning"] || 0
+    }
+  };
+}
+function buildCrossRepoFallbackNote(fallback) {
+  return fallback ? "Cross-repo analysis requires Qdrant backend. Fell back to single-repo analysis." : void 0;
+}
 async function handleGetComplexity(args, ctx) {
   const { vectorDB, log, checkAndReconnect, getIndexMetadata } = ctx;
   return await wrapToolHandler(
@@ -9143,23 +9235,20 @@ async function handleGetComplexity(args, ctx) {
       const { crossRepo, repoIds, files, top, threshold } = validatedArgs;
       log(`Analyzing complexity${crossRepo ? " (cross-repo)" : ""}...`);
       await checkAndReconnect();
-      let allChunks = [];
-      if (crossRepo && vectorDB instanceof QdrantDB4) {
-        allChunks = await vectorDB.scanCrossRepo({
-          limit: 1e5,
-          repoIds
-        });
-        log(`Scanned ${allChunks.length} chunks across repos`);
-      }
+      const { chunks: allChunks, fallback } = await fetchCrossRepoChunks(
+        vectorDB,
+        crossRepo,
+        repoIds,
+        log
+      );
       const analyzer = new ComplexityAnalyzer(vectorDB);
-      const report = await analyzer.analyze(files, crossRepo && vectorDB instanceof QdrantDB4 ? crossRepo : false, repoIds);
+      const report = await analyzer.analyze(files, crossRepo && !fallback, repoIds);
       log(`Analyzed ${report.summary.filesAnalyzed} files`);
-      const allViolations = (0, import_collect.default)(Object.entries(report.files)).flatMap(
-        ([, fileData]) => fileData.violations.map((v) => transformViolation(v, fileData))
-      ).sortByDesc("complexity").all();
-      const violations = threshold !== void 0 ? allViolations.filter((v) => v.complexity >= threshold) : allViolations;
-      const topViolations = violations.slice(0, top);
-      const bySeverity = (0, import_collect.default)(violations).countBy("severity").all();
+      const { violations, topViolations, bySeverity } = processViolations(
+        report,
+        threshold,
+        top ?? 10
+      );
       const response = {
         indexInfo: getIndexMetadata(),
         summary: {
@@ -9167,17 +9256,17 @@ async function handleGetComplexity(args, ctx) {
           avgComplexity: report.summary.avgComplexity,
           maxComplexity: report.summary.maxComplexity,
           violationCount: violations.length,
-          bySeverity: {
-            error: bySeverity["error"] || 0,
-            warning: bySeverity["warning"] || 0
-          }
+          bySeverity
         },
         violations: topViolations
       };
-      if (crossRepo && vectorDB instanceof QdrantDB4 && allChunks.length > 0) {
+      if (crossRepo && !fallback && allChunks.length > 0) {
         response.groupedByRepo = groupViolationsByRepo(topViolations, allChunks);
-      } else if (crossRepo) {
+      }
+      const note = buildCrossRepoFallbackNote(fallback);
+      if (note) {
         log("Warning: crossRepo=true requires Qdrant backend. Falling back to single-repo analysis.", "warning");
+        response.note = note;
       }
       return response;
     }