purecontext-mcp 1.0.1

package/dist/core/indexing-worker.js

@@ -0,0 +1,128 @@
+/**
+ * Worker thread entry point for parallel file parsing.
+ *
+ * Each worker maintains its own web-tree-sitter Parser instance — no shared
+ * state, no mutex needed. Adapters are imported here so they self-register into
+ * this worker's own adapter-registry instance.
+ *
+ * Protocol (main thread → worker):
+ *   ParseJob       — process one file, respond with ParseResult
+ *   ShutdownMsg    — graceful exit (worker calls process.exit)
+ */
+import { parentPort, isMainThread } from 'worker_threads';
+import { initParser, isInitialized } from './parse-dispatcher.js';
+import { processFile } from './file-processor.js';
+import { getRegisteredAdapters } from '../adapters/adapter-registry.js';
+import { registerHandler } from '../handlers/handler-registry.js';
+// ─── Language handler registration ────────────────────────────────────────────
+// Workers have their own module instance — handlers must be registered here.
+// (Unlike adapters, handlers don't self-register at module load time.)
+import { typescriptHandler, tsxHandler } from '../handlers/typescript.js';
+import { javascriptHandler } from '../handlers/javascript.js';
+import { pythonHandler } from '../handlers/python.js';
+import { goHandler } from '../handlers/go.js';
+import { rustHandler } from '../handlers/rust.js';
+import { javaHandler } from '../handlers/java.js';
+import { csharpHandler } from '../handlers/csharp.js';
+import { phpHandler } from '../handlers/php.js';
+import { rubyHandler } from '../handlers/ruby.js';
+import { kotlinHandler } from '../handlers/kotlin.js';
+import { cHandler } from '../handlers/c.js';
+import { cppHandler } from '../handlers/cpp.js';
+import { luaHandler } from '../handlers/lua.js';
+import { dartHandler } from '../handlers/dart.js';
+import { swiftHandler } from '../handlers/swift.js';
+import { elixirHandler } from '../handlers/elixir.js';
+import { haskellHandler } from '../handlers/haskell.js';
+import { scalaHandler } from '../handlers/scala.js';
+import { rHandler } from '../handlers/r.js';
+registerHandler(typescriptHandler);
+registerHandler(tsxHandler);
+registerHandler(javascriptHandler);
+registerHandler(pythonHandler);
+registerHandler(goHandler);
+registerHandler(rustHandler);
+registerHandler(javaHandler);
+registerHandler(csharpHandler);
+registerHandler(phpHandler);
+registerHandler(rubyHandler);
+registerHandler(kotlinHandler);
+registerHandler(cHandler);
+registerHandler(cppHandler);
+registerHandler(luaHandler);
+registerHandler(dartHandler);
+registerHandler(swiftHandler);
+registerHandler(elixirHandler);
+registerHandler(haskellHandler);
+registerHandler(scalaHandler);
+registerHandler(rHandler);
+// ─── Adapter self-registration ────────────────────────────────────────────────
+// Workers have their own module instance — adapters must be imported here so
+// they call registerAdapter() in *this* worker's registry.
+import '../adapters/vue.js';
+import '../adapters/nuxt.js';
+import '../adapters/react.js';
+import '../adapters/nextjs.js';
+import '../adapters/angular.js';
+import '../adapters/nestjs.js';
+import '../adapters/express.js';
+import '../adapters/fastify.js';
+import '../adapters/flask.js';
+import '../adapters/fastapi.js';
+import '../adapters/django.js';
+import '../adapters/django-orm.js';
+import '../adapters/gin.js';
+import '../adapters/echo.js';
+import '../adapters/fiber.js';
+import '../adapters/laravel.js';
+import '../adapters/symfony.js';
+import '../adapters/rails.js';
+import '../adapters/sinatra.js';
+import '../adapters/spring-boot.js';
+import '../adapters/spring-kotlin.js';
+import '../adapters/micronaut.js';
+import '../adapters/quarkus.js';
+import '../adapters/hibernate.js';
+import '../adapters/sqlalchemy.js';
+import '../adapters/axum.js';
+import '../adapters/actix-web.js';
+import '../adapters/rocket.js';
+import '../adapters/ktor.js';
+import '../adapters/flutter.js';
+import '../adapters/vapor.js';
+// ─── Worker entry point ───────────────────────────────────────────────────────
+if (!isMainThread) {
+    parentPort.on('message', async (msg) => {
+        if ('type' in msg && msg.type === 'shutdown') {
+            process.exit(0);
+        }
+        const job = msg;
+        // Lazy-initialize parser on first message — one init per worker lifetime.
+        if (!isInitialized()) {
+            await initParser();
+        }
+        // Resolve adapters by name from this worker's self-registered registry.
+        const allAdapters = getRegisteredAdapters();
+        const adapters = job.adapterNames
+            .map((name) => allAdapters.find((a) => a.name === name))
+            .filter((a) => a !== undefined);
+        try {
+            // Reconstruct a Buffer from the Uint8Array received via structured clone.
+            const content = Buffer.from(job.content.buffer, job.content.byteOffset, job.content.byteLength);
+            const { symbols, imports } = await processFile(job.relPath, content, adapters);
+            const result = { relPath: job.relPath, symbols, imports };
+            parentPort.postMessage(result);
+        }
+        catch (err) {
+            // Catch all errors so the worker stays alive for subsequent jobs.
+            const result = {
+                relPath: job.relPath,
+                symbols: [],
+                imports: [],
+                error: err instanceof Error ? err.message : String(err),
+            };
+            parentPort.postMessage(result);
+        }
+    });
+}
+//# sourceMappingURL=indexing-worker.js.map

