vibecodingmachine-cli 2026.3.14-1537 → 2026.6.17-1956

package/src/commands/auto-direct/code-processor.js

@@ -15,7 +15,7 @@ function parseSearchReplaceBlocks(response) {
 
   // Match FILE: path SEARCH: ``` old ``` REPLACE: ``` new ``` format
   const fileBlockRegex = /FILE:\s*(.+?)\s*SEARCH:\s*```[\s\S]*?```[\s\S]*?REPLACE:\s*```[\s\S]*?```/g;
-  
+
   let match;
   while ((match = fileBlockRegex.exec(response)) !== null) {
     const fileBlock = match[0];
@@ -123,11 +123,11 @@ async function applyFileChange(change, repoPath) {
 
     // Try multiple window sizes (±5 lines) to account for LLM not including enough context
     const windowSizes = [0, 2, 5, 10, 15];
-    
+
     for (const windowSize of windowSizes) {
       // Try to find the search block with fuzzy matching
       let foundIndex = -1;
-      
+
       // First try exact match
       const exactMatch = content.indexOf(change.search);
       if (exactMatch !== -1) {
@@ -135,25 +135,25 @@ async function applyFileChange(change, repoPath) {
       } else {
         // Try fuzzy matching by looking for patterns
         const searchPattern = extractPattern(change.search);
-        
+
         for (let i = 0; i <= lines.length - searchLines.length; i++) {
-          const window = lines.slice(Math.max(0, i - windowSize), 
+          const window = lines.slice(Math.max(0, i - windowSize),
                                      Math.min(lines.length, i + searchLines.length + windowSize));
           const windowContent = window.join('\n');
           const windowPattern = extractPattern(windowContent);
-          
+
           // Check if patterns match and key identifiers are present
           if (windowPattern.includes(searchPattern) || searchPattern.includes(windowPattern)) {
             const windowIdentifiers = extractIdentifiers(windowContent);
             const commonIdentifiers = searchIdentifiers.filter(id => windowIdentifiers.includes(id));
-            
+
             // If we have enough common identifiers, consider it a match
             if (commonIdentifiers.length >= Math.min(3, searchIdentifiers.length)) {
               // Find the actual search block within this window
               const windowStart = Math.max(0, i - windowSize);
-              const windowText = lines.slice(windowStart, 
+              const windowText = lines.slice(windowStart,
                                             Math.min(lines.length, i + searchLines.length + windowSize)).join('\n');
-              
+
               // Try to find the best match within the window
               const bestMatch = findBestMatch(change.search, windowText);
               if (bestMatch.similarity > 0.7) { // 70% similarity threshold
@@ -170,18 +170,18 @@ async function applyFileChange(change, repoPath) {
         const beforeContent = content.substring(0, foundIndex);
         const afterContent = content.substring(foundIndex);
         const afterLines = afterContent.split('\n');
-        
+
         // Find the end of the block to replace
         let endLineIndex = 0;
         let currentLineContent = '';
-        
+
         for (let i = 0; i < afterLines.length; i++) {
           currentLineContent += (i > 0 ? '\n' : '') + afterLines[i];
-          
+
           // Check if we've found a block that matches our search
           const testContent = afterLines.slice(0, i + 1).join('\n');
           const similarity = calculateSimilarity(change.search, testContent);
-          
+
           if (similarity > 0.8 || i >= searchLines.length + 5) { // Allow some extra lines
             endLineIndex = i + 1;
             break;
@@ -189,11 +189,11 @@ async function applyFileChange(change, repoPath) {
         }
 
         // Replace the content
-        const newContent = beforeContent + change.replace + 
+        const newContent = beforeContent + change.replace +
                           afterLines.slice(endLineIndex).join('\n');
-        
+
         await fs.writeFile(fullPath, newContent);
-        
+
         console.log(chalk.green(`  ✅ Applied change to ${change.file}`));
         return { success: true };
       }
@@ -201,7 +201,7 @@ async function applyFileChange(change, repoPath) {
 
     console.log(chalk.yellow(`  ⚠️  Could not find matching block in ${change.file}`));
     return { success: false, error: 'Could not find matching block' };
-    
+
   } catch (error) {
     console.error(chalk.red(`  ❌ Error applying change to ${change.file}:`), error.message);
     return { success: false, error: error.message };
@@ -214,18 +214,18 @@ async function applyFileChange(change, repoPath) {
 function findBestMatch(searchText, textBlock) {
   const searchLines = searchText.split('\n');
   const textLines = textBlock.split('\n');
-  
+
   let bestMatch = { similarity: 0, offset: 0 };
-  
+
   for (let offset = 0; offset <= textLines.length - searchLines.length; offset++) {
     const testBlock = textLines.slice(offset, offset + searchLines.length).join('\n');
     const similarity = calculateSimilarity(searchText, testBlock);
-    
+
     if (similarity > bestMatch.similarity) {
       bestMatch = { similarity, offset };
     }
   }
-  
+
   return bestMatch;
 }
 
@@ -235,9 +235,9 @@ function findBestMatch(searchText, textBlock) {
 function calculateSimilarity(str1, str2) {
   const longer = str1.length > str2.length ? str1 : str2;
   const shorter = str1.length > str2.length ? str2 : str1;
-  
+
   if (longer.length === 0) return 1.0;
-  
+
   const editDistance = levenshteinDistance(longer, shorter);
   return (longer.length - editDistance) / longer.length;
 }
@@ -247,15 +247,15 @@ function calculateSimilarity(str1, str2) {
  */
 function levenshteinDistance(str1, str2) {
   const matrix = [];
-  
+
   for (let i = 0; i <= str2.length; i++) {
     matrix[i] = [i];
   }
-  
+
   for (let j = 0; j <= str1.length; j++) {
     matrix[0][j] = j;
   }
-  
+
   for (let i = 1; i <= str2.length; i++) {
     for (let j = 1; j <= str1.length; j++) {
       if (str2.charAt(i - 1) === str1.charAt(j - 1)) {
@@ -269,7 +269,7 @@ function levenshteinDistance(str1, str2) {
       }
     }
   }
-  
+
   return matrix[str2.length][str1.length];
 }
 

package/src/commands/auto-direct/file-scanner.js

@@ -32,10 +32,10 @@ async function findRelevantFiles(requirement, repoPath) {
     // Search for files containing keywords
     for (const pattern of patterns) {
       const files = await glob(pattern, { cwd: repoPath, ignore: ['**/node_modules/**', '**/.git/**'] });
-      
+
       for (const file of files) {
         const fullPath = path.join(repoPath, file);
-        
+
         // Skip if not a file
         if (!await fs.pathExists(fullPath) || !await fs.stat(fullPath).then(stat => stat.isFile())) {
           continue;
@@ -52,7 +52,7 @@ async function findRelevantFiles(requirement, repoPath) {
     // Remove duplicates and sort by relevance
     const uniqueFiles = [...new Set(relevantFiles)];
     return uniqueFiles.slice(0, 20); // Limit to top 20 files
-    
+
   } catch (error) {
     console.error('Error finding relevant files:', error.message);
     return [];
@@ -68,7 +68,7 @@ async function readFileSnippets(files, repoPath, requirement) {
   for (const file of files) {
     try {
       const fullPath = path.join(repoPath, file);
-      
+
       if (!await fs.pathExists(fullPath)) {
         continue;
       }
@@ -84,7 +84,7 @@ async function readFileSnippets(files, repoPath, requirement) {
         // Try to find relevant sections based on requirement keywords
         const keywords = extractKeywords(requirement);
         const relevantSections = findRelevantSections(lines, keywords);
-        
+
         if (relevantSections.length > 0) {
           // Use the most relevant section
           const section = relevantSections[0];
@@ -97,7 +97,7 @@ async function readFileSnippets(files, repoPath, requirement) {
       }
 
       const snippet = lines.slice(startLine, endLine).join('\n');
-      
+
       snippets.push({
         file,
         content: snippet,
@@ -158,9 +158,9 @@ async function isFileRelevant(filePath, keywords) {
   try {
     const content = await fs.readFile(filePath, 'utf8');
     const lowerContent = content.toLowerCase();
-    
+
     // Check if any keywords are present in the file
-    return keywords.some(keyword => 
+    return keywords.some(keyword =>
       lowerContent.includes(keyword.toLowerCase())
     );
   } catch (error) {
@@ -173,16 +173,16 @@ async function isFileRelevant(filePath, keywords) {
  */
 function findRelevantSections(lines, keywords) {
   const sections = [];
-  
+
   keywords.forEach(keyword => {
     const lowerKeyword = keyword.toLowerCase();
-    
+
     lines.forEach((line, index) => {
       if (line.toLowerCase().includes(lowerKeyword)) {
         // Found a keyword, create a section around it
         const start = Math.max(0, index - 5);
         const end = Math.min(lines.length, index + 15);
-        
+
         sections.push({
           keyword,
           start,
@@ -209,27 +209,27 @@ function findRelevantSections(lines, keywords) {
  */
 function calculateRelevanceScore(line) {
   let score = 0;
-  
+
   // Higher score for function/class definitions
   if (line.includes('function ') || line.includes('class ') || line.includes('const ')) {
     score += 10;
   }
-  
+
   // Higher score for exports
   if (line.includes('module.exports') || line.includes('export ')) {
     score += 8;
   }
-  
+
   // Higher score for imports/requires
   if (line.includes('require(') || line.includes('import ')) {
     score += 5;
   }
-  
+
   // Higher score for comments
   if (line.includes('//') || line.includes('*') || line.includes('/*')) {
     score += 3;
   }
-  
+
   return score;
 }
 
@@ -240,16 +240,16 @@ async function glob(pattern, options = {}) {
   const { cwd = process.cwd(), ignore = [] } = options;
   const { promisify } = require('util');
   const { exec } = require('child_process');
-  
+
   try {
     const { stdout } = await promisify(exec)(`find . -name "${pattern.replace('**/', '*')}"`, { cwd });
     let files = stdout.trim().split('\n').filter(file => file);
-    
+
     // Apply ignore patterns
     ignore.forEach(ignorePattern => {
       files = files.filter(file => !file.includes(ignorePattern.replace('**/', '')));
     });
-    
+
     return files;
   } catch (error) {
     return [];