@sharc-code/mcp 0.2.0

package/dist/watcher/processing-queue.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Processing Queue for File Changes
+ *
+ * Handles race conditions when files change rapidly:
+ * - Deduplicates by file path (latest event wins)
+ * - Processes one file at a time per queue
+ * - Allows concurrent processing across different codebases
+ */
+export type FileChangeType = 'add' | 'modify' | 'delete';
+export interface FileChange {
+    type: FileChangeType;
+    relativePath: string;
+    absolutePath: string;
+}
+export interface QueuedChange {
+    change: FileChange;
+    timestamp: number;
+}
+export interface ProcessingResult {
+    success: boolean;
+    chunksDeleted: number;
+    chunksIndexed: number;
+    skipped?: boolean;
+    error?: string;
+}
+export type ChangeProcessor = (change: FileChange) => Promise<ProcessingResult>;
+/**
+ * Processing queue that deduplicates file changes by path
+ *
+ * When a file changes multiple times before processing:
+ * - Old events are discarded
+ * - Only the latest event is processed
+ * - This prevents wasted work and race conditions
+ */
+export declare class ProcessingQueue {
+    private queue;
+    private isProcessing;
+    private processingPath;
+    private pendingReprocess;
+    private processor;
+    private verbose;
+    constructor(processor: ChangeProcessor, verbose?: boolean);
+    /**
+     * Add a file change to the queue
+     * If the file is already queued, replaces with the new event
+     */
+    enqueue(change: FileChange): void;
+    /**
+     * Get the number of pending changes
+     */
+    getPendingCount(): number;
+    /**
+     * Check if the queue is idle (not processing and no pending)
+     */
+    isIdle(): boolean;
+    /**
+     * Get the currently processing path
+     */
+    getCurrentlyProcessing(): string | null;
+    /**
+     * Process the next item in the queue
+     * Only one item is processed at a time
+     */
+    private tryProcessNext;
+    /**
+     * Get the oldest entry from the queue (FIFO order)
+     */
+    private getOldestEntry;
+    /**
+     * Clear the queue (for shutdown)
+     */
+    clear(): void;
+    /**
+     * Wait for the queue to become idle
+     * Useful for graceful shutdown
+     */
+    waitForIdle(timeoutMs?: number): Promise<boolean>;
+}
+//# sourceMappingURL=processing-queue.d.ts.map

package/dist/watcher/processing-queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"processing-queue.d.ts","sourceRoot":"","sources":["../../src/watcher/processing-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,MAAM,cAAc,GAAG,KAAK,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAEzD,MAAM,WAAW,UAAU;IACvB,IAAI,EAAE,cAAc,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,YAAY;IACzB,MAAM,EAAE,UAAU,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,gBAAgB;IAC7B,OAAO,EAAE,OAAO,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,eAAe,GAAG,CAAC,MAAM,EAAE,UAAU,KAAK,OAAO,CAAC,gBAAgB,CAAC,CAAC;AAEhF;;;;;;;GAOG;AACH,qBAAa,eAAe;IACxB,OAAO,CAAC,KAAK,CAAwC;IACrD,OAAO,CAAC,YAAY,CAAkB;IACtC,OAAO,CAAC,cAAc,CAAuB;IAC7C,OAAO,CAAC,gBAAgB,CAA0B;IAClD,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,OAAO,CAAU;gBAEb,SAAS,EAAE,eAAe,EAAE,OAAO,GAAE,OAAe;IAKhE;;;OAGG;IACH,OAAO,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI;IAyBjC;;OAEG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACH,MAAM,IAAI,OAAO;IAIjB;;OAEG;IACH,sBAAsB,IAAI,MAAM,GAAG,IAAI;IAIvC;;;OAGG;YACW,cAAc;IA8C5B;;OAEG;IACH,OAAO,CAAC,cAAc;IAgBtB;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;;OAGG;IACG,WAAW,CAAC,SAAS,GAAE,MAAc,GAAG,OAAO,CAAC,OAAO,CAAC;CAYjE"}