package/dist/core/indexing-worker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexing-worker.js","sourceRoot":"","sources":["../../src/core/indexing-worker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE1D,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAElE,iFAAiF;AACjF,6EAA6E;AAC7E,uEAAuE;AAEvE,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAC1E,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,eAAe,CAAC,iBAAiB,CAAC,CAAC;AACnC,eAAe,CAAC,UAAU,CAAC,CAAC;AAC5B,eAAe,CAAC,iBAAiB,CAAC,CAAC;AACnC,eAAe,CAAC,aAAa,CAAC,CAAC;AAC/B,eAAe,CAAC,SAAS,CAAC,CAAC;AAC3B,eAAe,CAAC,WAAW,CAAC,CAAC;AAC7B,eAAe,CAAC,WAAW,CAAC,CAAC;AAC7B,eAAe,CAAC,aAAa,CAAC,CAAC;AAC/B,eAAe,CAAC,UAAU,CAAC,CAAC;AAC5B,eAAe,CAAC,WAAW,CAAC,CAAC;AAC7B,eAAe,CAAC,aAAa,CAAC,CAAC;AAC/B,eAAe,CAAC,QAAQ,CAAC,CAAC;AAC1B,eAAe,CAAC,UAAU,CAAC,CAAC;AAC5B,eAAe,CAAC,UAAU,CAAC,CAAC;AAC5B,eAAe,CAAC,WAAW,CAAC,CAAC;AAC7B,eAAe,CAAC,YAAY,CAAC,CAAC;AAC9B,eAAe,CAAC,aAAa,CAAC,CAAC;AAC/B,eAAe,CAAC,cAAc,CAAC,CAAC;AAChC,eAAe,CAAC,YAAY,CAAC,CAAC;AAC9B,eAAe,CAAC,QAAQ,CAAC,CAAC;AAE1B,iFAAiF;AACjF,6EAA6E;AAC7E,2DAA2D;AAE3D,OAAO,oBAAoB,CAAC;AAC5B,OAAO,qBAAqB,CAAC;AAC7B,OAAO,sBAAsB,CAAC;AAC9B,OAAO,uBAAuB,CAAC;AAC/B,OAAO,wBAAwB,CAAC;AAChC,OAAO,uBAAuB,CAAC;AAC/B,OAAO,wBAAwB,CAAC;AAChC,OAAO,wBAAwB,CAAC;AAChC,OAAO,sBAAsB,CAAC;AAC9B,OAAO,wBAAwB,CAAC;AAChC,OAAO,uBAAuB,CAAC;AAC/B,OAAO,2BAA2B,CAAC;AACnC,OAAO,oBAAoB,CAAC;AAC5B,OAAO,qBAAqB,CAAC;AAC7B,OAAO,sBAAsB,CAAC;AAC9B,OAAO,wBAAwB,CAAC;AAChC,OAAO,wBAAwB,CAAC;AAChC,OAAO,sBAAsB,CAAC;AAC9B,OAAO,wBAAwB,CAAC;AAChC,OAAO,4BAA4B,CAAC;AACpC,OAAO,8BAA8B,CAAC;AACtC,OAAO,0BAA0B,CAAC;AAClC,OAAO,wBAAwB,CAAC;AAChC,OAAO,0BAA0B,CAAC;AAClC,OAAO,2BAA2B,CAAC;AACnC,OAAO,qBAAqB,CAAC;AAC7B,OAAO,0BAA0B,CAAC;AAClC,OAAO,uBAAuB,CAAC;AAC/B,OAAO,qBAAqB,CAAC;AAC7B,OAAO,wBAAwB,CAAC;AAChC,OAAO,sBAAsB,CAAC;AA0B9B,iFAAiF;AAEjF,IAAI,CAAC,YAAY,EAAE,CAAC;IAClB,UAAW,CAAC,EAAE,CAAC,SAAS,EAAE,KAAK,EAAE,GAA2B,EAAE,EAAE;QAC9D,IAAI,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QAED,MAAM,GAAG,GAAG,GAAe,CAAC;QAE5B,0EAA0E;QAC1E,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;YACrB,MAAM,UAAU,EAAE,CAAC;QACrB,CAAC;QAED,wEAAwE;QACxE,MAAM,WAAW,GAAG,qBAAqB,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,GAAG,CAAC,YAAY;aAC9B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;aACvD,MAAM,CAAC,CAAC,CAAC,EAAyB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;QAEzD,IAAI,CAAC;YACH,0EAA0E;YAC1E,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAChG,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,MAAM,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YAE/E,MAAM,MAAM,GAAgB,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;YACvE,UAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,kEAAkE;YAClE,MAAM,MAAM,GAAgB;gBAC1B,OAAO,EAAE,GAAG,CAAC,OAAO;gBACpB,OAAO,EAAE,EAAE;gBACX,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;aACxD,CAAC;YACF,UAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/core/logger.d.ts

