@su-record/vibe 2.3.2 → 2.4.0

package/dist/lib/MemoryManager.js

@@ -102,37 +102,37 @@ export class MemoryManager {
     }
     initializeDatabase() {
         // Create memories table
-        this.db.exec(`
-      CREATE TABLE IF NOT EXISTS memories (
-        key TEXT PRIMARY KEY,
-        value TEXT NOT NULL,
-        category TEXT NOT NULL DEFAULT 'general',
-        timestamp TEXT NOT NULL,
-        lastAccessed TEXT NOT NULL,
-        priority INTEGER DEFAULT 0
-      );
-
-      CREATE INDEX IF NOT EXISTS idx_category ON memories(category);
-      CREATE INDEX IF NOT EXISTS idx_timestamp ON memories(timestamp);
-      CREATE INDEX IF NOT EXISTS idx_priority ON memories(priority);
-      CREATE INDEX IF NOT EXISTS idx_lastAccessed ON memories(lastAccessed);
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS memories (
+        key TEXT PRIMARY KEY,
+        value TEXT NOT NULL,
+        category TEXT NOT NULL DEFAULT 'general',
+        timestamp TEXT NOT NULL,
+        lastAccessed TEXT NOT NULL,
+        priority INTEGER DEFAULT 0
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_category ON memories(category);
+      CREATE INDEX IF NOT EXISTS idx_timestamp ON memories(timestamp);
+      CREATE INDEX IF NOT EXISTS idx_priority ON memories(priority);
+      CREATE INDEX IF NOT EXISTS idx_lastAccessed ON memories(lastAccessed);
     `);
         // v2.0: Create memory_relations table for Knowledge Graph
-        this.db.exec(`
-      CREATE TABLE IF NOT EXISTS memory_relations (
-        id INTEGER PRIMARY KEY AUTOINCREMENT,
-        sourceKey TEXT NOT NULL,
-        targetKey TEXT NOT NULL,
-        relationType TEXT NOT NULL,
-        strength REAL DEFAULT 1.0,
-        metadata TEXT,
-        timestamp TEXT NOT NULL,
-        UNIQUE(sourceKey, targetKey, relationType)
-      );
-
-      CREATE INDEX IF NOT EXISTS idx_rel_source ON memory_relations(sourceKey);
-      CREATE INDEX IF NOT EXISTS idx_rel_target ON memory_relations(targetKey);
-      CREATE INDEX IF NOT EXISTS idx_rel_type ON memory_relations(relationType);
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS memory_relations (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        sourceKey TEXT NOT NULL,
+        targetKey TEXT NOT NULL,
+        relationType TEXT NOT NULL,
+        strength REAL DEFAULT 1.0,
+        metadata TEXT,
+        timestamp TEXT NOT NULL,
+        UNIQUE(sourceKey, targetKey, relationType)
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_rel_source ON memory_relations(sourceKey);
+      CREATE INDEX IF NOT EXISTS idx_rel_target ON memory_relations(targetKey);
+      CREATE INDEX IF NOT EXISTS idx_rel_type ON memory_relations(relationType);
     `);
         // Enable WAL mode for better concurrency
         this.db.pragma('journal_mode = WAL');
@@ -142,10 +142,10 @@ export class MemoryManager {
     initializePreparedStatements() {
         // Pre-compile recall statement
         try {
-            this.recallStmt = this.db.prepare(`
-        UPDATE memories SET lastAccessed = ?
-        WHERE key = ?
-        RETURNING *
+            this.recallStmt = this.db.prepare(`
+        UPDATE memories SET lastAccessed = ?
+        WHERE key = ?
+        RETURNING *
       `);
         }
         catch (error) {
@@ -155,9 +155,9 @@ export class MemoryManager {
             this.recallUpdateStmt = this.db.prepare(`UPDATE memories SET lastAccessed = ? WHERE key = ?`);
         }
         // Pre-compile save statement
-        this.saveStmt = this.db.prepare(`
-      INSERT OR REPLACE INTO memories (key, value, category, timestamp, lastAccessed, priority)
-      VALUES (?, ?, ?, ?, ?, ?)
+        this.saveStmt = this.db.prepare(`
+      INSERT OR REPLACE INTO memories (key, value, category, timestamp, lastAccessed, priority)
+      VALUES (?, ?, ?, ?, ?, ?)
     `);
     }
     /**
@@ -193,9 +193,9 @@ export class MemoryManager {
      * Import memories into SQLite database
      */
     importMemories(memories) {
-        const insert = this.db.prepare(`
-      INSERT OR REPLACE INTO memories (key, value, category, timestamp, lastAccessed, priority)
-      VALUES (?, ?, ?, ?, ?, ?)
+        const insert = this.db.prepare(`
+      INSERT OR REPLACE INTO memories (key, value, category, timestamp, lastAccessed, priority)
+      VALUES (?, ?, ?, ?, ?, ?)
     `);
         const insertMany = this.db.transaction((items) => {
             for (const item of items) {
@@ -230,9 +230,9 @@ export class MemoryManager {
         }
         else {
             // Fallback if prepared statement not available
-            const stmt = this.db.prepare(`
-        INSERT OR REPLACE INTO memories (key, value, category, timestamp, lastAccessed, priority)
-        VALUES (?, ?, ?, ?, ?, ?)
+            const stmt = this.db.prepare(`
+        INSERT OR REPLACE INTO memories (key, value, category, timestamp, lastAccessed, priority)
+        VALUES (?, ?, ?, ?, ?, ?)
       `);
             stmt.run(key, value, category, timestamp, timestamp, priority);
         }
@@ -267,8 +267,8 @@ export class MemoryManager {
     delete(key) {
         // Also delete related relations
         this.db.prepare(`DELETE FROM memory_relations WHERE sourceKey = ? OR targetKey = ?`).run(key, key);
-        const stmt = this.db.prepare(`
-      DELETE FROM memories WHERE key = ?
+        const stmt = this.db.prepare(`
+      DELETE FROM memories WHERE key = ?
     `);
         const result = stmt.run(key);
         return result.changes > 0;
@@ -281,10 +281,10 @@ export class MemoryManager {
      */
     update(key, value) {
         const timestamp = new Date().toISOString();
-        const stmt = this.db.prepare(`
-      UPDATE memories
-      SET value = ?, timestamp = ?, lastAccessed = ?
-      WHERE key = ?
+        const stmt = this.db.prepare(`
+      UPDATE memories
+      SET value = ?, timestamp = ?, lastAccessed = ?
+      WHERE key = ?
     `);
         const result = stmt.run(value, timestamp, timestamp, key);
         return result.changes > 0;
@@ -297,16 +297,16 @@ export class MemoryManager {
     list(category) {
         let stmt;
         if (category) {
-            stmt = this.db.prepare(`
-        SELECT * FROM memories WHERE category = ?
-        ORDER BY priority DESC, timestamp DESC
+            stmt = this.db.prepare(`
+        SELECT * FROM memories WHERE category = ?
+        ORDER BY priority DESC, timestamp DESC
       `);
             return stmt.all(category);
         }
         else {
-            stmt = this.db.prepare(`
-        SELECT * FROM memories
-        ORDER BY priority DESC, timestamp DESC
+            stmt = this.db.prepare(`
+        SELECT * FROM memories
+        ORDER BY priority DESC, timestamp DESC
       `);
             return stmt.all();
         }
@@ -317,10 +317,10 @@ export class MemoryManager {
      * @returns Array of matching memory items
      */
     search(query) {
-        const stmt = this.db.prepare(`
-      SELECT * FROM memories
-      WHERE key LIKE ? OR value LIKE ?
-      ORDER BY priority DESC, timestamp DESC
+        const stmt = this.db.prepare(`
+      SELECT * FROM memories
+      WHERE key LIKE ? OR value LIKE ?
+      ORDER BY priority DESC, timestamp DESC
     `);
         const pattern = `%${query}%`;
         return stmt.all(pattern, pattern);
@@ -331,10 +331,10 @@ export class MemoryManager {
      * @returns Array of memory items with specified priority
      */
     getByPriority(priority) {
-        const stmt = this.db.prepare(`
-      SELECT * FROM memories
-      WHERE priority = ?
-      ORDER BY timestamp DESC
+        const stmt = this.db.prepare(`
+      SELECT * FROM memories
+      WHERE priority = ?
+      ORDER BY timestamp DESC
     `);
         return stmt.all(priority);
     }
@@ -345,8 +345,8 @@ export class MemoryManager {
      * @returns True if updated successfully
      */
     setPriority(key, priority) {
-        const stmt = this.db.prepare(`
-      UPDATE memories SET priority = ? WHERE key = ?
+        const stmt = this.db.prepare(`
+      UPDATE memories SET priority = ? WHERE key = ?
     `);
         const result = stmt.run(priority, key);
         return result.changes > 0;
@@ -357,10 +357,10 @@ export class MemoryManager {
      */
     getStats() {
         // Single query with ROLLUP or combined approach
-        const categories = this.db.prepare(`
-      SELECT category, COUNT(*) as count
-      FROM memories
-      GROUP BY category
+        const categories = this.db.prepare(`
+      SELECT category, COUNT(*) as count
+      FROM memories
+      GROUP BY category
     `).all();
         const byCategory = {};
         let total = 0;
@@ -385,10 +385,10 @@ export class MemoryManager {
         const timestamp = new Date().toISOString();
         const metadataJson = metadata ? JSON.stringify(metadata) : null;
         try {
-            const stmt = this.db.prepare(`
-        INSERT OR REPLACE INTO memory_relations
-        (sourceKey, targetKey, relationType, strength, metadata, timestamp)
-        VALUES (?, ?, ?, ?, ?, ?)
+            const stmt = this.db.prepare(`
+        INSERT OR REPLACE INTO memory_relations
+        (sourceKey, targetKey, relationType, strength, metadata, timestamp)
+        VALUES (?, ?, ?, ?, ?, ?)
       `);
             stmt.run(sourceKey, targetKey, relationType, strength, metadataJson, timestamp);
             return true;
@@ -644,9 +644,9 @@ export class MemoryManager {
         }
     }
     searchKeyword(query, limit, category) {
-        let sql = `
-      SELECT * FROM memories
-      WHERE (key LIKE ? OR value LIKE ?)
+        let sql = `
+      SELECT * FROM memories
+      WHERE (key LIKE ? OR value LIKE ?)
     `;
         const params = [`%${query}%`, `%${query}%`];
         if (category) {
@@ -658,32 +658,32 @@ export class MemoryManager {
         return this.db.prepare(sql).all(...params);
     }
     searchTemporal(query, limit) {
-        const sql = `
-      SELECT * FROM memories
-      WHERE key LIKE ? OR value LIKE ?
-      ORDER BY timestamp DESC
-      LIMIT ?
+        const sql = `
+      SELECT * FROM memories
+      WHERE key LIKE ? OR value LIKE ?
+      ORDER BY timestamp DESC
+      LIMIT ?
     `;
         return this.db.prepare(sql).all(`%${query}%`, `%${query}%`, limit);
     }
     searchByPriority(query, limit) {
-        const sql = `
-      SELECT * FROM memories
-      WHERE key LIKE ? OR value LIKE ?
-      ORDER BY priority DESC, lastAccessed DESC
-      LIMIT ?
+        const sql = `
+      SELECT * FROM memories
+      WHERE key LIKE ? OR value LIKE ?
+      ORDER BY priority DESC, lastAccessed DESC
+      LIMIT ?
     `;
         return this.db.prepare(sql).all(`%${query}%`, `%${query}%`, limit);
     }
     searchContextAware(query, limit, category) {
         // Combined strategy: keyword + priority + recency
-        let sql = `
-      SELECT *,
-        (CASE WHEN key LIKE ? THEN 3 ELSE 0 END +
-         CASE WHEN value LIKE ? THEN 2 ELSE 0 END +
-         priority * 0.5) as relevance_score
-      FROM memories
-      WHERE key LIKE ? OR value LIKE ?
+        let sql = `
+      SELECT *,
+        (CASE WHEN key LIKE ? THEN 3 ELSE 0 END +
+         CASE WHEN value LIKE ? THEN 2 ELSE 0 END +
+         priority * 0.5) as relevance_score
+      FROM memories
+      WHERE key LIKE ? OR value LIKE ?
     `;
         const params = [`%${query}%`, `%${query}%`, `%${query}%`, `%${query}%`];
         if (category) {

package/dist/lib/PythonParser.js

@@ -35,114 +35,114 @@ function getPythonCommand() {
 const PYTHON_CMD = getPythonCommand();
 export class PythonParser {
     static cleanupRegistered = false;
-    static pythonScript = `
-import ast
-import sys
-import json
-
-def analyze_code(code):
-    try:
-        tree = ast.parse(code)
-        symbols = []
-
-        for node in ast.walk(tree):
-            if isinstance(node, ast.FunctionDef):
-                symbols.append({
-                    'name': node.name,
-                    'kind': 'function',
-                    'line': node.lineno,
-                    'column': node.col_offset,
-                    'endLine': node.end_lineno,
-                    'docstring': ast.get_docstring(node)
-                })
-            elif isinstance(node, ast.ClassDef):
-                symbols.append({
-                    'name': node.name,
-                    'kind': 'class',
-                    'line': node.lineno,
-                    'column': node.col_offset,
-                    'endLine': node.end_lineno,
-                    'docstring': ast.get_docstring(node)
-                })
-            elif isinstance(node, ast.Assign):
-                for target in node.targets:
-                    if isinstance(target, ast.Name):
-                        symbols.append({
-                            'name': target.id,
-                            'kind': 'variable',
-                            'line': node.lineno,
-                            'column': node.col_offset
-                        })
-            elif isinstance(node, ast.Import) or isinstance(node, ast.ImportFrom):
-                for alias in node.names:
-                    symbols.append({
-                        'name': alias.name,
-                        'kind': 'import',
-                        'line': node.lineno,
-                        'column': node.col_offset
-                    })
-
-        return {'success': True, 'symbols': symbols}
-    except SyntaxError as e:
-        return {'success': False, 'error': str(e)}
-    except Exception as e:
-        return {'success': False, 'error': str(e)}
-
-def calculate_complexity(code):
-    try:
-        tree = ast.parse(code)
-
-        def cyclomatic_complexity(node):
-            complexity = 1
-            for child in ast.walk(node):
-                if isinstance(child, (ast.If, ast.For, ast.While, ast.And, ast.Or, ast.ExceptHandler)):
-                    complexity += 1
-                elif isinstance(child, ast.BoolOp):
-                    complexity += len(child.values) - 1
-            return complexity
-
-        functions = []
-        classes = []
-        total_complexity = 1
-
-        for node in ast.walk(tree):
-            if isinstance(node, ast.FunctionDef):
-                func_complexity = cyclomatic_complexity(node)
-                functions.append({
-                    'name': node.name,
-                    'complexity': func_complexity,
-                    'line': node.lineno
-                })
-                total_complexity += func_complexity
-            elif isinstance(node, ast.ClassDef):
-                method_count = sum(1 for n in node.body if isinstance(n, ast.FunctionDef))
-                classes.append({
-                    'name': node.name,
-                    'methods': method_count,
-                    'line': node.lineno
-                })
-
-        return {
-            'success': True,
-            'cyclomaticComplexity': total_complexity,
-            'functions': functions,
-            'classes': classes
-        }
-    except Exception as e:
-        return {'success': False, 'error': str(e)}
-
-if __name__ == '__main__':
-    code = sys.stdin.read()
-    action = sys.argv[1] if len(sys.argv) > 1 else 'symbols'
-
-    if action == 'symbols':
-        result = analyze_code(code)
-    elif action == 'complexity':
-        result = calculate_complexity(code)
-    else:
-        result = {'success': False, 'error': 'Unknown action'}
-
-    print(json.dumps(result))
+    static pythonScript = `
+import ast
+import sys
+import json
+
+def analyze_code(code):
+    try:
+        tree = ast.parse(code)
+        symbols = []
+
+        for node in ast.walk(tree):
+            if isinstance(node, ast.FunctionDef):
+                symbols.append({
+                    'name': node.name,
+                    'kind': 'function',
+                    'line': node.lineno,
+                    'column': node.col_offset,
+                    'endLine': node.end_lineno,
+                    'docstring': ast.get_docstring(node)
+                })
+            elif isinstance(node, ast.ClassDef):
+                symbols.append({
+                    'name': node.name,
+                    'kind': 'class',
+                    'line': node.lineno,
+                    'column': node.col_offset,
+                    'endLine': node.end_lineno,
+                    'docstring': ast.get_docstring(node)
+                })
+            elif isinstance(node, ast.Assign):
+                for target in node.targets:
+                    if isinstance(target, ast.Name):
+                        symbols.append({
+                            'name': target.id,
+                            'kind': 'variable',
+                            'line': node.lineno,
+                            'column': node.col_offset
+                        })
+            elif isinstance(node, ast.Import) or isinstance(node, ast.ImportFrom):
+                for alias in node.names:
+                    symbols.append({
+                        'name': alias.name,
+                        'kind': 'import',
+                        'line': node.lineno,
+                        'column': node.col_offset
+                    })
+
+        return {'success': True, 'symbols': symbols}
+    except SyntaxError as e:
+        return {'success': False, 'error': str(e)}
+    except Exception as e:
+        return {'success': False, 'error': str(e)}
+
+def calculate_complexity(code):
+    try:
+        tree = ast.parse(code)
+
+        def cyclomatic_complexity(node):
+            complexity = 1
+            for child in ast.walk(node):
+                if isinstance(child, (ast.If, ast.For, ast.While, ast.And, ast.Or, ast.ExceptHandler)):
+                    complexity += 1
+                elif isinstance(child, ast.BoolOp):
+                    complexity += len(child.values) - 1
+            return complexity
+
+        functions = []
+        classes = []
+        total_complexity = 1
+
+        for node in ast.walk(tree):
+            if isinstance(node, ast.FunctionDef):
+                func_complexity = cyclomatic_complexity(node)
+                functions.append({
+                    'name': node.name,
+                    'complexity': func_complexity,
+                    'line': node.lineno
+                })
+                total_complexity += func_complexity
+            elif isinstance(node, ast.ClassDef):
+                method_count = sum(1 for n in node.body if isinstance(n, ast.FunctionDef))
+                classes.append({
+                    'name': node.name,
+                    'methods': method_count,
+                    'line': node.lineno
+                })
+
+        return {
+            'success': True,
+            'cyclomaticComplexity': total_complexity,
+            'functions': functions,
+            'classes': classes
+        }
+    except Exception as e:
+        return {'success': False, 'error': str(e)}
+
+if __name__ == '__main__':
+    code = sys.stdin.read()
+    action = sys.argv[1] if len(sys.argv) > 1 else 'symbols'
+
+    if action == 'symbols':
+        result = analyze_code(code)
+    elif action == 'complexity':
+        result = calculate_complexity(code)
+    else:
+        result = {'success': False, 'error': 'Unknown action'}
+
+    print(json.dumps(result))
 `;
     // Singleton Python script path to avoid recreating it
     static scriptPath = null;

package/dist/lib/gemini-mcp.js

@@ -161,12 +161,12 @@ server.setRequestHandler(CallToolRequestSchema, async (request) => {
             }
             case 'gemini_analyze_code': {
                 const { code, language, focus } = args;
-                const sysPrompt = `You are an expert code reviewer. Analyze the given ${language || 'code'} and provide detailed feedback focusing on: ${focus || 'all aspects including performance, security, readability, and best practices'}.
-
-Respond in Korean and provide:
-1. 코드 요약
-2. 주요 이슈 (있다면)
-3. 개선 제안
+                const sysPrompt = `You are an expert code reviewer. Analyze the given ${language || 'code'} and provide detailed feedback focusing on: ${focus || 'all aspects including performance, security, readability, and best practices'}.
+
+Respond in Korean and provide:
+1. 코드 요약
+2. 주요 이슈 (있다면)
+3. 개선 제안
 4. 전체 품질 점수 (1-10)`;
                 const result = await geminiApi.chat({
                     model: 'gemini-2.5-flash',
@@ -186,15 +186,15 @@ Respond in Korean and provide:
             }
             case 'gemini_review_ui': {
                 const { description, context } = args;
-                const sysPrompt = `You are a UI/UX expert. Review the given UI description and provide detailed feedback.
-
-${context ? `Project context: ${context}` : ''}
-
-Respond in Korean and provide:
-1. UI 구조 평가
-2. UX 개선점
-3. 접근성 체크
-4. 모범 사례 비교
+                const sysPrompt = `You are a UI/UX expert. Review the given UI description and provide detailed feedback.
+
+${context ? `Project context: ${context}` : ''}
+
+Respond in Korean and provide:
+1. UI 구조 평가
+2. UX 개선점
+3. 접근성 체크
+4. 모범 사례 비교
 5. 구체적인 개선 제안`;
                 const result = await geminiApi.chat({
                     model: 'gemini-2.5-flash',

package/dist/lib/gemini-oauth.js

@@ -212,15 +212,15 @@ export function startOAuthFlow() {
                 const error = url.searchParams.get('error');
                 if (error) {
                     res.writeHead(400, { 'Content-Type': 'text/html; charset=utf-8' });
-                    res.end(`
-            <html>
-              <head><title>인증 실패</title></head>
-              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
-                <h1>인증 실패</h1>
-                <p>오류: ${error}</p>
-                <p>이 창을 닫고 다시 시도해주세요.</p>
-              </body>
-            </html>
+                    res.end(`
+            <html>
+              <head><title>인증 실패</title></head>
+              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
+                <h1>인증 실패</h1>
+                <p>오류: ${error}</p>
+                <p>이 창을 닫고 다시 시도해주세요.</p>
+              </body>
+            </html>
           `);
                     if (!isResolved) {
                         isResolved = true;
@@ -231,14 +231,14 @@ export function startOAuthFlow() {
                 }
                 if (!code || !state) {
                     res.writeHead(400, { 'Content-Type': 'text/html; charset=utf-8' });
-                    res.end(`
-            <html>
-              <head><title>인증 실패</title></head>
-              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
-                <h1>인증 실패</h1>
-                <p>필수 파라미터가 없습니다.</p>
-              </body>
-            </html>
+                    res.end(`
+            <html>
+              <head><title>인증 실패</title></head>
+              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
+                <h1>인증 실패</h1>
+                <p>필수 파라미터가 없습니다.</p>
+              </body>
+            </html>
           `);
                     if (!isResolved) {
                         isResolved = true;
@@ -250,16 +250,16 @@ export function startOAuthFlow() {
                 try {
                     const tokens = await exchangeCodeForTokens(code, state);
                     res.writeHead(200, { 'Content-Type': 'text/html; charset=utf-8' });
-                    res.end(`
-            <html>
-              <head><title>인증 성공</title></head>
-              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
-                <h1>인증 성공!</h1>
-                <p>${tokens.email}로 로그인되었습니다.</p>
-                <p>이 창을 닫아도 됩니다.</p>
-                <script>setTimeout(() => window.close(), 2000);</script>
-              </body>
-            </html>
+                    res.end(`
+            <html>
+              <head><title>인증 성공</title></head>
+              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
+                <h1>인증 성공!</h1>
+                <p>${tokens.email}로 로그인되었습니다.</p>
+                <p>이 창을 닫아도 됩니다.</p>
+                <script>setTimeout(() => window.close(), 2000);</script>
+              </body>
+            </html>
           `);
                     if (!isResolved) {
                         isResolved = true;
@@ -269,14 +269,14 @@ export function startOAuthFlow() {
                 }
                 catch (err) {
                     res.writeHead(500, { 'Content-Type': 'text/html; charset=utf-8' });
-                    res.end(`
-            <html>
-              <head><title>인증 실패</title></head>
-              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
-                <h1>인증 실패</h1>
-                <p>${err.message}</p>
-              </body>
-            </html>
+                    res.end(`
+            <html>
+              <head><title>인증 실패</title></head>
+              <body style="font-family: sans-serif; text-align: center; padding-top: 50px;">
+                <h1>인증 실패</h1>
+                <p>${err.message}</p>
+              </body>
+            </html>
           `);
                     if (!isResolved) {
                         isResolved = true;