cntx-ui 3.0.7 → 3.0.9

package/lib/mcp-transport.js

@@ -1,97 +0,0 @@
-import { MCPServer } from './mcp-server.js';
-
-export class MCPTransport {
-  constructor(cntxServer) {
-    this.mcpServer = new MCPServer(cntxServer);
-    this.buffer = '';
-  }
-
-  // Start stdio transport
-  start() {
-    console.error('🚀 MCP server starting on stdio transport');
-    
-    // Handle incoming messages from stdin
-    process.stdin.on('data', (data) => {
-      this.handleIncomingData(data.toString());
-    });
-
-    // Handle process cleanup
-    process.on('SIGINT', () => {
-      console.error('📡 MCP server shutting down');
-      process.exit(0);
-    });
-
-    process.on('SIGTERM', () => {
-      console.error('📡 MCP server shutting down');
-      process.exit(0);
-    });
-
-    // Set stdin to raw mode for proper JSON-RPC communication
-    process.stdin.setEncoding('utf8');
-    
-    console.error('✅ MCP server ready for JSON-RPC messages');
-  }
-
-  // Handle incoming data and parse JSON-RPC messages
-  async handleIncomingData(data) {
-    this.buffer += data;
-    
-    // Split by newlines to handle multiple messages
-    const lines = this.buffer.split('\n');
-    this.buffer = lines.pop() || ''; // Keep incomplete line in buffer
-
-    for (const line of lines) {
-      if (line.trim()) {
-        try {
-          const message = JSON.parse(line.trim());
-          await this.processMessage(message);
-        } catch (error) {
-          console.error('❌ Failed to parse JSON-RPC message:', error.message);
-          this.sendError(null, -32700, 'Parse error');
-        }
-      }
-    }
-  }
-
-  // Process a single JSON-RPC message
-  async processMessage(message) {
-    try {
-      const response = await this.mcpServer.handleMessage(message);
-      
-      // Only send response if not null (notifications don't need responses)
-      if (response !== null) {
-        this.sendMessage(response);
-      }
-    } catch (error) {
-      console.error('❌ Error processing message:', error.message);
-      this.sendError(message.id || null, -32603, 'Internal error');
-    }
-  }
-
-  // Send a message via stdout
-  sendMessage(message) {
-    const messageStr = JSON.stringify(message);
-    process.stdout.write(messageStr + '\n');
-  }
-
-  // Send an error response
-  sendError(id, code, message, data = null) {
-    const error = { code, message };
-    if (data) error.data = data;
-    
-    const response = {
-      jsonrpc: '2.0',
-      id,
-      error
-    };
-    
-    this.sendMessage(response);
-  }
-}
-
-// Factory function to start MCP transport
-export function startMCPTransport(cntxServer) {
-  const transport = new MCPTransport(cntxServer);
-  transport.start();
-  return transport;
-}

package/lib/semantic-splitter.js