@@ -0,0 +1,10 @@
+export type LogLevel = 'debug' | 'info' | 'warn' | 'error';
+export declare function setLogLevel(level: LogLevel): void;
+export declare function getLogLevel(): LogLevel;
+export declare const logger: {
+    debug(message: string, context?: Record<string, unknown>): void;
+    info(message: string, context?: Record<string, unknown>): void;
+    warn(message: string, context?: Record<string, unknown>): void;
+    error(message: string, context?: Record<string, unknown>): void;
+};
+//# sourceMappingURL=logger.d.ts.map

package/dist/core/logger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logger.d.ts","sourceRoot":"","sources":["../../src/core/logger.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC;AAW3D,wBAAgB,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAEjD;AAED,wBAAgB,WAAW,IAAI,QAAQ,CAEtC;AAeD,eAAO,MAAM,MAAM;mBACF,MAAM,YAAY,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;kBAGjD,MAAM,YAAY,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;kBAGhD,MAAM,YAAY,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;mBAG/C,MAAM,YAAY,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;CAGhE,CAAC"}

package/dist/core/logger.js

@@ -0,0 +1,40 @@
+const LEVELS = {
+    debug: 0,
+    info: 1,
+    warn: 2,
+    error: 3,
+};
+let currentLevel = 'info';
+export function setLogLevel(level) {
+    currentLevel = level;
+}
+export function getLogLevel() {
+    return currentLevel;
+}
+function formatMessage(level, message, context) {
+    const ts = new Date().toISOString();
+    const upper = level.toUpperCase().padEnd(5);
+    const base = `[${ts}] ${upper} ${message}`;
+    return context ? `${base} ${JSON.stringify(context)}` : base;
+}
+function write(level, message, context) {
+    if (LEVELS[level] < LEVELS[currentLevel])
+        return;
+    // Always write to stderr — stdout is reserved for MCP stdio transport
+    process.stderr.write(formatMessage(level, message, context) + '\n');
+}
+export const logger = {
+    debug(message, context) {
+        write('debug', message, context);
+    },
+    info(message, context) {
+        write('info', message, context);
+    },
+    warn(message, context) {
+        write('warn', message, context);
+    },
+    error(message, context) {
+        write('error', message, context);
+    },
+};
+//# sourceMappingURL=logger.js.map

package/dist/core/logger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"logger.js","sourceRoot":"","sources":["../../src/core/logger.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,GAA6B;IACvC,KAAK,EAAE,CAAC;IACR,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;CACT,CAAC;AAEF,IAAI,YAAY,GAAa,MAAM,CAAC;AAEpC,MAAM,UAAU,WAAW,CAAC,KAAe;IACzC,YAAY,GAAG,KAAK,CAAC;AACvB,CAAC;AAED,MAAM,UAAU,WAAW;IACzB,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,SAAS,aAAa,CAAC,KAAe,EAAE,OAAe,EAAE,OAAiC;IACxF,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,EAAE,KAAK,KAAK,IAAI,OAAO,EAAE,CAAC;IAC3C,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/D,CAAC;AAED,SAAS,KAAK,CAAC,KAAe,EAAE,OAAe,EAAE,OAAiC;IAChF,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;QAAE,OAAO;IACjD,sEAAsE;IACtE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AACtE,CAAC;AAED,MAAM,CAAC,MAAM,MAAM,GAAG;IACpB,KAAK,CAAC,OAAe,EAAE,OAAiC;QACtD,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,CAAC,OAAe,EAAE,OAAiC;QACrD,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,OAAe,EAAE,OAAiC;QACrD,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IACD,KAAK,CAAC,OAAe,EAAE,OAAiC;QACtD,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACnC,CAAC;CACF,CAAC"}

package/dist/core/parse-dispatcher.d.ts

@@ -0,0 +1,18 @@
+import type { LanguageHandler } from './types.js';
+import type { Tree } from './types.js';
+export declare const GRAMMARS_DIR: string;
+/**
+ * Initialize web-tree-sitter. Must be called once before parseFile().
+ * Safe to call multiple times — subsequent calls are no-ops.
+ */
+export declare function initParser(): Promise<void>;
+/**
+ * Parse source bytes using the grammar provided by the given handler.
+ * The returned Tree's node startIndex/endIndex are byte offsets into `source`.
+ */
+export declare function parseFile(source: Buffer, handler: LanguageHandler): Promise<Tree>;
+/** True once initParser() has completed successfully. */
+export declare function isInitialized(): boolean;
+/** Exposed for testing — resets all state. Use only in tests. */
+export declare function _resetForTesting(): void;
+//# sourceMappingURL=parse-dispatcher.d.ts.map