package/dist/watcher/processing-queue.js

@@ -0,0 +1,150 @@
+/**
+ * Processing Queue for File Changes
+ *
+ * Handles race conditions when files change rapidly:
+ * - Deduplicates by file path (latest event wins)
+ * - Processes one file at a time per queue
+ * - Allows concurrent processing across different codebases
+ */
+/**
+ * Processing queue that deduplicates file changes by path
+ *
+ * When a file changes multiple times before processing:
+ * - Old events are discarded
+ * - Only the latest event is processed
+ * - This prevents wasted work and race conditions
+ */
+export class ProcessingQueue {
+    constructor(processor, verbose = false) {
+        this.queue = new Map();
+        this.isProcessing = false;
+        this.processingPath = null;
+        this.pendingReprocess = new Set();
+        this.processor = processor;
+        this.verbose = verbose;
+    }
+    /**
+     * Add a file change to the queue
+     * If the file is already queued, replaces with the new event
+     */
+    enqueue(change) {
+        const { relativePath } = change;
+        // If this file is currently being processed, mark for reprocess
+        if (this.processingPath === relativePath) {
+            this.pendingReprocess.add(relativePath);
+            if (this.verbose) {
+                console.log(`[Queue] File ${relativePath} changed during processing, will reprocess`);
+            }
+        }
+        // Always replace existing - latest event wins
+        this.queue.set(relativePath, {
+            change,
+            timestamp: Date.now(),
+        });
+        if (this.verbose) {
+            console.log(`[Queue] Enqueued ${change.type}: ${relativePath} (queue size: ${this.queue.size})`);
+        }
+        // Try to process next item
+        this.tryProcessNext();
+    }
+    /**
+     * Get the number of pending changes
+     */
+    getPendingCount() {
+        return this.queue.size;
+    }
+    /**
+     * Check if the queue is idle (not processing and no pending)
+     */
+    isIdle() {
+        return !this.isProcessing && this.queue.size === 0;
+    }
+    /**
+     * Get the currently processing path
+     */
+    getCurrentlyProcessing() {
+        return this.processingPath;
+    }
+    /**
+     * Process the next item in the queue
+     * Only one item is processed at a time
+     */
+    async tryProcessNext() {
+        if (this.isProcessing || this.queue.size === 0) {
+            return;
+        }
+        this.isProcessing = true;
+        // Get oldest entry (FIFO within deduplication)
+        const [path, queued] = this.getOldestEntry();
+        this.queue.delete(path);
+        this.processingPath = path;
+        try {
+            if (this.verbose) {
+                console.log(`[Queue] Processing ${queued.change.type}: ${path}`);
+            }
+            const result = await this.processor(queued.change);
+            if (this.verbose) {
+                if (result.success) {
+                    console.log(`[Queue] Completed ${path}: deleted=${result.chunksDeleted}, indexed=${result.chunksIndexed}`);
+                }
+                else {
+                    console.log(`[Queue] Failed ${path}: ${result.error}`);
+                }
+            }
+        }
+        catch (error) {
+            console.error(`[Queue] Error processing ${path}:`, error);
+        }
+        finally {
+            this.processingPath = null;
+            this.isProcessing = false;
+            // Check if this file needs reprocessing
+            if (this.pendingReprocess.has(path)) {
+                this.pendingReprocess.delete(path);
+                // The file should already be in queue with updated content
+                if (this.verbose) {
+                    console.log(`[Queue] File ${path} changed during processing, continuing with updated content`);
+                }
+            }
+            // Process next item
+            this.tryProcessNext();
+        }
+    }
+    /**
+     * Get the oldest entry from the queue (FIFO order)
+     */
+    getOldestEntry() {
+        let oldest = null;
+        for (const entry of this.queue.entries()) {
+            if (!oldest || entry[1].timestamp < oldest[1].timestamp) {
+                oldest = entry;
+            }
+        }
+        if (!oldest) {
+            throw new Error('Queue is empty');
+        }
+        return oldest;
+    }
+    /**
+     * Clear the queue (for shutdown)
+     */
+    clear() {
+        this.queue.clear();
+        this.pendingReprocess.clear();
+    }
+    /**
+     * Wait for the queue to become idle
+     * Useful for graceful shutdown
+     */
+    async waitForIdle(timeoutMs = 30000) {
+        const startTime = Date.now();
+        while (!this.isIdle()) {
+            if (Date.now() - startTime > timeoutMs) {
+                return false; // Timeout
+            }
+            await new Promise(resolve => setTimeout(resolve, 100));
+        }
+        return true;
+    }
+}
+//# sourceMappingURL=processing-queue.js.map