@@ -1,304 +0,0 @@
-/**
- * Semantic Splitter - High-Performance AST-based Chunker
- * Uses tree-sitter for surgical, function-level code extraction
- * Integrated with HeuristicsManager for intelligent categorization
- */
-
-import { readFileSync, existsSync } from 'fs'
-import { join, extname } from 'path'
-import Parser from 'tree-sitter'
-import JavaScript from 'tree-sitter-javascript'
-import TypeScript from 'tree-sitter-typescript'
-import HeuristicsManager from './heuristics-manager.js'
-
-export default class SemanticSplitter {
-  constructor(options = {}) {
-    this.options = {
-      maxChunkSize: 3000,       // Max chars per chunk
-      includeContext: true,     // Include imports/types needed
-      minFunctionSize: 40,      // Skip tiny functions
-      ...options
-    }
-    
-    // Initialize tree-sitter parsers
-    this.parsers = {
-      javascript: new Parser(),
-      typescript: new Parser(),
-      tsx: new Parser()
-    }
-    this.parsers.javascript.setLanguage(JavaScript)
-    this.parsers.typescript.setLanguage(TypeScript.typescript)
-    this.parsers.tsx.setLanguage(TypeScript.tsx)
-
-    this.heuristicsManager = new HeuristicsManager()
-  }
-
-  getParser(filePath) {
-    const ext = extname(filePath)
-    switch (ext) {
-      case '.ts': return this.parsers.typescript
-      case '.tsx': return this.parsers.tsx
-      default: return this.parsers.javascript
-    }
-  }
-
-  /**
-   * Main entry point - extract semantic chunks from project
-   * Now accepts a pre-filtered list of files from FileSystemManager
-   */
-  async extractSemanticChunks(projectPath, files = [], bundleConfig = null) {
-    console.log('🔪 Starting surgical semantic splitting via tree-sitter...')
-    console.log(`📂 Project path: ${projectPath}`)
-    
-    this.bundleConfig = bundleConfig
-    console.log(`📁 Processing ${files.length} filtered files`)
-    
-    const allChunks = []
-    
-    for (const filePath of files) {
-      try {
-        const fileChunks = this.processFile(filePath, projectPath)
-        allChunks.push(...fileChunks)
-      } catch (error) {
-        console.warn(`Failed to process ${filePath}: ${error.message}`)
-      }
-    }
-    
-    console.log(`🧩 Created ${allChunks.length} semantic chunks across project`)
-    return {
-      summary: {
-        totalFiles: files.length,
-        totalChunks: allChunks.length,
-        averageSize: allChunks.length > 0 ? allChunks.reduce((sum, c) => sum + c.code.length, 0) / allChunks.length : 0
-      },
-      chunks: allChunks
-    }
-  }
-
-  processFile(relativePath, projectPath) {
-    const fullPath = join(projectPath, relativePath)
-    if (!existsSync(fullPath)) return []
-    
-    const content = readFileSync(fullPath, 'utf8')
-    const parser = this.getParser(relativePath)
-    const tree = parser.parse(content)
-    const root = tree.rootNode
-    
-    const elements = {
-      functions: [],
-      types: [],
-      imports: this.extractImports(root, content, relativePath)
-    }
-
-    // Traverse AST for functions and types
-    this.traverse(root, content, relativePath, elements)
-
-    // Create chunks from elements
-    return this.createChunks(elements, content, relativePath)
-  }
-
-  traverse(node, content, filePath, elements) {
-    // Detect Function Declarations
-    if (node.type === 'function_declaration' || node.type === 'method_definition' || node.type === 'arrow_function') {
-      const func = this.mapFunctionNode(node, content, filePath)
-      if (func && func.code.length > this.options.minFunctionSize) {
-        elements.functions.push(func)
-      }
-    }
-
-    // Detect Type Definitions (TS)
-    if (node.type === 'interface_declaration' || node.type === 'type_alias_declaration') {
-      const typeDef = this.mapTypeNode(node, content, filePath)
-      if (typeDef) elements.types.push(typeDef)
-    }
-
-    // Recurse unless we've already captured the block (like a function body)
-    if (node.type !== 'function_declaration' && node.type !== 'method_definition') {
-      for (let i = 0; i < node.namedChildCount; i++) {
-        this.traverse(node.namedChild(i), content, filePath, elements)
-      }
-    }
-  }
-
-  mapFunctionNode(node, content, filePath) {
-    let name = 'anonymous';
-    
-    // Find name identifier based on node type
-    if (node.type === 'function_declaration' || node.type === 'method_definition') {
-      const nameNode = node.childForFieldName('name');
-      if (nameNode) name = content.slice(nameNode.startIndex, nameNode.endIndex);
-    } else if (node.type === 'arrow_function') {
-      // 1. Check if assigned to a variable: const foo = () => {}
-      const parent = node.parent;
-      if (parent && parent.type === 'variable_declarator') {
-        const nameNode = parent.childForFieldName('name');
-        if (nameNode) name = content.slice(nameNode.startIndex, nameNode.endIndex);
-      }
-      // 2. Check if part of an object property: { foo: () => {} }
-      else if (parent && parent.type === 'pair') {
-        const keyNode = parent.childForFieldName('key');
-        if (keyNode) name = content.slice(keyNode.startIndex, keyNode.endIndex);
-      }
-      // 3. Check if part of an assignment: this.foo = () => {}
-      else if (parent && parent.type === 'assignment_expression') {
-        const leftNode = parent.childForFieldName('left');
-        if (leftNode) name = content.slice(leftNode.startIndex, leftNode.endIndex);
-      }
-    }
-
-    const code = content.slice(node.startIndex, node.endIndex)
-    
-    return {
-      name,
-      type: node.type,
-      filePath,
-      startLine: node.startPosition.row + 1,
-      code,
-      isExported: this.isExported(node),
-      isAsync: code.includes('async')
-    }
-  }
-
-  mapTypeNode(node, content, filePath) {
-    const nameNode = node.childForFieldName('name')
-    if (!nameNode) return null
-    
-    return {
-      name: content.slice(nameNode.startIndex, nameNode.endIndex),
-      type: node.type,
-      filePath,
-      startLine: node.startPosition.row + 1,
-      code: content.slice(node.startIndex, node.endIndex),
-      isExported: this.isExported(node)
-    }
-  }
-
-  extractImports(root, content, filePath) {
-    const imports = []
-    // Simple traversal for import statements
-    for (let i = 0; i < root.namedChildCount; i++) {
-      const node = root.namedChild(i)
-      if (node.type === 'import_statement') {
-        imports.push({
-          statement: content.slice(node.startIndex, node.endIndex),
-          filePath
-        })
-      }
-    }
-    return imports
-  }
-
-  isExported(node) {
-    let current = node
-    while (current) {
-      if (current.type === 'export_statement') return true
-      current = current.parent
-    }
-    return false
-  }
-
-  createChunks(elements, content, filePath) {
-    const chunks = [];
-    const pathParts = filePath.toLowerCase().split(/[\\\/]/);
-    
-    for (const func of elements.functions) {
-      // Pass full context to heuristics
-      const heuristicContext = {
-        ...func,
-        includes: elements,
-        pathParts
-      };
-      
-      const purpose = this.heuristicsManager.determinePurpose(heuristicContext);
-      const businessDomain = this.heuristicsManager.inferBusinessDomains(heuristicContext);
-      const technicalPatterns = this.heuristicsManager.inferTechnicalPatterns(heuristicContext);
-      const tags = this.generateTags(func);
-
-      let chunkCode = '';
-      if (this.options.includeContext) {
-        const relevantImports = elements.imports
-          .filter(imp => this.isImportRelevant(imp.statement, func.code))
-          .map(imp => imp.statement)
-          .join('\n');
-        
-        if (relevantImports) chunkCode += relevantImports + '\n\n';
-      }
-      chunkCode += func.code;
-
-      chunks.push({
-        id: `${filePath}:${func.name}:${func.startLine}`,
-        name: func.name,
-        filePath,
-        type: 'function',
-        subtype: func.type,
-        code: chunkCode,
-        startLine: func.startLine,
-        complexity: this.calculateComplexity(func.code),
-        purpose,
-        tags,
-        businessDomain,
-        technicalPatterns,
-        includes: {
-          imports: elements.imports.map(i => i.statement),
-          types: elements.types.map(t => t.name)
-        },
-        bundles: this.getFileBundles(filePath)
-      });
-    }
-    
-    return chunks;
-  }
-
-  isImportRelevant(importStatement, functionCode) {
-    // Heuristic: does the function use any name from the import?
-    const match = importStatement.match(/import\s+(?:\{([^}]+)\}|(\w+))/i)
-    if (!match) return false
-    const importedNames = match[1] ? match[1].split(',').map(n => n.trim()) : [match[2]]
-    return importedNames.some(name => functionCode.includes(name))
-  }
-
-  calculateComplexity(code) {
-    const indicators = ['if', 'else', 'for', 'while', 'switch', 'case', 'catch', '?', '&&', '||'];
-    let score = 1;
-    indicators.forEach(ind => {
-      // Escape special regex characters
-      const escaped = ind.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
-      // Only use word boundaries for word-like indicators
-      const pattern = /^[a-zA-Z]+$/.test(ind) ? `\\b${escaped}\\b` : escaped;
-      const regex = new RegExp(pattern, 'g');
-      score += (code.match(regex) || []).length;
-    });
-    return {
-      score,
-      level: score < 5 ? 'low' : score < 15 ? 'medium' : 'high'
-    };
-  }
-
-  generateTags(func) {
-    const tags = [func.type]
-    if (func.isExported) tags.push('exported')
-    if (func.isAsync) tags.push('async')
-    if (func.code.length > 2000) tags.push('large')
-    return tags
-  }
-
-  getFileBundles(filePath) {
-    if (!this.bundleConfig?.bundles) return []
-    const bundles = []
-    for (const [name, patterns] of Object.entries(this.bundleConfig.bundles)) {
-      if (name === 'master') continue
-      for (const pattern of patterns) {
-        if (this.matchesPattern(filePath, pattern)) {
-          bundles.push(name)
-          break
-        }
-      }
-    }
-    return bundles
-  }
-
-  matchesPattern(filePath, pattern) {
-    const regex = pattern.replace(/\*\*/g, '.*').replace(/\*/g, '[^/]*').replace(/\./g, '\\.')
-    return new RegExp(`^${regex}$`).test(filePath)
-  }
-}

