npm - @sourcebot/mcp - Versions diffs - 1.0.16 → 1.0.18 - Mend

@sourcebot/mcp 1.0.16 → 1.0.18

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (13) hide show

package/CHANGELOG.md CHANGED Viewed

@@ -7,6 +7,21 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 ## [Unreleased]
+## [1.0.18] - 2026-02-28
+### Changed
+- Bumped `@modelcontextprotocol/sdk` from 1.10.2 to 1.26.0. [#958](https://github.com/sourcebot-dev/sourcebot/pull/958)
+- Bumped `zod` from `^3.24.3` to `^4.3.6`. [#964](https://github.com/sourcebot-dev/sourcebot/pull/964)
+## [1.0.17] - 2026-02-19
+### Added
+- Added optional `visibility` parameter to `ask_codebase` tool to allow controlling chat session visibility in shared environments. [#903](https://github.com/sourcebot-dev/sourcebot/pull/903)
+- Added `defaultBranch`, `isFork`, and `isArchived` fields to the `list_repos` tool response. [#905](https://github.com/sourcebot-dev/sourcebot/pull/905)
+### Changed
+- Changed `SOURCEBOT_HOST` to default to `http://localhost:3000` instead of `https://demo.sourcebot.dev`, which is now deprecated. [#906](https://github.com/sourcebot-dev/sourcebot/pull/906)
 ## [1.0.16] - 2026-02-10
 ### Added

package/README.md CHANGED Viewed

@@ -276,6 +276,7 @@ Ask a natural language question about the codebase. This tool uses an AI agent t
 | `query`         | yes      | The query to ask about the codebase.                                                                                                           |
 | `repos`         | no       | The repositories that are accessible to the agent during the chat. If not provided, all repositories are accessible.                           |
 | `languageModel` | no       | The language model to use for answering the question. Object with `provider` and `model`. If not provided, defaults to the first model in the config. Use `list_language_models` to see available options. |
+| `visibility`    | no       | The visibility of the chat session (`'PRIVATE'` or `'PUBLIC'`). Defaults to `PRIVATE` for authenticated users and `PUBLIC` for anonymous users. Set to `PUBLIC` to make the chat viewable by anyone with the link (useful in shared environments like Slack). |
 </details>

package/dist/client.d.ts CHANGED Viewed

@@ -24,7 +24,6 @@ export declare const search: (request: SearchRequest) => Promise<{
         flushReason: string;
     };
     files: {
-        webUrl: string;
         fileName: {
             text: string;
             matchRanges: {
@@ -40,10 +39,12 @@ export declare const search: (request: SearchRequest) => Promise<{
                 };
             }[];
         };
+        webUrl: string;
         repository: string;
         repositoryId: number;
         language: string;
         chunks: {
+            content: string;
             matchRanges: {
                 start: {
                     byteOffset: number;
@@ -56,7 +57,6 @@ export declare const search: (request: SearchRequest) => Promise<{
                     column: number;
                 };
             }[];
-            content: string;
             contentStart: {
                 byteOffset: number;
                 lineNumber: number;
@@ -72,8 +72,8 @@ export declare const search: (request: SearchRequest) => Promise<{
             }[] | undefined;
         }[];
         externalWebUrl?: string | undefined;
-        content?: string | undefined;
         branches?: string[] | undefined;
+        content?: string | undefined;
     }[];
     repositoryInfo: {
         id: number;
@@ -87,33 +87,36 @@ export declare const search: (request: SearchRequest) => Promise<{
 export declare const listRepos: (queryParams?: ListReposQueryParams) => Promise<{
     repos: {
         codeHostType: string;
-        webUrl: string;
         repoId: number;
         repoName: string;
-        externalWebUrl?: string | undefined;
+        webUrl: string;
+        isFork: boolean;
+        isArchived: boolean;
         repoDisplayName?: string | undefined;
+        externalWebUrl?: string | undefined;
         imageUrl?: string | undefined;
         indexedAt?: Date | undefined;
         pushedAt?: Date | undefined;
+        defaultBranch?: string | undefined;
     }[];
     totalCount: number;
 }>;
 export declare const getFileSource: (request: FileSourceRequest) => Promise<{
-    path: string;
-    webUrl: string;
+    source: string;
     language: string;
+    path: string;
     repo: string;
-    source: string;
     repoCodeHostType: string;
-    externalWebUrl?: string | undefined;
+    webUrl: string;
     repoDisplayName?: string | undefined;
     repoExternalWebUrl?: string | undefined;
+    externalWebUrl?: string | undefined;
 }>;
 export declare const listCommits: (queryParams: ListCommitsQueryParamsSchema) => Promise<{
     commits: {
-        message: string;
-        date: string;
         hash: string;
+        date: string;
+        message: string;
         refs: string;
         body: string;
         author_name: string;

package/dist/env.d.ts CHANGED Viewed

@@ -1,5 +1,5 @@
 import { z } from "zod";
-export declare const numberSchema: z.ZodNumber;
+export declare const numberSchema: z.ZodCoercedNumber<unknown>;
 export declare const env: Readonly<{
     SOURCEBOT_API_KEY?: string | undefined;
     SOURCEBOT_HOST: string;

package/dist/env.js CHANGED Viewed

@@ -1,10 +1,10 @@
 import { createEnv } from "@t3-oss/env-core";
 import { z } from "zod";
 export const numberSchema = z.coerce.number();
-const SOURCEBOT_DEMO_HOST = "https://demo.sourcebot.dev";
+const SOURCEBOT_DEFAULT_HOST = "http://localhost:3000";
 export const env = createEnv({
     server: {
-        SOURCEBOT_HOST: z.string().url().default(SOURCEBOT_DEMO_HOST),
+        SOURCEBOT_HOST: z.string().url().default(SOURCEBOT_DEFAULT_HOST),
         SOURCEBOT_API_KEY: z.string().optional(),
         // The minimum number of tokens to return
         DEFAULT_MINIMUM_TOKENS: numberSchema.default(10000),

package/dist/env.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"env.js","sourceRoot":"","sources":["../src/env.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;AAE9C,MAAM,~~mBAAmB~~,GAAG,~~4BAA4B~~,CAAC;~~AAEzD~~,MAAM,CAAC,MAAM,GAAG,GAAG,SAAS,CAAC;IACzB,MAAM,EAAE;QACJ,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,~~mBAAmB~~,CAAC;~~QAE7D~~,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAExC,yCAAyC;QACzC,sBAAsB,EAAE,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC;QAEnD,sDAAsD;QACtD,eAAe,EAAE,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC;QAE5C,yDAAyD;QACzD,qBAAqB,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;KACjD;IACD,UAAU,EAAE,OAAO,CAAC,GAAG;IACvB,sBAAsB,EAAE,IAAI;CAC/B,CAAC,CAAC","sourcesContent":["import { createEnv } from \"@t3-oss/env-core\";\nimport { z } from \"zod\";\n\nexport const numberSchema = z.coerce.number();\n\nconst ~~SOURCEBOT_DEMO_HOST~~ = \"~~https~~://~~demo.sourcebot.dev~~\";\n\nexport const env = createEnv({\n server: {\n SOURCEBOT_HOST: z.string().url().default(~~SOURCEBOT_DEMO_HOST~~),\n\n SOURCEBOT_API_KEY: z.string().optional(),\n\n // The minimum number of tokens to return\n DEFAULT_MINIMUM_TOKENS: numberSchema.default(10000),\n\n // The number of matches to fetch from the search API.\n DEFAULT_MATCHES: numberSchema.default(10000),\n\n // The number of lines to include above and below a match\n DEFAULT_CONTEXT_LINES: numberSchema.default(5),\n },\n runtimeEnv: process.env,\n emptyStringAsUndefined: true,\n});"]}
1	+ {"version":3,"file":"env.js","sourceRoot":"","sources":["../src/env.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;AAE9C,MAAM,sBAAsB,GAAG,uBAAuB,CAAC;AAEvD,MAAM,CAAC,MAAM,GAAG,GAAG,SAAS,CAAC;IACzB,MAAM,EAAE;QACJ,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC;QAEhE,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAExC,yCAAyC;QACzC,sBAAsB,EAAE,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC;QAEnD,sDAAsD;QACtD,eAAe,EAAE,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC;QAE5C,yDAAyD;QACzD,qBAAqB,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;KACjD;IACD,UAAU,EAAE,OAAO,CAAC,GAAG;IACvB,sBAAsB,EAAE,IAAI;CAC/B,CAAC,CAAC","sourcesContent":["import { createEnv } from \"@t3-oss/env-core\";\nimport { z } from \"zod\";\n\nexport const numberSchema = z.coerce.number();\n\nconst SOURCEBOT_DEFAULT_HOST = \"http://localhost:3000\";\n\nexport const env = createEnv({\n server: {\n SOURCEBOT_HOST: z.string().url().default(SOURCEBOT_DEFAULT_HOST),\n\n SOURCEBOT_API_KEY: z.string().optional(),\n\n // The minimum number of tokens to return\n DEFAULT_MINIMUM_TOKENS: numberSchema.default(10000),\n\n // The number of matches to fetch from the search API.\n DEFAULT_MATCHES: numberSchema.default(10000),\n\n // The number of lines to include above and below a match\n DEFAULT_CONTEXT_LINES: numberSchema.default(5),\n },\n runtimeEnv: process.env,\n emptyStringAsUndefined: true,\n});"]}

package/dist/index.js CHANGED Viewed

@@ -156,6 +156,9 @@ server.tool("list_repos", dedent `Lists repositories in the organization with op
                         name: repo.repoName,
                         url: repo.webUrl,
                         pushedAt: repo.pushedAt,
+                        defaultBranch: repo.defaultBranch,
+                        isFork: repo.isFork,
+                        isArchived: repo.isArchived,
                     })),
                     totalCount: result.totalCount,
                 })
@@ -311,6 +314,8 @@ server.tool("ask_codebase", dedent `
     Returns a detailed answer in markdown format with code references, plus a link to view the full research session (including all tool calls and reasoning) in the Sourcebot web UI.
+    When using this in shared environments (e.g., Slack), you can set the visibility parameter to 'PUBLIC' to ensure everyone can access the chat link.
     This is a blocking operation that may take 30-60+ seconds for complex questions as the agent researches the codebase.
     `, askCodebaseRequestSchema.shape, async (request) => {
     const response = await askCodebase(request);

package/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAEA,iCAAiC;AACjC,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,OAAO,MAAM,QAAQ,CAAC;AAC7B,OAAO,kBAAkB,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,EAAE,kBAAkB,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACvH,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,wBAAwB,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,4BAA4B,EAAE,0BAA0B,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAEtP,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAElG,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;AAE1D,oBAAoB;AACpB,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC;IACzB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,OAAO;CACnB,CAAC,CAAC;AAGH,MAAM,CAAC,IAAI,CACP,aAAa,EACb,MAAM,CAAA;;KAEL,EACD;IACI,KAAK,EAAE,CAAC;SACH,MAAM,EAAE;SACR,QAAQ,CAAC,wFAAwF,CAAC;QACnG,mEAAmE;QACnE,2DAA2D;SAC1D,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;QACf,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChE,OAAO,IAAI,OAAO,GAAG,CAAC;IAC1B,CAAC,CAAC;IACN,QAAQ,EAAE,CAAC;SACN,OAAO,EAAE;SACT,QAAQ,CAAC,sJAAsJ,CAAC;SAChK,QAAQ,EAAE;IACf,aAAa,EAAE,CAAC;SACX,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,CAAC,gDAAgD,CAAC;SAC1D,QAAQ,EAAE;IACf,iBAAiB,EAAE,CAAC;SACf,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,CAAC,6CAA6C,CAAC;SACvD,QAAQ,EAAE;IACf,iBAAiB,EAAE,CAAC;SACf,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,CAAC,6CAA6C,CAAC;SACvD,QAAQ,EAAE;IACf,aAAa,EAAE,CAAC;SACX,OAAO,EAAE;SACT,QAAQ,CAAC,+DAA+D,CAAC;SACzE,QAAQ,EAAE;IACf,mBAAmB,EAAE,CAAC;SACjB,OAAO,EAAE;SACT,QAAQ,CAAC,kJAAkJ,CAAC;SAC5J,QAAQ,EAAE;IACf,GAAG,EAAE,CAAC;SACD,MAAM,EAAE;SACR,QAAQ,CAAC,4HAA4H,CAAC;SACtI,QAAQ,EAAE;IACf,SAAS,EAAE,YAAY;SAClB,QAAQ,CAAC,oDAAoD,GAAG,CAAC,sBAAsB,mFAAmF,GAAG,CAAC,sBAAsB,mBAAmB,CAAC;SACxN,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,sBAAsB,CAAC,CAAC,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACzF,QAAQ,EAAE;CAClB,EACD,KAAK,EAAE,EACH,KAAK,EACL,aAAa,EAAE,KAAK,GAAG,EAAE,EACzB,iBAAiB,EAAE,SAAS,GAAG,EAAE,EACjC,iBAAiB,EAAE,SAAS,GAAG,EAAE,EACjC,SAAS,GAAG,GAAG,CAAC,sBAAsB,EACtC,mBAAmB,GAAG,KAAK,EAC3B,aAAa,GAAG,KAAK,EACrB,GAAG,EACH,QAAQ,GAAG,KAAK,GACnB,EAAE,EAAE;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnB,KAAK,IAAI,UAAU,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;IACpF,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,IAAI,UAAU,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;IACtD,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,IAAI,UAAU,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;IACpG,CAAC;IAED,IAAI,GAAG,EAAE,CAAC;QACN,KAAK,IAAI,UAAU,GAAG,IAAI,CAAC;IAC/B,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC;QAC1B,KAAK;QACL,OAAO,EAAE,GAAG,CAAC,eAAe;QAC5B,YAAY,EAAE,GAAG,CAAC,qBAAqB;QACvC,cAAc,EAAE,QAAQ;QACxB,wBAAwB,EAAE,aAAa;KAC1C,CAAC,CAAC;IAEH,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO;YACH,OAAO,EAAE,CAAC;oBACN,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,mCAAmC,KAAK,EAAE;iBACnD,CAAC;SACL,CAAC;IACN,CAAC;IAED,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,mBAAmB,GAAG,KAAK,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CACjC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,EAC9C,CAAC,CACJ,CAAC;QACF,IAAI,IAAI,GAAG,MAAM,CAAA;oBACT,IAAI,CAAC,MAAM;2BACJ,UAAU;oBACjB,IAAI,CAAC,UAAU;wBACX,IAAI,CAAC,QAAQ;aACxB,CAAC;QAEF,IAAI,mBAAmB,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACrC,OAAO,WAAW,KAAK,CAAC,OAAO,UAAU,CAAA;YAC7C,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACd,IAAI,IAAI,OAAO,QAAQ,EAAE,CAAC;QAC9B,CAAC;QAGD,qDAAqD;QACrD,0FAA0F;QAC1F,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAE/B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;YACrC,mCAAmC;YACnC,MAAM,eAAe,GAAG,SAAS,GAAG,WAAW,CAAC;YAEhD,IAAI,eAAe,GAAG,GAAG,EAAE,CAAC,CAAE,yCAAyC;gBACnE,2DAA2D;gBAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;gBAClD,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,+CAA+C,CAAC;gBAErG,OAAO,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,aAAa;iBACtB,CAAC,CAAC;gBAEH,WAAW,IAAI,eAAe,CAAC;YACnC,CAAC;YAED,mBAAmB,GAAG,IAAI,CAAC;YAC3B,MAAM;QACV,CAAC;QAED,WAAW,IAAI,MAAM,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,MAAM;YACZ,IAAI;SACP,CAAC,CAAC;IACP,CAAC;IAED,IAAI,mBAAmB,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,yFAAyF,SAAS,GAAG;SAC9G,CAAC,CAAC;IACP,CAAC;IAED,OAAO;QACH,OAAO;KACV,CAAA;AACL,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,cAAc,EACd,MAAM,CAAA,+CAA+C,EACrD,4BAA4B,CAAC,KAAK,EAClC,KAAK,EAAE,OAAqC,EAAE,EAAE;IAC5C,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,CAAC;IAE1C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC7C,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,YAAY,EACZ,MAAM,CAAA,gFAAgF,EACtF,0BAA0B,CAAC,KAAK,EAChC,KAAK,EAAE,OAA6B,EAAE,EAAE;IACpC,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,OAAO,CAAC,CAAC;IAExC,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBAC/B,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;wBAC/B,IAAI,EAAE,IAAI,CAAC,QAAQ;wBACnB,GAAG,EAAE,IAAI,CAAC,MAAM;wBAChB,QAAQ,EAAE,IAAI,CAAC,QAAQ;qBAC1B,CAAC,CAAC;oBACH,UAAU,EAAE,MAAM,CAAC,UAAU;iBAChC,CAAC;aACL,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,WAAW,EACX,MAAM,CAAA,yCAAyC,EAC/C,uBAAuB,CAAC,KAAK,EAC7B,KAAK,EAAE,OAA0B,EAAE,EAAE;IACjC,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,OAAO,CAAC,CAAC;IAE9C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBAC/B,MAAM,EAAE,QAAQ,CAAC,MAAM;oBACvB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;oBAC3B,IAAI,EAAE,QAAQ,CAAC,IAAI;oBACnB,GAAG,EAAE,QAAQ,CAAC,MAAM;iBACvB,CAAC;aACL,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,WAAW,EACX,MAAM,CAAA;;;KAGL,EACD,qBAAqB,CAAC,KAAK,EAC3B,KAAK,EAAE,EACH,IAAI,EACJ,IAAI,GAAG,EAAE,EACT,GAAG,GAAG,MAAM,EACZ,KAAK,GAAG,kBAAkB,EAC1B,YAAY,GAAG,IAAI,EACnB,kBAAkB,GAAG,IAAI,EACzB,UAAU,GAAG,wBAAwB,GACvB,EAAE,EAAE;IAClB,MAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;IACxD,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,oBAAoB,CAAC,CAAC;IAExE,IAAI,CAAC,YAAY,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACvC,OAAO;YACH,OAAO,EAAE,CAAC;oBACN,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;wBACjB,IAAI;wBACJ,GAAG;wBACH,IAAI,EAAE,cAAc;wBACpB,OAAO,EAAE,EAAqB;wBAC9B,aAAa,EAAE,CAAC;wBAChB,SAAS,EAAE,KAAK;qBACnB,CAAC;iBACL,CAAC;SACL,CAAC;IACN,CAAC;IAED,gFAAgF;IAChF,wEAAwE;IACxE,MAAM,KAAK,GAA2C,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAE3F,0DAA0D;IAC1D,2EAA2E;IAC3E,0EAA0E;IAC1E,qEAAqE;IACrE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;IAEtD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,wEAAwE;IACxE,uDAAuD;IACvD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC;QACrC,MAAM,iBAAiB,GAAa,EAAE,CAAC;QAEvC,kEAAkE;QAClE,oDAAoD;QACpD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,KAAK,YAAY,EAAE,CAAC;YAC1D,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC5B,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,uEAAuE;QACvE,MAAM,YAAY,GAAG,MAAM,QAAQ,CAAC;YAChC,QAAQ,EAAE,IAAI;YACd,YAAY,EAAE,GAAG;YACjB,KAAK,EAAE,iBAAiB,CAAC,MAAM,CAAC,OAAO,CAAC;SAC3C,CAAC,CAAC;QACH,MAAM,aAAa,GAAG,kBAAkB,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAE5D,KAAK,MAAM,WAAW,IAAI,iBAAiB,EAAE,CAAC;YAC1C,MAAM,WAAW,GAAG,WAAW,KAAK,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAC5F,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBAC9C,gEAAgE;gBAChE,sDAAsD;gBACtD,SAAS;YACb,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;gBACvC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACjD,+DAA+D;oBAC/D,sDAAsD;oBACtD,SAAS;gBACb,CAAC;gBAED,MAAM,SAAS,GAAG,YAAY,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;gBACxD,MAAM,UAAU,GAAG,YAAY,GAAG,CAAC,CAAC;gBAEpC,2DAA2D;gBAC3D,6CAA6C;gBAC7C,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,UAAU,GAAG,eAAe,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACvF,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;oBACnD,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC/B,CAAC;gBAED,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;oBAC7F,kDAAkD;oBAClD,2CAA2C;oBAC3C,SAAS;gBACb,CAAC;gBAED,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,EAAE,CAAC;gBACzC,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,4DAA4D;oBAC5D,gCAAgC;oBAChC,SAAS;gBACb,CAAC;gBACD,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAErB,sDAAsD;gBACtD,IAAI,OAAO,CAAC,MAAM,IAAI,oBAAoB,EAAE,CAAC;oBACzC,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM;gBACV,CAAC;gBAED,OAAO,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,IAAI,EAAE,SAAS;oBACf,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,UAAU,EAAE,WAAW;oBACvB,KAAK,EAAE,UAAU;iBACpB,CAAC,CAAC;YACP,CAAC;YAED,IAAI,SAAS,EAAE,CAAC;gBACZ,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,aAAa,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAE/C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACjB,IAAI;oBACJ,GAAG;oBACH,IAAI,EAAE,cAAc;oBACpB,OAAO,EAAE,aAAa;oBACtB,aAAa,EAAE,aAAa,CAAC,MAAM;oBACnC,SAAS;iBACZ,CAAC;aACL,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,sBAAsB,EACtB,MAAM,CAAA,yJAAyJ,EAC/J,EAAE,EACF,KAAK,IAAI,EAAE;IACP,MAAM,MAAM,GAAG,MAAM,kBAAkB,EAAE,CAAC;IAE1C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC/B,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,cAAc,EACd,MAAM,CAAA;;;;;;;;;;;KAWL,EACD,wBAAwB,CAAC,KAAK,EAC9B,KAAK,EAAE,OAA2B,EAAE,EAAE;IAClC,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,CAAC;IAE5C,6DAA6D;IAC7D,MAAM,iBAAiB,GAAG,MAAM,CAAA;UAC9B,QAAQ,CAAC,MAAM;;;0CAGiB,QAAQ,CAAC,OAAO;0BAChC,QAAQ,CAAC,aAAa,CAAC,KAAK;SAC7C,CAAC;IAEF,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,iBAAiB;aAC1B,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,SAAS,GAAG,KAAK,IAAI,EAAE;IACzB,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AACpC,CAAC,CAAA;AAED,SAAS,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;IACxB,OAAO,CAAC,KAAK,CAAC,6BAA6B,EAAE,KAAK,CAAC,CAAC;IACpD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC,CAAC","sourcesContent":["#!/usr/bin/env node\n\n// Entry point for the MCP server\nimport { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';\nimport _dedent from \"dedent\";\nimport escapeStringRegexp from 'escape-string-regexp';\nimport { z } from 'zod';\nimport { askCodebase, getFileSource, listCommits, listLanguageModels, listRepos, listTree, search } from './client.js';\nimport { env, numberSchema } from './env.js';\nimport { askCodebaseRequestSchema, DEFAULT_MAX_TREE_ENTRIES, DEFAULT_TREE_DEPTH, fileSourceRequestSchema, listCommitsQueryParamsSchema, listReposQueryParamsSchema, listTreeRequestSchema, MAX_MAX_TREE_ENTRIES, MAX_TREE_DEPTH } from './schemas.js';\nimport { AskCodebaseRequest, FileSourceRequest, ListCommitsQueryParamsSchema, ListReposQueryParams, ListTreeEntry, ListTreeRequest, TextContent } from './types.js';\nimport { buildTreeNodeIndex, joinTreePath, normalizeTreePath, sortTreeEntries } from './utils.js';\n\nconst dedent = _dedent.withOptions({ alignValues: true });\n\n// Create MCP server\nconst server = new McpServer({\n name: 'sourcebot-mcp-server',\n version: '0.1.0',\n});\n\n\nserver.tool(\n \"search_code\",\n dedent`\n Searches for code that matches the provided search query as a substring by default, or as a regular expression if useRegex is true. Useful for exploring remote repositories by searching for exact symbols, functions, variables, or specific code patterns. To determine if a repository is indexed, use the \\`list_repos\\` tool. By default, searches are global and will search the default branch of all repositories. Searches can be scoped to specific repositories, languages, and branches. When referencing code outputted by this tool, always include the file's external URL as a link. This makes it easier for the user to view the file, even if they don't have it locally checked out.\n `,\n {\n query: z\n .string()\n .describe(`The search pattern to match against code contents. Do not escape quotes in your query.`)\n // Escape backslashes first, then quotes, and wrap in double quotes\n // so the query is treated as a literal phrase (like grep).\n .transform((val) => {\n const escaped = val.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n return `\"${escaped}\"`;\n }),\n useRegex: z\n .boolean()\n .describe(`Whether to use regular expression matching to match the search query against code contents. When false, substring matching is used. (default: false)`)\n .optional(),\n filterByRepos: z\n .array(z.string())\n .describe(`Scope the search to the provided repositories.`)\n .optional(),\n filterByLanguages: z\n .array(z.string())\n .describe(`Scope the search to the provided languages.`)\n .optional(),\n filterByFilepaths: z\n .array(z.string())\n .describe(`Scope the search to the provided filepaths.`)\n .optional(),\n caseSensitive: z\n .boolean()\n .describe(`Whether the search should be case sensitive (default: false).`)\n .optional(),\n includeCodeSnippets: z\n .boolean()\n .describe(`Whether to include the code snippets in the response. If false, only the file's URL, repository, and language will be returned. (default: false)`)\n .optional(),\n ref: z\n .string()\n .describe(`Commit SHA, branch or tag name to search on. If not provided, defaults to the default branch (usually 'main' or 'master').`)\n .optional(),\n maxTokens: numberSchema\n .describe(`The maximum number of tokens to return (default: ${env.DEFAULT_MINIMUM_TOKENS}). Higher values provide more context but consume more tokens. Values less than ${env.DEFAULT_MINIMUM_TOKENS} will be ignored.`)\n .transform((val) => (val < env.DEFAULT_MINIMUM_TOKENS ? env.DEFAULT_MINIMUM_TOKENS : val))\n .optional(),\n },\n async ({\n query,\n filterByRepos: repos = [],\n filterByLanguages: languages = [],\n filterByFilepaths: filepaths = [],\n maxTokens = env.DEFAULT_MINIMUM_TOKENS,\n includeCodeSnippets = false,\n caseSensitive = false,\n ref,\n useRegex = false,\n }) => {\n if (repos.length > 0) {\n query += ` (repo:${repos.map(id => escapeStringRegexp(id)).join(' or repo:')})`;\n }\n\n if (languages.length > 0) {\n query += ` (lang:${languages.join(' or lang:')})`;\n }\n\n if (filepaths.length > 0) {\n query += ` (file:${filepaths.map(filepath => escapeStringRegexp(filepath)).join(' or file:')})`;\n }\n\n if (ref) {\n query += ` ( rev:${ref} )`;\n }\n\n const response = await search({\n query,\n matches: env.DEFAULT_MATCHES,\n contextLines: env.DEFAULT_CONTEXT_LINES,\n isRegexEnabled: useRegex,\n isCaseSensitivityEnabled: caseSensitive,\n });\n\n if (response.files.length === 0) {\n return {\n content: [{\n type: \"text\",\n text: `No results found for the query: ${query}`,\n }],\n };\n }\n\n const content: TextContent[] = [];\n let totalTokens = 0;\n let isResponseTruncated = false;\n\n for (const file of response.files) {\n const numMatches = file.chunks.reduce(\n (acc, chunk) => acc + chunk.matchRanges.length,\n 0,\n );\n let text = dedent`\n file: ${file.webUrl}\n num_matches: ${numMatches}\n repo: ${file.repository}\n language: ${file.language}\n `;\n\n if (includeCodeSnippets) {\n const snippets = file.chunks.map(chunk => {\n return `\\`\\`\\`\\n${chunk.content}\\n\\`\\`\\``\n }).join('\\n');\n text += `\\n\\n${snippets}`;\n }\n\n\n // Rough estimate of the number of tokens in the text\n // @see: https://help.openai.com/en/articles/4936856-what-are-tokens-and-how-to-count-them\n const tokens = text.length / 4;\n\n if ((totalTokens + tokens) > maxTokens) {\n // Calculate remaining token budget\n const remainingTokens = maxTokens - totalTokens;\n\n if (remainingTokens > 100) { // Only truncate if meaningful space left\n // Truncate text to fit remaining tokens (tokens ≈ chars/4)\n const maxLength = Math.floor(remainingTokens * 4);\n const truncatedText = text.substring(0, maxLength) + \"\\n\\n...[content truncated due to token limit]\";\n\n content.push({\n type: \"text\",\n text: truncatedText,\n });\n\n totalTokens += remainingTokens;\n }\n\n isResponseTruncated = true;\n break;\n }\n\n totalTokens += tokens;\n content.push({\n type: \"text\",\n text,\n });\n }\n\n if (isResponseTruncated) {\n content.push({\n type: \"text\",\n text: `The response was truncated because the number of tokens exceeded the maximum limit of ${maxTokens}.`,\n });\n }\n\n return {\n content,\n }\n }\n);\n\nserver.tool(\n \"list_commits\",\n dedent`Get a list of commits for a given repository.`,\n listCommitsQueryParamsSchema.shape,\n async (request: ListCommitsQueryParamsSchema) => {\n const result = await listCommits(request);\n\n return {\n content: [{\n type: \"text\", text: JSON.stringify(result)\n }],\n };\n }\n);\n\nserver.tool(\n \"list_repos\",\n dedent`Lists repositories in the organization with optional filtering and pagination.`,\n listReposQueryParamsSchema.shape,\n async (request: ListReposQueryParams) => {\n const result = await listRepos(request);\n\n return {\n content: [{\n type: \"text\", text: JSON.stringify({\n repos: result.repos.map((repo) => ({\n name: repo.repoName,\n url: repo.webUrl,\n pushedAt: repo.pushedAt,\n })),\n totalCount: result.totalCount,\n })\n }]\n };\n }\n);\n\nserver.tool(\n \"read_file\",\n dedent`Reads the source code for a given file.`,\n fileSourceRequestSchema.shape,\n async (request: FileSourceRequest) => {\n const response = await getFileSource(request);\n\n return {\n content: [{\n type: \"text\", text: JSON.stringify({\n source: response.source,\n language: response.language,\n path: response.path,\n url: response.webUrl,\n })\n }]\n };\n }\n);\n\nserver.tool(\n \"list_tree\",\n dedent`\n Lists files and directories from a repository path. This can be used as a repo tree tool or directory listing tool.\n Returns a flat list of entries with path metadata and depth relative to the requested path.\n `,\n listTreeRequestSchema.shape,\n async ({\n repo,\n path = '',\n ref = 'HEAD',\n depth = DEFAULT_TREE_DEPTH,\n includeFiles = true,\n includeDirectories = true,\n maxEntries = DEFAULT_MAX_TREE_ENTRIES,\n }: ListTreeRequest) => {\n const normalizedPath = normalizeTreePath(path);\n const normalizedDepth = Math.min(depth, MAX_TREE_DEPTH);\n const normalizedMaxEntries = Math.min(maxEntries, MAX_MAX_TREE_ENTRIES);\n\n if (!includeFiles && !includeDirectories) {\n return {\n content: [{\n type: \"text\",\n text: JSON.stringify({\n repo,\n ref,\n path: normalizedPath,\n entries: [] as ListTreeEntry[],\n totalReturned: 0,\n truncated: false,\n }),\n }],\n };\n }\n\n // BFS frontier of directories still to expand. Each item stores a repo-relative\n // directory path plus the current depth from the requested root `path`.\n const queue: Array<{ path: string; depth: number }> = [{ path: normalizedPath, depth: 0 }];\n\n // Tracks directory paths that have already been enqueued.\n // With the current single-root traversal duplicates are uncommon, but this\n // prevents duplicate expansion if we later support overlapping multi-root\n // inputs (e.g. [\"src\", \"src/lib\"]) or receive overlapping tree data.\n const queuedPaths = new Set<string>([normalizedPath]);\n\n const seenEntries = new Set<string>();\n const entries: ListTreeEntry[] = [];\n let truncated = false;\n\n // Traverse breadth-first by depth, batching all directories at the same\n // depth into a single /api/tree request per iteration.\n while (queue.length > 0 && !truncated) {\n const currentDepth = queue[0]!.depth;\n const currentLevelPaths: string[] = [];\n\n // Drain only the current depth level so we can issue one API call\n // for all sibling directories before moving deeper.\n while (queue.length > 0 && queue[0]!.depth === currentDepth) {\n const next = queue.shift()!;\n currentLevelPaths.push(next.path);\n }\n\n // Ask Sourcebot for a tree spanning all requested paths at this level.\n const treeResponse = await listTree({\n repoName: repo,\n revisionName: ref,\n paths: currentLevelPaths.filter(Boolean),\n });\n const treeNodeIndex = buildTreeNodeIndex(treeResponse.tree);\n\n for (const currentPath of currentLevelPaths) {\n const currentNode = currentPath === '' ? treeResponse.tree : treeNodeIndex.get(currentPath);\n if (!currentNode \|\| currentNode.type !== 'tree') {\n // Skip paths that are missing from the response or resolve to a\n // file node. We only iterate children of directories.\n continue;\n }\n\n for (const child of currentNode.children) {\n if (child.type !== 'tree' && child.type !== 'blob') {\n // Skip non-standard git object types (e.g. unexpected entries)\n // since this tool only exposes directories and files.\n continue;\n }\n\n const childPath = joinTreePath(currentPath, child.name);\n const childDepth = currentDepth + 1;\n\n // Queue child directories for the next depth level only if\n // they are within the requested depth bound.\n if (child.type === 'tree' && childDepth < normalizedDepth && !queuedPaths.has(childPath)) {\n queue.push({ path: childPath, depth: childDepth });\n queuedPaths.add(childPath);\n }\n\n if ((child.type === 'blob' && !includeFiles) \|\| (child.type === 'tree' && !includeDirectories)) {\n // Skip entries filtered out by caller preferences\n // (`includeFiles` / `includeDirectories`).\n continue;\n }\n\n const key = `${child.type}:${childPath}`;\n if (seenEntries.has(key)) {\n // Skip duplicates when multiple requested paths overlap and\n // surface the same child entry.\n continue;\n }\n seenEntries.add(key);\n\n // Stop collecting once the entry budget is exhausted.\n if (entries.length >= normalizedMaxEntries) {\n truncated = true;\n break;\n }\n\n entries.push({\n type: child.type,\n path: childPath,\n name: child.name,\n parentPath: currentPath,\n depth: childDepth,\n });\n }\n\n if (truncated) {\n break;\n }\n }\n }\n\n const sortedEntries = sortTreeEntries(entries);\n\n return {\n content: [{\n type: \"text\",\n text: JSON.stringify({\n repo,\n ref,\n path: normalizedPath,\n entries: sortedEntries,\n totalReturned: sortedEntries.length,\n truncated,\n }),\n }]\n };\n }\n);\n\nserver.tool(\n \"list_language_models\",\n dedent`Lists the available language models configured on the Sourcebot instance. Use this to discover which models can be specified when calling ask_codebase.`,\n {},\n async () => {\n const models = await listLanguageModels();\n\n return {\n content: [{\n type: \"text\",\n text: JSON.stringify(models),\n }],\n };\n }\n);\n\nserver.tool(\n \"ask_codebase\",\n dedent`\n Ask a natural language question about the codebase. This tool uses an AI agent to autonomously search code, read files, and find symbol references/definitions to answer your question.\n\n The agent will:\n - Analyze your question and determine what context it needs\n - Search the codebase using multiple strategies (code search, symbol lookup, file reading)\n - Synthesize findings into a comprehensive answer with code references\n\n Returns a detailed answer in markdown format with code references, plus a link to view the full research session (including all tool calls and reasoning) in the Sourcebot web UI.\n\n This is a blocking operation that may take 30-60+ seconds for complex questions as the agent researches the codebase.\n `,\n askCodebaseRequestSchema.shape,\n async (request: AskCodebaseRequest) => {\n const response = await askCodebase(request);\n\n // Format the response with the answer and a link to the chat\n const formattedResponse = dedent`\n ${response.answer}\n\n ---\n View full research session: ${response.chatUrl}\n Model used: ${response.languageModel.model}\n `;\n\n return {\n content: [{\n type: \"text\",\n text: formattedResponse,\n }],\n };\n }\n);\n\nconst runServer = async () => {\n const transport = new StdioServerTransport();\n await server.connect(transport);\n}\n\nrunServer().catch((error) => {\n console.error('Failed to start MCP server:', error);\n process.exit(1);\n});\n"]}
1	+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAEA,iCAAiC;AACjC,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,OAAO,MAAM,QAAQ,CAAC;AAC7B,OAAO,kBAAkB,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,EAAE,kBAAkB,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACvH,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,wBAAwB,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,4BAA4B,EAAE,0BAA0B,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAEtP,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAElG,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;AAE1D,oBAAoB;AACpB,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC;IACzB,IAAI,EAAE,sBAAsB;IAC5B,OAAO,EAAE,OAAO;CACnB,CAAC,CAAC;AAGH,MAAM,CAAC,IAAI,CACP,aAAa,EACb,MAAM,CAAA;;KAEL,EACD;IACI,KAAK,EAAE,CAAC;SACH,MAAM,EAAE;SACR,QAAQ,CAAC,wFAAwF,CAAC;QACnG,mEAAmE;QACnE,2DAA2D;SAC1D,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;QACf,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChE,OAAO,IAAI,OAAO,GAAG,CAAC;IAC1B,CAAC,CAAC;IACN,QAAQ,EAAE,CAAC;SACN,OAAO,EAAE;SACT,QAAQ,CAAC,sJAAsJ,CAAC;SAChK,QAAQ,EAAE;IACf,aAAa,EAAE,CAAC;SACX,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,CAAC,gDAAgD,CAAC;SAC1D,QAAQ,EAAE;IACf,iBAAiB,EAAE,CAAC;SACf,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,CAAC,6CAA6C,CAAC;SACvD,QAAQ,EAAE;IACf,iBAAiB,EAAE,CAAC;SACf,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,CAAC,6CAA6C,CAAC;SACvD,QAAQ,EAAE;IACf,aAAa,EAAE,CAAC;SACX,OAAO,EAAE;SACT,QAAQ,CAAC,+DAA+D,CAAC;SACzE,QAAQ,EAAE;IACf,mBAAmB,EAAE,CAAC;SACjB,OAAO,EAAE;SACT,QAAQ,CAAC,kJAAkJ,CAAC;SAC5J,QAAQ,EAAE;IACf,GAAG,EAAE,CAAC;SACD,MAAM,EAAE;SACR,QAAQ,CAAC,4HAA4H,CAAC;SACtI,QAAQ,EAAE;IACf,SAAS,EAAE,YAAY;SAClB,QAAQ,CAAC,oDAAoD,GAAG,CAAC,sBAAsB,mFAAmF,GAAG,CAAC,sBAAsB,mBAAmB,CAAC;SACxN,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,sBAAsB,CAAC,CAAC,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACzF,QAAQ,EAAE;CAClB,EACD,KAAK,EAAE,EACH,KAAK,EACL,aAAa,EAAE,KAAK,GAAG,EAAE,EACzB,iBAAiB,EAAE,SAAS,GAAG,EAAE,EACjC,iBAAiB,EAAE,SAAS,GAAG,EAAE,EACjC,SAAS,GAAG,GAAG,CAAC,sBAAsB,EACtC,mBAAmB,GAAG,KAAK,EAC3B,aAAa,GAAG,KAAK,EACrB,GAAG,EACH,QAAQ,GAAG,KAAK,GACnB,EAAE,EAAE;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnB,KAAK,IAAI,UAAU,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;IACpF,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,IAAI,UAAU,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;IACtD,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,IAAI,UAAU,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;IACpG,CAAC;IAED,IAAI,GAAG,EAAE,CAAC;QACN,KAAK,IAAI,UAAU,GAAG,IAAI,CAAC;IAC/B,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC;QAC1B,KAAK;QACL,OAAO,EAAE,GAAG,CAAC,eAAe;QAC5B,YAAY,EAAE,GAAG,CAAC,qBAAqB;QACvC,cAAc,EAAE,QAAQ;QACxB,wBAAwB,EAAE,aAAa;KAC1C,CAAC,CAAC;IAEH,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO;YACH,OAAO,EAAE,CAAC;oBACN,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,mCAAmC,KAAK,EAAE;iBACnD,CAAC;SACL,CAAC;IACN,CAAC;IAED,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,mBAAmB,GAAG,KAAK,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CACjC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,EAC9C,CAAC,CACJ,CAAC;QACF,IAAI,IAAI,GAAG,MAAM,CAAA;oBACT,IAAI,CAAC,MAAM;2BACJ,UAAU;oBACjB,IAAI,CAAC,UAAU;wBACX,IAAI,CAAC,QAAQ;aACxB,CAAC;QAEF,IAAI,mBAAmB,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACrC,OAAO,WAAW,KAAK,CAAC,OAAO,UAAU,CAAA;YAC7C,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACd,IAAI,IAAI,OAAO,QAAQ,EAAE,CAAC;QAC9B,CAAC;QAGD,qDAAqD;QACrD,0FAA0F;QAC1F,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAE/B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;YACrC,mCAAmC;YACnC,MAAM,eAAe,GAAG,SAAS,GAAG,WAAW,CAAC;YAEhD,IAAI,eAAe,GAAG,GAAG,EAAE,CAAC,CAAE,yCAAyC;gBACnE,2DAA2D;gBAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;gBAClD,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,+CAA+C,CAAC;gBAErG,OAAO,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,aAAa;iBACtB,CAAC,CAAC;gBAEH,WAAW,IAAI,eAAe,CAAC;YACnC,CAAC;YAED,mBAAmB,GAAG,IAAI,CAAC;YAC3B,MAAM;QACV,CAAC;QAED,WAAW,IAAI,MAAM,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,MAAM;YACZ,IAAI;SACP,CAAC,CAAC;IACP,CAAC;IAED,IAAI,mBAAmB,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,yFAAyF,SAAS,GAAG;SAC9G,CAAC,CAAC;IACP,CAAC;IAED,OAAO;QACH,OAAO;KACV,CAAA;AACL,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,cAAc,EACd,MAAM,CAAA,+CAA+C,EACrD,4BAA4B,CAAC,KAAK,EAClC,KAAK,EAAE,OAAqC,EAAE,EAAE;IAC5C,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,CAAC;IAE1C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC7C,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,YAAY,EACZ,MAAM,CAAA,gFAAgF,EACtF,0BAA0B,CAAC,KAAK,EAChC,KAAK,EAAE,OAA6B,EAAE,EAAE;IACpC,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,OAAO,CAAC,CAAC;IAExC,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBAC/B,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;wBAC/B,IAAI,EAAE,IAAI,CAAC,QAAQ;wBACnB,GAAG,EAAE,IAAI,CAAC,MAAM;wBAChB,QAAQ,EAAE,IAAI,CAAC,QAAQ;wBACvB,aAAa,EAAE,IAAI,CAAC,aAAa;wBACjC,MAAM,EAAE,IAAI,CAAC,MAAM;wBACnB,UAAU,EAAE,IAAI,CAAC,UAAU;qBAC9B,CAAC,CAAC;oBACH,UAAU,EAAE,MAAM,CAAC,UAAU;iBAChC,CAAC;aACL,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,WAAW,EACX,MAAM,CAAA,yCAAyC,EAC/C,uBAAuB,CAAC,KAAK,EAC7B,KAAK,EAAE,OAA0B,EAAE,EAAE;IACjC,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,OAAO,CAAC,CAAC;IAE9C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBAC/B,MAAM,EAAE,QAAQ,CAAC,MAAM;oBACvB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;oBAC3B,IAAI,EAAE,QAAQ,CAAC,IAAI;oBACnB,GAAG,EAAE,QAAQ,CAAC,MAAM;iBACvB,CAAC;aACL,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,WAAW,EACX,MAAM,CAAA;;;KAGL,EACD,qBAAqB,CAAC,KAAK,EAC3B,KAAK,EAAE,EACH,IAAI,EACJ,IAAI,GAAG,EAAE,EACT,GAAG,GAAG,MAAM,EACZ,KAAK,GAAG,kBAAkB,EAC1B,YAAY,GAAG,IAAI,EACnB,kBAAkB,GAAG,IAAI,EACzB,UAAU,GAAG,wBAAwB,GACvB,EAAE,EAAE;IAClB,MAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;IACxD,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,oBAAoB,CAAC,CAAC;IAExE,IAAI,CAAC,YAAY,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACvC,OAAO;YACH,OAAO,EAAE,CAAC;oBACN,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;wBACjB,IAAI;wBACJ,GAAG;wBACH,IAAI,EAAE,cAAc;wBACpB,OAAO,EAAE,EAAqB;wBAC9B,aAAa,EAAE,CAAC;wBAChB,SAAS,EAAE,KAAK;qBACnB,CAAC;iBACL,CAAC;SACL,CAAC;IACN,CAAC;IAED,gFAAgF;IAChF,wEAAwE;IACxE,MAAM,KAAK,GAA2C,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAE3F,0DAA0D;IAC1D,2EAA2E;IAC3E,0EAA0E;IAC1E,qEAAqE;IACrE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;IAEtD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,wEAAwE;IACxE,uDAAuD;IACvD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC;QACrC,MAAM,iBAAiB,GAAa,EAAE,CAAC;QAEvC,kEAAkE;QAClE,oDAAoD;QACpD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,KAAK,YAAY,EAAE,CAAC;YAC1D,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC5B,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,uEAAuE;QACvE,MAAM,YAAY,GAAG,MAAM,QAAQ,CAAC;YAChC,QAAQ,EAAE,IAAI;YACd,YAAY,EAAE,GAAG;YACjB,KAAK,EAAE,iBAAiB,CAAC,MAAM,CAAC,OAAO,CAAC;SAC3C,CAAC,CAAC;QACH,MAAM,aAAa,GAAG,kBAAkB,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAE5D,KAAK,MAAM,WAAW,IAAI,iBAAiB,EAAE,CAAC;YAC1C,MAAM,WAAW,GAAG,WAAW,KAAK,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAC5F,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBAC9C,gEAAgE;gBAChE,sDAAsD;gBACtD,SAAS;YACb,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;gBACvC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACjD,+DAA+D;oBAC/D,sDAAsD;oBACtD,SAAS;gBACb,CAAC;gBAED,MAAM,SAAS,GAAG,YAAY,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;gBACxD,MAAM,UAAU,GAAG,YAAY,GAAG,CAAC,CAAC;gBAEpC,2DAA2D;gBAC3D,6CAA6C;gBAC7C,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,UAAU,GAAG,eAAe,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACvF,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;oBACnD,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC/B,CAAC;gBAED,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;oBAC7F,kDAAkD;oBAClD,2CAA2C;oBAC3C,SAAS;gBACb,CAAC;gBAED,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,EAAE,CAAC;gBACzC,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,4DAA4D;oBAC5D,gCAAgC;oBAChC,SAAS;gBACb,CAAC;gBACD,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAErB,sDAAsD;gBACtD,IAAI,OAAO,CAAC,MAAM,IAAI,oBAAoB,EAAE,CAAC;oBACzC,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM;gBACV,CAAC;gBAED,OAAO,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,IAAI,EAAE,SAAS;oBACf,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,UAAU,EAAE,WAAW;oBACvB,KAAK,EAAE,UAAU;iBACpB,CAAC,CAAC;YACP,CAAC;YAED,IAAI,SAAS,EAAE,CAAC;gBACZ,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,aAAa,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAE/C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACjB,IAAI;oBACJ,GAAG;oBACH,IAAI,EAAE,cAAc;oBACpB,OAAO,EAAE,aAAa;oBACtB,aAAa,EAAE,aAAa,CAAC,MAAM;oBACnC,SAAS;iBACZ,CAAC;aACL,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,sBAAsB,EACtB,MAAM,CAAA,yJAAyJ,EAC/J,EAAE,EACF,KAAK,IAAI,EAAE;IACP,MAAM,MAAM,GAAG,MAAM,kBAAkB,EAAE,CAAC;IAE1C,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC/B,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,CAAC,IAAI,CACP,cAAc,EACd,MAAM,CAAA;;;;;;;;;;;;;KAaL,EACD,wBAAwB,CAAC,KAAK,EAC9B,KAAK,EAAE,OAA2B,EAAE,EAAE;IAClC,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,CAAC;IAE5C,6DAA6D;IAC7D,MAAM,iBAAiB,GAAG,MAAM,CAAA;UAC9B,QAAQ,CAAC,MAAM;;;0CAGiB,QAAQ,CAAC,OAAO;0BAChC,QAAQ,CAAC,aAAa,CAAC,KAAK;SAC7C,CAAC;IAEF,OAAO;QACH,OAAO,EAAE,CAAC;gBACN,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,iBAAiB;aAC1B,CAAC;KACL,CAAC;AACN,CAAC,CACJ,CAAC;AAEF,MAAM,SAAS,GAAG,KAAK,IAAI,EAAE;IACzB,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AACpC,CAAC,CAAA;AAED,SAAS,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;IACxB,OAAO,CAAC,KAAK,CAAC,6BAA6B,EAAE,KAAK,CAAC,CAAC;IACpD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC,CAAC","sourcesContent":["#!/usr/bin/env node\n\n// Entry point for the MCP server\nimport { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';\nimport _dedent from \"dedent\";\nimport escapeStringRegexp from 'escape-string-regexp';\nimport { z } from 'zod';\nimport { askCodebase, getFileSource, listCommits, listLanguageModels, listRepos, listTree, search } from './client.js';\nimport { env, numberSchema } from './env.js';\nimport { askCodebaseRequestSchema, DEFAULT_MAX_TREE_ENTRIES, DEFAULT_TREE_DEPTH, fileSourceRequestSchema, listCommitsQueryParamsSchema, listReposQueryParamsSchema, listTreeRequestSchema, MAX_MAX_TREE_ENTRIES, MAX_TREE_DEPTH } from './schemas.js';\nimport { AskCodebaseRequest, FileSourceRequest, ListCommitsQueryParamsSchema, ListReposQueryParams, ListTreeEntry, ListTreeRequest, TextContent } from './types.js';\nimport { buildTreeNodeIndex, joinTreePath, normalizeTreePath, sortTreeEntries } from './utils.js';\n\nconst dedent = _dedent.withOptions({ alignValues: true });\n\n// Create MCP server\nconst server = new McpServer({\n name: 'sourcebot-mcp-server',\n version: '0.1.0',\n});\n\n\nserver.tool(\n \"search_code\",\n dedent`\n Searches for code that matches the provided search query as a substring by default, or as a regular expression if useRegex is true. Useful for exploring remote repositories by searching for exact symbols, functions, variables, or specific code patterns. To determine if a repository is indexed, use the \\`list_repos\\` tool. By default, searches are global and will search the default branch of all repositories. Searches can be scoped to specific repositories, languages, and branches. When referencing code outputted by this tool, always include the file's external URL as a link. This makes it easier for the user to view the file, even if they don't have it locally checked out.\n `,\n {\n query: z\n .string()\n .describe(`The search pattern to match against code contents. Do not escape quotes in your query.`)\n // Escape backslashes first, then quotes, and wrap in double quotes\n // so the query is treated as a literal phrase (like grep).\n .transform((val) => {\n const escaped = val.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n return `\"${escaped}\"`;\n }),\n useRegex: z\n .boolean()\n .describe(`Whether to use regular expression matching to match the search query against code contents. When false, substring matching is used. (default: false)`)\n .optional(),\n filterByRepos: z\n .array(z.string())\n .describe(`Scope the search to the provided repositories.`)\n .optional(),\n filterByLanguages: z\n .array(z.string())\n .describe(`Scope the search to the provided languages.`)\n .optional(),\n filterByFilepaths: z\n .array(z.string())\n .describe(`Scope the search to the provided filepaths.`)\n .optional(),\n caseSensitive: z\n .boolean()\n .describe(`Whether the search should be case sensitive (default: false).`)\n .optional(),\n includeCodeSnippets: z\n .boolean()\n .describe(`Whether to include the code snippets in the response. If false, only the file's URL, repository, and language will be returned. (default: false)`)\n .optional(),\n ref: z\n .string()\n .describe(`Commit SHA, branch or tag name to search on. If not provided, defaults to the default branch (usually 'main' or 'master').`)\n .optional(),\n maxTokens: numberSchema\n .describe(`The maximum number of tokens to return (default: ${env.DEFAULT_MINIMUM_TOKENS}). Higher values provide more context but consume more tokens. Values less than ${env.DEFAULT_MINIMUM_TOKENS} will be ignored.`)\n .transform((val) => (val < env.DEFAULT_MINIMUM_TOKENS ? env.DEFAULT_MINIMUM_TOKENS : val))\n .optional(),\n },\n async ({\n query,\n filterByRepos: repos = [],\n filterByLanguages: languages = [],\n filterByFilepaths: filepaths = [],\n maxTokens = env.DEFAULT_MINIMUM_TOKENS,\n includeCodeSnippets = false,\n caseSensitive = false,\n ref,\n useRegex = false,\n }) => {\n if (repos.length > 0) {\n query += ` (repo:${repos.map(id => escapeStringRegexp(id)).join(' or repo:')})`;\n }\n\n if (languages.length > 0) {\n query += ` (lang:${languages.join(' or lang:')})`;\n }\n\n if (filepaths.length > 0) {\n query += ` (file:${filepaths.map(filepath => escapeStringRegexp(filepath)).join(' or file:')})`;\n }\n\n if (ref) {\n query += ` ( rev:${ref} )`;\n }\n\n const response = await search({\n query,\n matches: env.DEFAULT_MATCHES,\n contextLines: env.DEFAULT_CONTEXT_LINES,\n isRegexEnabled: useRegex,\n isCaseSensitivityEnabled: caseSensitive,\n });\n\n if (response.files.length === 0) {\n return {\n content: [{\n type: \"text\",\n text: `No results found for the query: ${query}`,\n }],\n };\n }\n\n const content: TextContent[] = [];\n let totalTokens = 0;\n let isResponseTruncated = false;\n\n for (const file of response.files) {\n const numMatches = file.chunks.reduce(\n (acc, chunk) => acc + chunk.matchRanges.length,\n 0,\n );\n let text = dedent`\n file: ${file.webUrl}\n num_matches: ${numMatches}\n repo: ${file.repository}\n language: ${file.language}\n `;\n\n if (includeCodeSnippets) {\n const snippets = file.chunks.map(chunk => {\n return `\\`\\`\\`\\n${chunk.content}\\n\\`\\`\\``\n }).join('\\n');\n text += `\\n\\n${snippets}`;\n }\n\n\n // Rough estimate of the number of tokens in the text\n // @see: https://help.openai.com/en/articles/4936856-what-are-tokens-and-how-to-count-them\n const tokens = text.length / 4;\n\n if ((totalTokens + tokens) > maxTokens) {\n // Calculate remaining token budget\n const remainingTokens = maxTokens - totalTokens;\n\n if (remainingTokens > 100) { // Only truncate if meaningful space left\n // Truncate text to fit remaining tokens (tokens ≈ chars/4)\n const maxLength = Math.floor(remainingTokens * 4);\n const truncatedText = text.substring(0, maxLength) + \"\\n\\n...[content truncated due to token limit]\";\n\n content.push({\n type: \"text\",\n text: truncatedText,\n });\n\n totalTokens += remainingTokens;\n }\n\n isResponseTruncated = true;\n break;\n }\n\n totalTokens += tokens;\n content.push({\n type: \"text\",\n text,\n });\n }\n\n if (isResponseTruncated) {\n content.push({\n type: \"text\",\n text: `The response was truncated because the number of tokens exceeded the maximum limit of ${maxTokens}.`,\n });\n }\n\n return {\n content,\n }\n }\n);\n\nserver.tool(\n \"list_commits\",\n dedent`Get a list of commits for a given repository.`,\n listCommitsQueryParamsSchema.shape,\n async (request: ListCommitsQueryParamsSchema) => {\n const result = await listCommits(request);\n\n return {\n content: [{\n type: \"text\", text: JSON.stringify(result)\n }],\n };\n }\n);\n\nserver.tool(\n \"list_repos\",\n dedent`Lists repositories in the organization with optional filtering and pagination.`,\n listReposQueryParamsSchema.shape,\n async (request: ListReposQueryParams) => {\n const result = await listRepos(request);\n\n return {\n content: [{\n type: \"text\", text: JSON.stringify({\n repos: result.repos.map((repo) => ({\n name: repo.repoName,\n url: repo.webUrl,\n pushedAt: repo.pushedAt,\n defaultBranch: repo.defaultBranch,\n isFork: repo.isFork,\n isArchived: repo.isArchived,\n })),\n totalCount: result.totalCount,\n })\n }]\n };\n }\n);\n\nserver.tool(\n \"read_file\",\n dedent`Reads the source code for a given file.`,\n fileSourceRequestSchema.shape,\n async (request: FileSourceRequest) => {\n const response = await getFileSource(request);\n\n return {\n content: [{\n type: \"text\", text: JSON.stringify({\n source: response.source,\n language: response.language,\n path: response.path,\n url: response.webUrl,\n })\n }]\n };\n }\n);\n\nserver.tool(\n \"list_tree\",\n dedent`\n Lists files and directories from a repository path. This can be used as a repo tree tool or directory listing tool.\n Returns a flat list of entries with path metadata and depth relative to the requested path.\n `,\n listTreeRequestSchema.shape,\n async ({\n repo,\n path = '',\n ref = 'HEAD',\n depth = DEFAULT_TREE_DEPTH,\n includeFiles = true,\n includeDirectories = true,\n maxEntries = DEFAULT_MAX_TREE_ENTRIES,\n }: ListTreeRequest) => {\n const normalizedPath = normalizeTreePath(path);\n const normalizedDepth = Math.min(depth, MAX_TREE_DEPTH);\n const normalizedMaxEntries = Math.min(maxEntries, MAX_MAX_TREE_ENTRIES);\n\n if (!includeFiles && !includeDirectories) {\n return {\n content: [{\n type: \"text\",\n text: JSON.stringify({\n repo,\n ref,\n path: normalizedPath,\n entries: [] as ListTreeEntry[],\n totalReturned: 0,\n truncated: false,\n }),\n }],\n };\n }\n\n // BFS frontier of directories still to expand. Each item stores a repo-relative\n // directory path plus the current depth from the requested root `path`.\n const queue: Array<{ path: string; depth: number }> = [{ path: normalizedPath, depth: 0 }];\n\n // Tracks directory paths that have already been enqueued.\n // With the current single-root traversal duplicates are uncommon, but this\n // prevents duplicate expansion if we later support overlapping multi-root\n // inputs (e.g. [\"src\", \"src/lib\"]) or receive overlapping tree data.\n const queuedPaths = new Set<string>([normalizedPath]);\n\n const seenEntries = new Set<string>();\n const entries: ListTreeEntry[] = [];\n let truncated = false;\n\n // Traverse breadth-first by depth, batching all directories at the same\n // depth into a single /api/tree request per iteration.\n while (queue.length > 0 && !truncated) {\n const currentDepth = queue[0]!.depth;\n const currentLevelPaths: string[] = [];\n\n // Drain only the current depth level so we can issue one API call\n // for all sibling directories before moving deeper.\n while (queue.length > 0 && queue[0]!.depth === currentDepth) {\n const next = queue.shift()!;\n currentLevelPaths.push(next.path);\n }\n\n // Ask Sourcebot for a tree spanning all requested paths at this level.\n const treeResponse = await listTree({\n repoName: repo,\n revisionName: ref,\n paths: currentLevelPaths.filter(Boolean),\n });\n const treeNodeIndex = buildTreeNodeIndex(treeResponse.tree);\n\n for (const currentPath of currentLevelPaths) {\n const currentNode = currentPath === '' ? treeResponse.tree : treeNodeIndex.get(currentPath);\n if (!currentNode \|\| currentNode.type !== 'tree') {\n // Skip paths that are missing from the response or resolve to a\n // file node. We only iterate children of directories.\n continue;\n }\n\n for (const child of currentNode.children) {\n if (child.type !== 'tree' && child.type !== 'blob') {\n // Skip non-standard git object types (e.g. unexpected entries)\n // since this tool only exposes directories and files.\n continue;\n }\n\n const childPath = joinTreePath(currentPath, child.name);\n const childDepth = currentDepth + 1;\n\n // Queue child directories for the next depth level only if\n // they are within the requested depth bound.\n if (child.type === 'tree' && childDepth < normalizedDepth && !queuedPaths.has(childPath)) {\n queue.push({ path: childPath, depth: childDepth });\n queuedPaths.add(childPath);\n }\n\n if ((child.type === 'blob' && !includeFiles) \|\| (child.type === 'tree' && !includeDirectories)) {\n // Skip entries filtered out by caller preferences\n // (`includeFiles` / `includeDirectories`).\n continue;\n }\n\n const key = `${child.type}:${childPath}`;\n if (seenEntries.has(key)) {\n // Skip duplicates when multiple requested paths overlap and\n // surface the same child entry.\n continue;\n }\n seenEntries.add(key);\n\n // Stop collecting once the entry budget is exhausted.\n if (entries.length >= normalizedMaxEntries) {\n truncated = true;\n break;\n }\n\n entries.push({\n type: child.type,\n path: childPath,\n name: child.name,\n parentPath: currentPath,\n depth: childDepth,\n });\n }\n\n if (truncated) {\n break;\n }\n }\n }\n\n const sortedEntries = sortTreeEntries(entries);\n\n return {\n content: [{\n type: \"text\",\n text: JSON.stringify({\n repo,\n ref,\n path: normalizedPath,\n entries: sortedEntries,\n totalReturned: sortedEntries.length,\n truncated,\n }),\n }]\n };\n }\n);\n\nserver.tool(\n \"list_language_models\",\n dedent`Lists the available language models configured on the Sourcebot instance. Use this to discover which models can be specified when calling ask_codebase.`,\n {},\n async () => {\n const models = await listLanguageModels();\n\n return {\n content: [{\n type: \"text\",\n text: JSON.stringify(models),\n }],\n };\n }\n);\n\nserver.tool(\n \"ask_codebase\",\n dedent`\n Ask a natural language question about the codebase. This tool uses an AI agent to autonomously search code, read files, and find symbol references/definitions to answer your question.\n\n The agent will:\n - Analyze your question and determine what context it needs\n - Search the codebase using multiple strategies (code search, symbol lookup, file reading)\n - Synthesize findings into a comprehensive answer with code references\n\n Returns a detailed answer in markdown format with code references, plus a link to view the full research session (including all tool calls and reasoning) in the Sourcebot web UI.\n\n When using this in shared environments (e.g., Slack), you can set the visibility parameter to 'PUBLIC' to ensure everyone can access the chat link.\n\n This is a blocking operation that may take 30-60+ seconds for complex questions as the agent researches the codebase.\n `,\n askCodebaseRequestSchema.shape,\n async (request: AskCodebaseRequest) => {\n const response = await askCodebase(request);\n\n // Format the response with the answer and a link to the chat\n const formattedResponse = dedent`\n ${response.answer}\n\n ---\n View full research session: ${response.chatUrl}\n Model used: ${response.languageModel.model}\n `;\n\n return {\n content: [{\n type: \"text\",\n text: formattedResponse,\n }],\n };\n }\n);\n\nconst runServer = async () => {\n const transport = new StdioServerTransport();\n await server.connect(transport);\n}\n\nrunServer().catch((error) => {\n console.error('Failed to start MCP server:', error);\n process.exit(1);\n});\n"]}