package/dist/watcher/processing-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"processing-queue.js","sourceRoot":"","sources":["../../src/watcher/processing-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAyBH;;;;;;;GAOG;AACH,MAAM,OAAO,eAAe;IAQxB,YAAY,SAA0B,EAAE,UAAmB,KAAK;QAPxD,UAAK,GAA8B,IAAI,GAAG,EAAE,CAAC;QAC7C,iBAAY,GAAY,KAAK,CAAC;QAC9B,mBAAc,GAAkB,IAAI,CAAC;QACrC,qBAAgB,GAAgB,IAAI,GAAG,EAAE,CAAC;QAK9C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,MAAkB;QACtB,MAAM,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;QAEhC,gEAAgE;QAChE,IAAI,IAAI,CAAC,cAAc,KAAK,YAAY,EAAE,CAAC;YACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YACxC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,OAAO,CAAC,GAAG,CAAC,gBAAgB,YAAY,4CAA4C,CAAC,CAAC;YAC1F,CAAC;QACL,CAAC;QAED,8CAA8C;QAC9C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE;YACzB,MAAM;YACN,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACxB,CAAC,CAAC;QAEH,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,OAAO,CAAC,GAAG,CAAC,oBAAoB,MAAM,CAAC,IAAI,KAAK,YAAY,iBAAiB,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;QACrG,CAAC;QAED,2BAA2B;QAC3B,IAAI,CAAC,cAAc,EAAE,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,eAAe;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,MAAM;QACF,OAAO,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,sBAAsB;QAClB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,cAAc;QACxB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC7C,OAAO;QACX,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAEzB,+CAA+C;QAC/C,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC7C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAE3B,IAAI,CAAC;YACD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,OAAO,CAAC,GAAG,CAAC,sBAAsB,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC;YACrE,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAEnD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,qBAAqB,IAAI,aAAa,MAAM,CAAC,aAAa,aAAa,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC;gBAC/G,CAAC;qBAAM,CAAC;oBACJ,OAAO,CAAC,GAAG,CAAC,kBAAkB,IAAI,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACL,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,4BAA4B,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9D,CAAC;gBAAS,CAAC;YACP,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;YAE1B,wCAAwC;YACxC,IAAI,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACnC,2DAA2D;gBAC3D,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACf,OAAO,CAAC,GAAG,CAAC,gBAAgB,IAAI,6DAA6D,CAAC,CAAC;gBACnG,CAAC;YACL,CAAC;YAED,oBAAoB;YACpB,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1B,CAAC;IACL,CAAC;IAED;;OAEG;IACK,cAAc;QAClB,IAAI,MAAM,GAAkC,IAAI,CAAC;QAEjD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;gBACtD,MAAM,GAAG,KAAK,CAAC;YACnB,CAAC;QACL,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,CAAC,YAAoB,KAAK;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACpB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,SAAS,EAAE,CAAC;gBACrC,OAAO,KAAK,CAAC,CAAC,UAAU;YAC5B,CAAC;YACD,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;CACJ"}