package/dist/core/parse-dispatcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-dispatcher.d.ts","sourceRoot":"","sources":["../../src/core/parse-dispatcher.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAClD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAcvC,eAAO,MAAM,YAAY,QAAuC,CAAC;AAUjE;;;GAGG;AACH,wBAAsB,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,CAehD;AAED;;;GAGG;AACH,wBAAsB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC,CAgBvF;AAED,yDAAyD;AACzD,wBAAgB,aAAa,IAAI,OAAO,CAEvC;AAED,iEAAiE;AACjE,wBAAgB,gBAAgB,IAAI,IAAI,CAIvC"}

package/dist/core/parse-dispatcher.js

@@ -0,0 +1,74 @@
+import _ParserImport from 'web-tree-sitter';
+import { createRequire } from 'module';
+import { dirname, resolve } from 'path';
+import { fileURLToPath } from 'url';
+import { GrammarNotFoundError, ParseError } from './errors.js';
+const Parser = (_ParserImport.default ?? _ParserImport);
+const _require = createRequire(import.meta.url);
+const __dirname = dirname(fileURLToPath(import.meta.url));
+// Resolve grammars/ relative to the compiled output location (dist/core/ → ../../grammars/)
+export const GRAMMARS_DIR = resolve(__dirname, '../../grammars');
+// ─── Module state ─────────────────────────────────────────────────────────────
+let initialized = false;
+let sharedParser = null;
+const languageCache = new Map();
+// ─── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Initialize web-tree-sitter. Must be called once before parseFile().
+ * Safe to call multiple times — subsequent calls are no-ops.
+ */
+export async function initParser() {
+    if (initialized)
+        return;
+    // Locate tree-sitter.wasm next to the web-tree-sitter package entry point
+    const wasmPath = resolve(dirname(_require.resolve('web-tree-sitter')), 'tree-sitter.wasm');
+    await Parser.init({
+        locateFile: () => wasmPath,
+    });
+    sharedParser = new Parser();
+    initialized = true;
+}
+/**
+ * Parse source bytes using the grammar provided by the given handler.
+ * The returned Tree's node startIndex/endIndex are byte offsets into `source`.
+ */
+export async function parseFile(source, handler) {
+    if (!initialized || !sharedParser) {
+        throw new ParseError('Parser not initialized — call initParser() first', '<unknown>');
+    }
+    const language = await loadLanguage(handler.grammarPath());
+    sharedParser.setLanguage(language);
+    // Pass a callback so tree-sitter operates on the raw Buffer bytes.
+    // Node startIndex/endIndex are byte offsets into the original source Buffer.
+    const tree = sharedParser.parse((startByte) => {
+        if (startByte >= source.length)
+            return null;
+        return source.toString('utf8', startByte);
+    });
+    return tree;
+}
+/** True once initParser() has completed successfully. */
+export function isInitialized() {
+    return initialized;
+}
+/** Exposed for testing — resets all state. Use only in tests. */
+export function _resetForTesting() {
+    initialized = false;
+    sharedParser = null;
+    languageCache.clear();
+}
+// ─── Internals ────────────────────────────────────────────────────────────────
+async function loadLanguage(grammarPath) {
+    const cached = languageCache.get(grammarPath);
+    if (cached)
+        return cached;
+    try {
+        const language = await Parser.Language.load(grammarPath);
+        languageCache.set(grammarPath, language);
+        return language;
+    }
+    catch (err) {
+        throw new GrammarNotFoundError(grammarPath, err);
+    }
+}
+//# sourceMappingURL=parse-dispatcher.js.map