package/lib/simple-vector-store.js

@@ -1,108 +0,0 @@
-/**
- * Simple Vector Store with SQLite Persistence
- * Powered by Transformers.js for local embeddings
- * Persists vectors to SQLite for instant startup
- */
-
-import { pipeline } from '@xenova/transformers';
-
-export default class SimpleVectorStore {
-  constructor(databaseManager, options = {}) {
-    this.db = databaseManager;
-    this.modelName = options.modelName || 'Xenova/all-MiniLM-L6-v2';
-    this.pipe = null;
-    this.initialized = false;
-  }
-
-  async init() {
-    if (this.initialized) return;
-    console.log(`🤖 Initializing local RAG engine (${this.modelName})...`);
-    this.pipe = await pipeline('feature-extraction', this.modelName);
-    this.initialized = true;
-    console.log('✅ Local RAG engine ready');
-  }
-
-  async generateEmbedding(text) {
-    await this.init();
-    const output = await this.pipe(text, { pooling: 'mean', normalize: true });
-    return new Float32Array(output.data);
-  }
-
-  /**
-   * Upsert a chunk's embedding to persistence
-   */
-  async upsertChunk(chunk) {
-    const chunkId = chunk.id;
-    // Check if we already have it in DB
-    const existing = this.db.getEmbedding(chunkId);
-    if (existing) return existing;
-
-    // Generate new embedding
-    const textToEmbed = `${chunk.name} ${chunk.purpose} ${chunk.code}`;
-    const embedding = await this.generateEmbedding(textToEmbed);
-    
-    // Save to SQLite
-    this.db.saveEmbedding(chunkId, embedding, this.modelName);
-    return embedding;
-  }
-
-  /**
-   * Semantic Search across persistent embeddings
-   */
-  async search(query, options = {}) {
-    const { limit = 10, threshold = 0.5 } = options;
-    const queryEmbedding = await this.generateEmbedding(query);
-    
-    // Load all embeddings from DB
-    const rows = this.db.db.prepare('SELECT chunk_id, embedding FROM vector_embeddings WHERE model_name = ?').all(this.modelName);
-    
-    const results = [];
-    const batchSize = 100;
-    
-    // Process in batches to prevent blocking the event loop
-    for (let i = 0; i < rows.length; i += batchSize) {
-      const batch = rows.slice(i, i + batchSize);
-      
-      for (const row of batch) {
-        const embedding = new Float32Array(row.embedding.buffer, row.embedding.byteOffset, row.embedding.byteLength / 4);
-        const similarity = this.cosineSimilarity(queryEmbedding, embedding);
-        
-        if (similarity >= threshold) {
-          results.push({
-            chunkId: row.chunk_id,
-            similarity
-          });
-        }
-      }
-      
-      // Give other tasks a chance to run
-      if (i + batchSize < rows.length) {
-        await new Promise(resolve => setImmediate(resolve));
-      }
-    }
-
-    // Sort by similarity and get chunk details
-    return results
-      .sort((a, b) => b.similarity - a.similarity)
-      .slice(0, limit)
-      .map(res => {
-        const chunk = this.db.db.prepare('SELECT * FROM semantic_chunks WHERE id = ?').get(res.chunkId);
-        return {
-          ...this.db.mapChunkRow(chunk),
-          similarity: res.similarity
-        };
-      });
-  }
-
-  cosineSimilarity(vecA, vecB) {
-    let dotProduct = 0;
-    let normA = 0;
-    let normB = 0;
-    for (let i = 0; i < vecA.length; i++) {
-      dotProduct += vecA[i] * vecB[i];
-      normA += vecA[i] * vecA[i];
-      normB += vecB[i] * vecB[i];
-    }
-    return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));
-  }
-}