package/dist/watcher/syntax-guard.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Syntax Guard
+ *
+ * Protects vector database from incomplete/broken code.
+ * When a file has syntax errors, we skip re-indexing and keep old vectors.
+ *
+ * This prevents the scenario where:
+ * 1. User saves file mid-typing (incomplete code)
+ * 2. Old vectors get deleted
+ * 3. New code fails to parse → no new vectors
+ * 4. Search results disappear until next successful save
+ */
+export interface SyntaxCheckResult {
+    hasErrors: boolean;
+    errorCount: number;
+    language: string;
+    supported: boolean;
+}
+/**
+ * Syntax Guard class
+ *
+ * Uses tree-sitter via AST splitter to detect syntax errors.
+ * Only checks languages that have tree-sitter grammars.
+ */
+export declare class SyntaxGuard {
+    private splitter;
+    constructor();
+    /**
+     * Get language from file extension
+     */
+    getLanguageFromExtension(ext: string): string;
+    /**
+     * Check if a language is supported for syntax checking
+     */
+    isLanguageSupported(language: string): boolean;
+    /**
+     * Check file content for syntax errors
+     *
+     * @param content - File content to check
+     * @param language - Language identifier (e.g., 'typescript', 'python')
+     * @returns SyntaxCheckResult with error information
+     */
+    checkSyntax(content: string, language: string): SyntaxCheckResult;
+    /**
+     * Check file by extension
+     *
+     * Convenience method that determines language from extension.
+     *
+     * @param content - File content to check
+     * @param ext - File extension (e.g., '.ts', '.py')
+     * @returns SyntaxCheckResult with error information
+     */
+    checkSyntaxByExtension(content: string, ext: string): SyntaxCheckResult;
+}
+/**
+ * Get shared SyntaxGuard instance
+ */
+export declare function getSyntaxGuard(): SyntaxGuard;
+//# sourceMappingURL=syntax-guard.d.ts.map

package/dist/watcher/syntax-guard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"syntax-guard.d.ts","sourceRoot":"","sources":["../../src/watcher/syntax-guard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AA2CH,MAAM,WAAW,iBAAiB;IAC9B,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;CACtB;AAED;;;;;GAKG;AACH,qBAAa,WAAW;IACpB,OAAO,CAAC,QAAQ,CAAkB;;IAMlC;;OAEG;IACH,wBAAwB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI7C;;OAEG;IACH,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAI9C;;;;;;OAMG;IACH,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,iBAAiB;IAgCjE;;;;;;;;OAQG;IACH,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,iBAAiB;CAI1E;AAKD;;GAEG;AACH,wBAAgB,cAAc,IAAI,WAAW,CAK5C"}

package/dist/watcher/syntax-guard.js