package/dist/core/parse-dispatcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-dispatcher.js","sourceRoot":"","sources":["../../src/core/parse-dispatcher.ts"],"names":[],"mappings":"AAAA,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAE5C,OAAO,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AAGpC,OAAO,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAO/D,MAAM,MAAM,GAAG,CAAE,aAA+B,CAAC,OAAO,IAAI,aAAa,CAAyB,CAAC;AAEnG,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAChD,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAE1D,4FAA4F;AAC5F,MAAM,CAAC,MAAM,YAAY,GAAG,OAAO,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC;AAEjE,iFAAiF;AAEjF,IAAI,WAAW,GAAG,KAAK,CAAC;AACxB,IAAI,YAAY,GAAsB,IAAI,CAAC;AAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAA+B,CAAC;AAE7D,iFAAiF;AAEjF;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU;IAC9B,IAAI,WAAW;QAAE,OAAO;IAExB,0EAA0E;IAC1E,MAAM,QAAQ,GAAG,OAAO,CACtB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,EAC5C,kBAAkB,CACnB,CAAC;IAEF,MAAM,MAAM,CAAC,IAAI,CAAC;QAChB,UAAU,EAAE,GAAG,EAAE,CAAC,QAAQ;KAC3B,CAAC,CAAC;IAEH,YAAY,GAAG,IAAI,MAAM,EAAE,CAAC;IAC5B,WAAW,GAAG,IAAI,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,MAAc,EAAE,OAAwB;IACtE,IAAI,CAAC,WAAW,IAAI,CAAC,YAAY,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,kDAAkD,EAAE,WAAW,CAAC,CAAC;IACxF,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IAC3D,YAAY,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAEnC,mEAAmE;IACnE,6EAA6E;IAC7E,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,SAAiB,EAAiB,EAAE;QACnE,IAAI,SAAS,IAAI,MAAM,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAC5C,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,aAAa;IAC3B,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,gBAAgB;IAC9B,WAAW,GAAG,KAAK,CAAC;IACpB,YAAY,GAAG,IAAI,CAAC;IACpB,aAAa,CAAC,KAAK,EAAE,CAAC;AACxB,CAAC;AAED,iFAAiF;AAEjF,KAAK,UAAU,YAAY,CAAC,WAAmB;IAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC9C,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAE1B,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACzD,aAAa,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,IAAI,oBAAoB,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;IACnD,CAAC;AACH,CAAC"}

package/dist/core/search/query-preprocessor.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Preprocesses a raw user query into a valid FTS5 MATCH string.
+ *
+ * Pipeline:
+ *  1. Strip FTS5 special characters that would cause syntax errors.
+ *  2. If the input is a multi-word natural-language phrase, pass it through
+ *     unchanged (FTS5 treats whitespace as implicit AND).
+ *  3. If the input is a single snake_case or camelCase identifier, expand it
+ *     with OR alternatives so partial-word queries still find the symbol.
+ *  4. Drop expanded tokens shorter than 2 characters.
+ */
+/**
+ * Convert a raw search query into an FTS5 MATCH-safe query string.
+ *
+ * Examples:
+ *   preprocessQuery('parseFile')             → 'parseFile OR parse OR file'
+ *   preprocessQuery('get_symbol_source')     → 'get_symbol_source OR get OR symbol OR source'
+ *   preprocessQuery('orchestrate indexing')  → 'orchestrate indexing'
+ *   preprocessQuery('"bad chars"')           → 'bad chars'
+ */
+export declare function preprocessQuery(raw: string): string;
+//# sourceMappingURL=query-preprocessor.d.ts.map

package/dist/core/search/query-preprocessor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-preprocessor.d.ts","sourceRoot":"","sources":["../../../src/core/search/query-preprocessor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAoCnD"}

package/dist/core/search/query-preprocessor.js