@@ -0,0 +1,136 @@
+/**
+ * Syntax Guard
+ *
+ * Protects vector database from incomplete/broken code.
+ * When a file has syntax errors, we skip re-indexing and keep old vectors.
+ *
+ * This prevents the scenario where:
+ * 1. User saves file mid-typing (incomplete code)
+ * 2. Old vectors get deleted
+ * 3. New code fails to parse → no new vectors
+ * 4. Search results disappear until next successful save
+ */
+// Import from @sharc-code/splitter package
+import { AstCodeSplitter } from '@sharc-code/splitter';
+// Languages supported by tree-sitter AST parsing
+const SUPPORTED_LANGUAGES = new Set([
+    'typescript',
+    'javascript',
+    'python',
+    'go',
+    'rust',
+    'java',
+    'c',
+    'cpp',
+    'c_sharp',
+    'scala',
+]);
+// Extension to language mapping
+const EXTENSION_TO_LANGUAGE = {
+    '.ts': 'typescript',
+    '.tsx': 'typescript',
+    '.js': 'javascript',
+    '.jsx': 'javascript',
+    '.mjs': 'javascript',
+    '.cjs': 'javascript',
+    '.py': 'python',
+    '.go': 'go',
+    '.rs': 'rust',
+    '.java': 'java',
+    '.c': 'c',
+    '.h': 'c',
+    '.cpp': 'cpp',
+    '.cc': 'cpp',
+    '.cxx': 'cpp',
+    '.hpp': 'cpp',
+    '.hxx': 'cpp',
+    '.cs': 'c_sharp',
+    '.scala': 'scala',
+    '.sc': 'scala',
+};
+/**
+ * Syntax Guard class
+ *
+ * Uses tree-sitter via AST splitter to detect syntax errors.
+ * Only checks languages that have tree-sitter grammars.
+ */
+export class SyntaxGuard {
+    constructor() {
+        this.splitter = new AstCodeSplitter();
+    }
+    /**
+     * Get language from file extension
+     */
+    getLanguageFromExtension(ext) {
+        return EXTENSION_TO_LANGUAGE[ext.toLowerCase()] || 'unknown';
+    }
+    /**
+     * Check if a language is supported for syntax checking
+     */
+    isLanguageSupported(language) {
+        return SUPPORTED_LANGUAGES.has(language);
+    }
+    /**
+     * Check file content for syntax errors
+     *
+     * @param content - File content to check
+     * @param language - Language identifier (e.g., 'typescript', 'python')
+     * @returns SyntaxCheckResult with error information
+     */
+    checkSyntax(content, language) {
+        // If language is not supported by tree-sitter, allow indexing
+        if (!this.isLanguageSupported(language)) {
+            return {
+                hasErrors: false,
+                errorCount: 0,
+                language,
+                supported: false,
+            };
+        }
+        try {
+            const result = this.splitter.checkSyntaxErrors(content, language);
+            return {
+                hasErrors: result.hasErrors,
+                errorCount: result.errorCount,
+                language,
+                supported: true,
+            };
+        }
+        catch (error) {
+            // If parsing fails completely, treat as having errors
+            // This is conservative - better to keep old vectors than risk losing them
+            console.error(`[SyntaxGuard] Error checking syntax for ${language}:`, error);
+            return {
+                hasErrors: true,
+                errorCount: 1,
+                language,
+                supported: true,
+            };
+        }
+    }
+    /**
+     * Check file by extension
+     *
+     * Convenience method that determines language from extension.
+     *
+     * @param content - File content to check
+     * @param ext - File extension (e.g., '.ts', '.py')
+     * @returns SyntaxCheckResult with error information
+     */
+    checkSyntaxByExtension(content, ext) {
+        const language = this.getLanguageFromExtension(ext);
+        return this.checkSyntax(content, language);
+    }
+}
+// Singleton instance for shared use
+let sharedInstance = null;
+/**
+ * Get shared SyntaxGuard instance
+ */
+export function getSyntaxGuard() {
+    if (!sharedInstance) {
+        sharedInstance = new SyntaxGuard();
+    }
+    return sharedInstance;
+}
+//# sourceMappingURL=syntax-guard.js.map

package/dist/watcher/syntax-guard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"syntax-guard.js","sourceRoot":"","sources":["../../src/watcher/syntax-guard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,2CAA2C;AAC3C,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAEvD,iDAAiD;AACjD,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAChC,YAAY;IACZ,YAAY;IACZ,QAAQ;IACR,IAAI;IACJ,MAAM;IACN,MAAM;IACN,GAAG;IACH,KAAK;IACL,SAAS;IACT,OAAO;CACV,CAAC,CAAC;AAEH,gCAAgC;AAChC,MAAM,qBAAqB,GAA2B;IAClD,KAAK,EAAE,YAAY;IACnB,MAAM,EAAE,YAAY;IACpB,KAAK,EAAE,YAAY;IACnB,MAAM,EAAE,YAAY;IACpB,MAAM,EAAE,YAAY;IACpB,MAAM,EAAE,YAAY;IACpB,KAAK,EAAE,QAAQ;IACf,KAAK,EAAE,IAAI;IACX,KAAK,EAAE,MAAM;IACb,OAAO,EAAE,MAAM;IACf,IAAI,EAAE,GAAG;IACT,IAAI,EAAE,GAAG;IACT,MAAM,EAAE,KAAK;IACb,KAAK,EAAE,KAAK;IACZ,MAAM,EAAE,KAAK;IACb,MAAM,EAAE,KAAK;IACb,MAAM,EAAE,KAAK;IACb,KAAK,EAAE,SAAS;IAChB,QAAQ,EAAE,OAAO;IACjB,KAAK,EAAE,OAAO;CACjB,CAAC;AASF;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IAGpB;QACI,IAAI,CAAC,QAAQ,GAAG,IAAI,eAAe,EAAE,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,wBAAwB,CAAC,GAAW;QAChC,OAAO,qBAAqB,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,IAAI,SAAS,CAAC;IACjE,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,QAAgB;QAChC,OAAO,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,OAAe,EAAE,QAAgB;QACzC,8DAA8D;QAC9D,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,OAAO;gBACH,SAAS,EAAE,KAAK;gBAChB,UAAU,EAAE,CAAC;gBACb,QAAQ;gBACR,SAAS,EAAE,KAAK;aACnB,CAAC;QACN,CAAC;QAED,IAAI,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAClE,OAAO;gBACH,SAAS,EAAE,MAAM,CAAC,SAAS;gBAC3B,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,QAAQ;gBACR,SAAS,EAAE,IAAI;aAClB,CAAC;QACN,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACb,sDAAsD;YACtD,0EAA0E;YAC1E,OAAO,CAAC,KAAK,CAAC,2CAA2C,QAAQ,GAAG,EAAE,KAAK,CAAC,CAAC;YAC7E,OAAO;gBACH,SAAS,EAAE,IAAI;gBACf,UAAU,EAAE,CAAC;gBACb,QAAQ;gBACR,SAAS,EAAE,IAAI;aAClB,CAAC;QACN,CAAC;IACL,CAAC;IAED;;;;;;;;OAQG;IACH,sBAAsB,CAAC,OAAe,EAAE,GAAW;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;CACJ;AAED,oCAAoC;AACpC,IAAI,cAAc,GAAuB,IAAI,CAAC;AAE9C;;GAEG;AACH,MAAM,UAAU,cAAc;IAC1B,IAAI,CAAC,cAAc,EAAE,CAAC;QAClB,cAAc,GAAG,IAAI,WAAW,EAAE,CAAC;IACvC,CAAC;IACD,OAAO,cAAc,CAAC;AAC1B,CAAC"}

package/package.json

@@ -0,0 +1,52 @@
+{
+    "name": "@sharc-code/mcp",
+    "version": "0.2.0",
+    "description": "SHARC MCP Server - Semantic code search for AI assistants",
+    "type": "module",
+    "main": "dist/index.js",
+    "types": "dist/index.d.ts",
+    "bin": "dist/index.js",
+    "scripts": {
+        "build": "bun run clean && tsc --build --force",
+        "dev": "tsx --watch src/index.ts",
+        "clean": "rimraf dist",
+        "lint": "eslint src --ext .ts",
+        "lint:fix": "eslint src --ext .ts --fix",
+        "typecheck": "tsc --noEmit",
+        "start": "tsx src/index.ts",
+        "start:with-env": "OPENAI_API_KEY=${OPENAI_API_KEY:your-api-key-here} MILVUS_ADDRESS=${MILVUS_ADDRESS:localhost:19530} tsx src/index.ts",
+        "prepublishOnly": "bun run build"
+    },
+    "dependencies": {
+        "@modelcontextprotocol/sdk": "^1.12.1",
+        "@sharc-code/splitter": "^0.2.0",
+        "chokidar": "^3.6.0",
+        "dotenv": "^17.2.3",
+        "zod": "^4.1.0"
+    },
+    "devDependencies": {
+        "@types/node": "^20.0.0",
+        "tsx": "^4.19.4",
+        "typescript": "^5.0.0"
+    },
+    "files": [
+        "dist",
+        "README.md"
+    ],
+    "keywords": [
+        "code-search",
+        "semantic-search",
+        "mcp",
+        "model-context-protocol",
+        "ai",
+        "embeddings",
+        "tree-sitter",
+        "ast"
+    ],
+    "author": "SHARC <npm@sharc.co>",
+    "homepage": "https://sharc.co",
+    "license": "MIT",
+    "publishConfig": {
+        "access": "public"
+    }
+}