@@ -0,0 +1,77 @@
+/**
+ * Preprocesses a raw user query into a valid FTS5 MATCH string.
+ *
+ * Pipeline:
+ *  1. Strip FTS5 special characters that would cause syntax errors.
+ *  2. If the input is a multi-word natural-language phrase, pass it through
+ *     unchanged (FTS5 treats whitespace as implicit AND).
+ *  3. If the input is a single snake_case or camelCase identifier, expand it
+ *     with OR alternatives so partial-word queries still find the symbol.
+ *  4. Drop expanded tokens shorter than 2 characters.
+ */
+// ─── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Convert a raw search query into an FTS5 MATCH-safe query string.
+ *
+ * Examples:
+ *   preprocessQuery('parseFile')             → 'parseFile OR parse OR file'
+ *   preprocessQuery('get_symbol_source')     → 'get_symbol_source OR get OR symbol OR source'
+ *   preprocessQuery('orchestrate indexing')  → 'orchestrate indexing'
+ *   preprocessQuery('"bad chars"')           → 'bad chars'
+ */
+export function preprocessQuery(raw) {
+    // Step 1: strip/replace characters that have special meaning in FTS5 MATCH syntax.
+    // Hyphen is replaced with a space because FTS5 interprets "word-word" as a column
+    // filter ("column:token") which causes a syntax error for unknown column names.
+    const escaped = raw.replace(/["()\^*+\-]/g, ' ').trim();
+    if (!escaped)
+        return '';
+    // Step 2: if the input contains spaces it is a natural-language phrase —
+    // pass it through so FTS5 treats each word as an implicit AND term.
+    const words = escaped.split(/\s+/).filter(Boolean);
+    if (words.length > 1) {
+        return words.join(' ');
+    }
+    const token = words[0];
+    // Step 3a: snake_case expansion — 'get_symbol_source' → parts joined with OR
+    if (token.includes('_')) {
+        const parts = token.split('_').filter((t) => t.length >= 2);
+        if (parts.length > 1) {
+            return [token, ...parts].join(' OR ');
+        }
+        return token;
+    }
+    // Step 3b: camelCase expansion — 'parseFile' → 'parseFile OR parse OR file'
+    const camelParts = splitCamelCase(token);
+    if (camelParts.length > 1) {
+        const expanded = camelParts
+            .map((t) => t.toLowerCase())
+            .filter((t) => t.length >= 2);
+        return [token, ...expanded].join(' OR ');
+    }
+    return token;
+}
+// ─── Helpers ─────────────────────────────────────────────────────────────────
+/**
+ * Split a camelCase or PascalCase identifier into its component words.
+ * All-caps tokens (acronyms: MCP, HTTP) are returned as a single element.
+ *
+ * Examples:
+ *   splitCamelCase('parseFile')      → ['parse', 'File']
+ *   splitCamelCase('HybridSearcher') → ['Hybrid', 'Searcher']
+ *   splitCamelCase('MCP')            → ['MCP']
+ *   splitCamelCase('getHTTPStatus')  → ['get', 'HTTP', 'Status']
+ */
+function splitCamelCase(token) {
+    // All-caps acronym — do not split
+    if (/^[A-Z\d]+$/.test(token))
+        return [token];
+    const spaced = token
+        // Insert space between a lowercase/digit and the next uppercase letter
+        .replace(/([a-z\d])([A-Z])/g, '$1 $2')
+        // Insert space before the last uppercase letter in a run followed by lowercase
+        // e.g. 'HTTPStatus' → 'HTTP Status'
+        .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2');
+    return spaced.split(' ').filter(Boolean);
+}
+//# sourceMappingURL=query-preprocessor.js.map

package/dist/core/search/query-preprocessor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-preprocessor.js","sourceRoot":"","sources":["../../../src/core/search/query-preprocessor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,iFAAiF;AAEjF;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,mFAAmF;IACnF,kFAAkF;IAClF,gFAAgF;IAChF,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAExD,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,yEAAyE;IACzE,oEAAoE;IACpE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACnD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAEvB,6EAA6E;IAC7E,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,4EAA4E;IAC5E,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,UAAU;aACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;aAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAChC,OAAO,CAAC,KAAK,EAAE,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;;GASG;AACH,SAAS,cAAc,CAAC,KAAa;IACnC,kCAAkC;IAClC,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,KAAK;QAClB,uEAAuE;SACtE,OAAO,CAAC,mBAAmB,EAAE,OAAO,CAAC;QACtC,+EAA+E;QAC/E,oCAAoC;SACnC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC,CAAC;IAE7C,OAAO,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AAC3C,CAAC"}

package/dist/core/search/relevance-ranker.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Post-FTS5 relevance re-ranking layer.
+ *
+ * BM25 ranks by term frequency across all FTS content fields, so a symbol
+ * whose summary mentions "index" five times can outrank `indexFolder` whose
+ * name is an exact match.  This ranker applies an explicit additive scoring
+ * scheme that promotes exact name matches to the top.
+ *
+ * Scoring (additive, higher = more relevant):
+ *  100 — exact name match (case-insensitive)
+ *   60 — name starts with query
+ *   40 — name contains query as substring
+ *   30 — all query words appear in name
+ *   20 — any query word is exact name match
+ *   10 — any query word appears in name (per word)
+ *    8 — query phrase in signature
+ *    2 — any query word in signature (per word)
+ *    5 — query phrase in summary
+ *    1 — any query word in summary (per word)
+ */
+import type { SymbolRecord } from '../types.js';
+export interface ScoredSymbol {
+    symbol: SymbolRecord;
+    score: number;
+    matchReason: 'exact_name' | 'prefix_name' | 'name_contains' | 'word_overlap' | 'content_match';
+}
+/**
+ * Score and sort a list of symbols by relevance to `query`.
+ *
+ * Input symbols are assumed to already be filtered by FTS5 (or LIKE) — this
+ * layer only re-orders them.  Ties in score preserve the original (BM25) order.
+ */
+export declare function rankSymbols(symbols: SymbolRecord[], query: string): ScoredSymbol[];
+//# sourceMappingURL=relevance-ranker.d.ts.map

package/dist/core/search/relevance-ranker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relevance-ranker.d.ts","sourceRoot":"","sources":["../../../src/core/search/relevance-ranker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAIhD,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,YAAY,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,YAAY,GAAG,aAAa,GAAG,eAAe,GAAG,cAAc,GAAG,eAAe,CAAC;CAChG;AAID;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,YAAY,EAAE,CAkBlF"}

package/dist/core/search/relevance-ranker.js

@@ -0,0 +1,132 @@
+/**
+ * Post-FTS5 relevance re-ranking layer.
+ *
+ * BM25 ranks by term frequency across all FTS content fields, so a symbol
+ * whose summary mentions "index" five times can outrank `indexFolder` whose
+ * name is an exact match.  This ranker applies an explicit additive scoring
+ * scheme that promotes exact name matches to the top.
+ *
+ * Scoring (additive, higher = more relevant):
+ *  100 — exact name match (case-insensitive)
+ *   60 — name starts with query
+ *   40 — name contains query as substring
+ *   30 — all query words appear in name
+ *   20 — any query word is exact name match
+ *   10 — any query word appears in name (per word)
+ *    8 — query phrase in signature
+ *    2 — any query word in signature (per word)
+ *    5 — query phrase in summary
+ *    1 — any query word in summary (per word)
+ */
+// ─── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Score and sort a list of symbols by relevance to `query`.
+ *
+ * Input symbols are assumed to already be filtered by FTS5 (or LIKE) — this
+ * layer only re-orders them.  Ties in score preserve the original (BM25) order.
+ */
+export function rankSymbols(symbols, query) {
+    if (symbols.length === 0)
+        return [];
+    const queryLower = query.trim().toLowerCase();
+    const queryWords = extractQueryWords(query.trim());
+    const scored = symbols.map((symbol, originalIndex) => ({
+        ...score(symbol, queryLower, queryWords),
+        symbol,
+        originalIndex,
+    }));
+    scored.sort((a, b) => {
+        if (b.score !== a.score)
+            return b.score - a.score;
+        return a.originalIndex - b.originalIndex; // preserve FTS order on tie
+    });
+    return scored.map(({ symbol, score: s, matchReason }) => ({ symbol, score: s, matchReason }));
+}
+// ─── Scoring ─────────────────────────────────────────────────────────────────
+function score(symbol, queryLower, queryWords) {
+    const nameLower = symbol.name.toLowerCase();
+    const sigLower = symbol.signature.toLowerCase();
+    const sumLower = symbol.summary.toLowerCase();
+    let total = 0;
+    let matchReason = 'content_match';
+    // ── Name-level rules (mutually exclusive for matchReason priority) ──────────
+    if (nameLower === queryLower) {
+        total += 100;
+        matchReason = 'exact_name';
+    }
+    else if (nameLower.startsWith(queryLower)) {
+        total += 60;
+        matchReason = 'prefix_name';
+    }
+    else if (nameLower.includes(queryLower)) {
+        total += 40;
+        matchReason = 'name_contains';
+    }
+    // ── Word-overlap rules (always additive; update matchReason if not yet set) ─
+    if (queryWords.length > 0) {
+        let wordScore = 0;
+        if (queryWords.every((w) => nameLower.includes(w))) {
+            wordScore += 30;
+        }
+        if (queryWords.some((w) => nameLower === w)) {
+            wordScore += 20;
+        }
+        const wordsInName = queryWords.filter((w) => nameLower.includes(w)).length;
+        wordScore += wordsInName * 10;
+        if (wordScore > 0) {
+            total += wordScore;
+            if (matchReason === 'content_match')
+                matchReason = 'word_overlap';
+        }
+    }
+    // ── Content rules (signature + summary) ────────────────────────────────────
+    if (sigLower.includes(queryLower))
+        total += 8;
+    total += queryWords.filter((w) => sigLower.includes(w)).length * 2;
+    if (sumLower.includes(queryLower))
+        total += 5;
+    total += queryWords.filter((w) => sumLower.includes(w)).length * 1;
+    return { score: total, matchReason };
+}
+// ─── Helpers ─────────────────────────────────────────────────────────────────
+/**
+ * Extract a deduplicated set of lowercase search terms from the raw query.
+ *
+ * For camelCase/snake_case identifiers the component words are included so
+ * scoring works on both the full token and its parts.
+ *
+ * Examples:
+ *   'indexFolder'      → ['indexfolder', 'index', 'folder']
+ *   'blast radius'     → ['blast', 'radius']
+ *   'get_symbol_source'→ ['get_symbol_source', 'get', 'symbol', 'source']
+ */
+function extractQueryWords(raw) {
+    const words = new Set();
+    for (const part of raw.split(/\s+/).filter(Boolean)) {
+        const lower = part.toLowerCase();
+        words.add(lower);
+        if (part.includes('_')) {
+            // snake_case — split on underscores
+            for (const seg of part.split('_')) {
+                const s = seg.toLowerCase();
+                if (s.length >= 2)
+                    words.add(s);
+            }
+        }
+        else {
+            // camelCase — split on case boundaries using the raw (cased) token
+            const parts = part
+                .replace(/([a-z\d])([A-Z])/g, '$1 $2')
+                .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2')
+                .split(' ')
+                .map((s) => s.toLowerCase())
+                .filter((s) => s.length >= 2);
+            if (parts.length > 1) {
+                for (const s of parts)
+                    words.add(s);
+            }
+        }
+    }
+    return Array.from(words);
+}
+//# sourceMappingURL=relevance-ranker.js.map

package/dist/core/search/relevance-ranker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relevance-ranker.js","sourceRoot":"","sources":["../../../src/core/search/relevance-ranker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAYH,iFAAiF;AAEjF;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,OAAuB,EAAE,KAAa;IAChE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC9C,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAEnD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC;QACrD,GAAG,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,UAAU,CAAC;QACxC,MAAM;QACN,aAAa;KACd,CAAC,CAAC,CAAC;IAEJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,OAAO,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,4BAA4B;IACxE,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;AAChG,CAAC;AAED,gFAAgF;AAEhF,SAAS,KAAK,CACZ,MAAoB,EACpB,UAAkB,EAClB,UAAoB;IAEpB,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;IAE9C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAgC,eAAe,CAAC;IAE/D,+EAA+E;IAE/E,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;QAC7B,KAAK,IAAI,GAAG,CAAC;QACb,WAAW,GAAG,YAAY,CAAC;IAC7B,CAAC;SAAM,IAAI,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC5C,KAAK,IAAI,EAAE,CAAC;QACZ,WAAW,GAAG,aAAa,CAAC;IAC9B,CAAC;SAAM,IAAI,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QAC1C,KAAK,IAAI,EAAE,CAAC;QACZ,WAAW,GAAG,eAAe,CAAC;IAChC,CAAC;IAED,+EAA+E;IAE/E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACnD,SAAS,IAAI,EAAE,CAAC;QAClB,CAAC;QACD,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;YAC5C,SAAS,IAAI,EAAE,CAAC;QAClB,CAAC;QACD,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC3E,SAAS,IAAI,WAAW,GAAG,EAAE,CAAC;QAE9B,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,KAAK,IAAI,SAAS,CAAC;YACnB,IAAI,WAAW,KAAK,eAAe;gBAAE,WAAW,GAAG,cAAc,CAAC;QACpE,CAAC;IACH,CAAC;IAED,8EAA8E;IAE9E,IAAI,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IAC9C,KAAK,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACnE,IAAI,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IAC9C,KAAK,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAEnE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;AACvC,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,SAAS,iBAAiB,CAAC,GAAW;IACpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEjB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,oCAAoC;YACpC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;gBAC5B,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,mEAAmE;YACnE,MAAM,KAAK,GAAG,IAAI;iBACf,OAAO,CAAC,mBAAmB,EAAE,OAAO,CAAC;iBACrC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC;iBACzC,KAAK,CAAC,GAAG,CAAC;iBACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;iBAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;YAEhC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,KAAK,MAAM,CAAC,IAAI,KAAK;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC"}

package/dist/core/security.d.ts

@@ -0,0 +1,40 @@
+import { PureContextError } from './errors.js';
+export declare class SecurityError extends PureContextError {
+    readonly code: 'path_traversal' | 'symlink_escape' | 'file_too_large';
+    constructor(code: 'path_traversal' | 'symlink_escape' | 'file_too_large', message: string);
+}
+/**
+ * Resolve `filePath` relative to `projectRoot` and verify it stays within the
+ * project root.  Throws `SecurityError('path_traversal')` on escape attempts.
+ * Returns the absolute resolved path.
+ */
+export declare function validatePath(filePath: string, projectRoot: string): string;
+/**
+ * Verify that `resolvedPath` does not escape `projectRoot` after all symlinks
+ * are resolved.  Throws `SecurityError('symlink_escape')` if it does.
+ * No-ops when the path does not exist (not yet created files are not a threat).
+ */
+export declare function checkSymlinkEscape(resolvedPath: string, projectRoot: string): void;
+/**
+ * Returns `true` when the file name matches a known credential/secret pattern
+ * and should be excluded from indexing.  Case-insensitive.
+ */
+export declare function isSecretFile(filePath: string): boolean;
+/**
+ * Returns `true` when the content buffer contains a null byte, which is a
+ * reliable indicator of binary (non-text) content.  Only the first 8192 bytes
+ * are examined.
+ */
+export declare function isBinaryFile(content: Buffer): boolean;
+/**
+ * Read up to `BINARY_PEEK_BYTES` from the beginning of a file for binary
+ * detection without loading the whole file into memory.
+ * Returns an empty buffer on read failure.
+ */
+export declare function peekFileContent(absPath: string): Buffer;
+export declare const DEFAULT_MAX_FILE_BYTES = 1048576;
+/**
+ * Throws `SecurityError('file_too_large')` when `size` exceeds `maxBytes`.
+ */
+export declare function checkFileSize(size: number, maxBytes?: number): void;
+//# sourceMappingURL=security.d.ts.map

package/dist/core/security.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"security.d.ts","sourceRoot":"","sources":["../../src/core/security.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAI/C,qBAAa,aAAc,SAAQ,gBAAgB;aAE/B,IAAI,EAAE,gBAAgB,GAAG,gBAAgB,GAAG,gBAAgB;gBAA5D,IAAI,EAAE,gBAAgB,GAAG,gBAAgB,GAAG,gBAAgB,EAC5E,OAAO,EAAE,MAAM;CAIlB;AAID;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAa1E;AAID;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAyBlF;AAyBD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAGtD;AAMD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAMrD;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAcvD;AAID,eAAO,MAAM,sBAAsB,UAAY,CAAC;AAEhD;;GAEG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,MAAM,EACZ,QAAQ,GAAE,MAA+B,GACxC,IAAI,CAON"}