@su-record/vibe 2.7.8 → 2.7.10

package/dist/cli/setup/Provisioner.js

@@ -153,48 +153,48 @@ export class Provisioner {
         const stateSection = details.stateManagement.length > 0
             ? details.stateManagement.join(', ')
             : 'N/A';
-        return `# [Feature Name] SPEC
-
-## Overview
-<!-- Brief description of the feature -->
-
-## Tech Stack
-${stackList}
-
-### Infrastructure
-- **Databases**: ${dbSection}
-- **State Management**: ${stateSection}
-
-## Problem Statement
-<!-- What problem does this solve? -->
-
-## Proposed Solution
-<!-- High-level approach -->
-
-## Requirements
-
-### Functional
-1. <!-- Requirement 1 -->
-
-### Non-Functional
-1. <!-- Performance, security, accessibility -->
-
-## API Design
-<!-- Endpoints, request/response schemas -->
-
-## Data Model
-<!-- Schema changes, migrations -->
-
-## Test Strategy
-- Unit tests: <!-- scope -->
-- Integration tests: <!-- scope -->
-- E2E tests: <!-- scope -->
-
-## Acceptance Criteria
-- [ ] <!-- Criterion 1 -->
-
-## References
-<!-- Links to relevant docs, designs, PRs -->
+        return `# [Feature Name] SPEC
+
+## Overview
+<!-- Brief description of the feature -->
+
+## Tech Stack
+${stackList}
+
+### Infrastructure
+- **Databases**: ${dbSection}
+- **State Management**: ${stateSection}
+
+## Problem Statement
+<!-- What problem does this solve? -->
+
+## Proposed Solution
+<!-- High-level approach -->
+
+## Requirements
+
+### Functional
+1. <!-- Requirement 1 -->
+
+### Non-Functional
+1. <!-- Performance, security, accessibility -->
+
+## API Design
+<!-- Endpoints, request/response schemas -->
+
+## Data Model
+<!-- Schema changes, migrations -->
+
+## Test Strategy
+- Unit tests: <!-- scope -->
+- Integration tests: <!-- scope -->
+- E2E tests: <!-- scope -->
+
+## Acceptance Criteria
+- [ ] <!-- Criterion 1 -->
+
+## References
+<!-- Links to relevant docs, designs, PRs -->
 `;
     }
 }

package/dist/cli/setup.d.ts

@@ -3,6 +3,6 @@
  */
 export { detectOsLanguage } from './setup/LanguageDetector.js';
 export { getCoreConfigDir, installGlobalCorePackage, registerMcpServers } from './setup/GlobalInstaller.js';
-export { updateConstitution, updateRules, installProjectHooks, updateGitignore, updateConfig, installCursorRules } from './setup/ProjectSetup.js';
+export { updateConstitution, updateRules, installProjectHooks, updateGitignore, updateConfig, installCursorRules, updateCodexAgentsMd, updateGeminiMd, installGeminiHooks, } from './setup/ProjectSetup.js';
 export { migrateLegacyCore, cleanupLegacy, removeLocalAssets, cleanupClaudeConfig, cleanupLegacyMcp } from './setup/LegacyMigration.js';
 //# sourceMappingURL=setup.d.ts.map

package/dist/cli/setup.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"setup.d.ts","sourceRoot":"","sources":["../../src/cli/setup.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAG/D,OAAO,EACL,gBAAgB,EAChB,wBAAwB,EACxB,kBAAkB,EACnB,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,kBAAkB,EAClB,WAAW,EACX,mBAAmB,EACnB,eAAe,EACf,YAAY,EACZ,kBAAkB,EACnB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACL,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,4BAA4B,CAAC"}
+{"version":3,"file":"setup.d.ts","sourceRoot":"","sources":["../../src/cli/setup.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAG/D,OAAO,EACL,gBAAgB,EAChB,wBAAwB,EACxB,kBAAkB,EACnB,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,kBAAkB,EAClB,WAAW,EACX,mBAAmB,EACnB,eAAe,EACf,YAAY,EACZ,kBAAkB,EAClB,mBAAmB,EACnB,cAAc,EACd,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACL,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,4BAA4B,CAAC"}

package/dist/cli/setup.js

@@ -6,6 +6,6 @@ export { detectOsLanguage } from './setup/LanguageDetector.js';
 // GlobalInstaller
 export { getCoreConfigDir, installGlobalCorePackage, registerMcpServers } from './setup/GlobalInstaller.js';
 // ProjectSetup
-export { updateConstitution, updateRules, installProjectHooks, updateGitignore, updateConfig, installCursorRules } from './setup/ProjectSetup.js';
+export { updateConstitution, updateRules, installProjectHooks, updateGitignore, updateConfig, installCursorRules, updateCodexAgentsMd, updateGeminiMd, installGeminiHooks, } from './setup/ProjectSetup.js';
 export { migrateLegacyCore, cleanupLegacy, removeLocalAssets, cleanupClaudeConfig, cleanupLegacyMcp } from './setup/LegacyMigration.js';
 //# sourceMappingURL=setup.js.map

package/dist/cli/setup.js.map

@@ -1 +1 @@
-{"version":3,"file":"setup.js","sourceRoot":"","sources":["../../src/cli/setup.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,mBAAmB;AACnB,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAE/D,kBAAkB;AAClB,OAAO,EACL,gBAAgB,EAChB,wBAAwB,EACxB,kBAAkB,EACnB,MAAM,4BAA4B,CAAC;AAEpC,eAAe;AACf,OAAO,EACL,kBAAkB,EAClB,WAAW,EACX,mBAAmB,EACnB,eAAe,EACf,YAAY,EACZ,kBAAkB,EACnB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACL,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,4BAA4B,CAAC"}
+{"version":3,"file":"setup.js","sourceRoot":"","sources":["../../src/cli/setup.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,mBAAmB;AACnB,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAE/D,kBAAkB;AAClB,OAAO,EACL,gBAAgB,EAChB,wBAAwB,EACxB,kBAAkB,EACnB,MAAM,4BAA4B,CAAC;AAEpC,eAAe;AACf,OAAO,EACL,kBAAkB,EAClB,WAAW,EACX,mBAAmB,EACnB,eAAe,EACf,YAAY,EACZ,kBAAkB,EAClB,mBAAmB,EACnB,cAAc,EACd,kBAAkB,GACnB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACL,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,4BAA4B,CAAC"}

package/dist/cli/utils/cli-detector.d.ts

@@ -0,0 +1,25 @@
+/**
+ * AI CLI 감지 유틸리티
+ *
+ * Codex CLI, Gemini CLI 설치 여부를 자동 감지하여
+ * 설치된 CLI에만 설정을 적용
+ */
+export interface AiCliStatus {
+    installed: boolean;
+    configDir: string;
+}
+/**
+ * Codex CLI 설치 여부 감지
+ * - `which codex` 실행 가능 여부
+ * - `~/.codex/` 디렉토리 존재 여부
+ * 둘 중 하나만 true면 installed: true
+ */
+export declare function detectCodexCli(): AiCliStatus;
+/**
+ * Gemini CLI 설치 여부 감지
+ * - `which gemini` 실행 가능 여부
+ * - `~/.gemini/` 디렉토리 존재 여부
+ * 둘 중 하나만 true면 installed: true
+ */
+export declare function detectGeminiCli(): AiCliStatus;
+//# sourceMappingURL=cli-detector.d.ts.map

package/dist/cli/utils/cli-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cli-detector.d.ts","sourceRoot":"","sources":["../../../src/cli/utils/cli-detector.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,MAAM,WAAW,WAAW;IAC1B,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,IAAI,WAAW,CAgB5C;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,IAAI,WAAW,CAgB7C"}

package/dist/cli/utils/cli-detector.js

@@ -0,0 +1,55 @@
+/**
+ * AI CLI 감지 유틸리티
+ *
+ * Codex CLI, Gemini CLI 설치 여부를 자동 감지하여
+ * 설치된 CLI에만 설정을 적용
+ */
+import { execSync } from 'child_process';
+import path from 'path';
+import fs from 'fs';
+import os from 'os';
+/**
+ * Codex CLI 설치 여부 감지
+ * - `which codex` 실행 가능 여부
+ * - `~/.codex/` 디렉토리 존재 여부
+ * 둘 중 하나만 true면 installed: true
+ */
+export function detectCodexCli() {
+    const configDir = path.join(os.homedir(), '.codex');
+    const hasDir = fs.existsSync(configDir);
+    let hasBin = false;
+    try {
+        execSync('which codex', { stdio: 'ignore' });
+        hasBin = true;
+    }
+    catch {
+        // not found
+    }
+    return {
+        installed: hasBin || hasDir,
+        configDir,
+    };
+}
+/**
+ * Gemini CLI 설치 여부 감지
+ * - `which gemini` 실행 가능 여부
+ * - `~/.gemini/` 디렉토리 존재 여부
+ * 둘 중 하나만 true면 installed: true
+ */
+export function detectGeminiCli() {
+    const configDir = path.join(os.homedir(), '.gemini');
+    const hasDir = fs.existsSync(configDir);
+    let hasBin = false;
+    try {
+        execSync('which gemini', { stdio: 'ignore' });
+        hasBin = true;
+    }
+    catch {
+        // not found
+    }
+    return {
+        installed: hasBin || hasDir,
+        configDir,
+    };
+}
+//# sourceMappingURL=cli-detector.js.map

package/dist/cli/utils/cli-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cli-detector.js","sourceRoot":"","sources":["../../../src/cli/utils/cli-detector.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,IAAI,MAAM,MAAM,CAAC;AACxB,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,EAAE,MAAM,IAAI,CAAC;AAOpB;;;;;GAKG;AACH,MAAM,UAAU,cAAc;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,QAAQ,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;IAExC,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,CAAC;QACH,QAAQ,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC7C,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IAAC,MAAM,CAAC;QACP,YAAY;IACd,CAAC;IAED,OAAO;QACL,SAAS,EAAE,MAAM,IAAI,MAAM;QAC3B,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe;IAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,SAAS,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;IAExC,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,CAAC;QACH,QAAQ,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC9C,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IAAC,MAAM,CAAC;QACP,YAAY;IACd,CAAC;IAED,OAAO;QACL,SAAS,EAAE,MAAM,IAAI,MAAM;QAC3B,SAAS;KACV,CAAC;AACJ,CAAC"}

package/dist/infra/lib/DeepInit.js

@@ -216,30 +216,30 @@ export function generateNavigationHeader(dir, rootPath) {
  * Describe DeepInit workflow
  */
 export function describeDeepInitWorkflow() {
-    return `
-## DeepInit Workflow
-
-Hierarchical AI-readable documentation generation:
-
-\`\`\`
-project/
-├── AGENTS.md              ← Root documentation
-├── src/
-│   ├── AGENTS.md          ← <!-- Parent: ../AGENTS.md -->
-│   ├── components/
-│   │   └── AGENTS.md      ← <!-- Parent: ../AGENTS.md -->
-│   └── services/
-│       └── AGENTS.md      ← <!-- Parent: ../AGENTS.md -->
-└── tests/
-    └── AGENTS.md          ← <!-- Parent: ../AGENTS.md -->
-\`\`\`
-
-Features:
-- Parent references for navigation
-- Auto-detected purpose and conventions
-- Preserved manual notes on regeneration
-- Entry point identification
-- Child module linking
+    return `
+## DeepInit Workflow
+
+Hierarchical AI-readable documentation generation:
+
+\`\`\`
+project/
+├── AGENTS.md              ← Root documentation
+├── src/
+│   ├── AGENTS.md          ← <!-- Parent: ../AGENTS.md -->
+│   ├── components/
+│   │   └── AGENTS.md      ← <!-- Parent: ../AGENTS.md -->
+│   └── services/
+│       └── AGENTS.md      ← <!-- Parent: ../AGENTS.md -->
+└── tests/
+    └── AGENTS.md          ← <!-- Parent: ../AGENTS.md -->
+\`\`\`
+
+Features:
+- Parent references for navigation
+- Auto-detected purpose and conventions
+- Preserved manual notes on regeneration
+- Entry point identification
+- Child module linking
 `.trim();
 }
 //# sourceMappingURL=DeepInit.js.map

package/dist/infra/lib/IterationTracker.js

@@ -108,10 +108,10 @@ export function formatProgress(state = currentState) {
  * Phase 시작 배너
  */
 export function formatPhaseStart(phaseNumber, phaseName, totalPhases) {
-    return `
-━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
-🏔️ BOULDER ROLLING... Phase ${phaseNumber}/${totalPhases}
-   ${phaseName}
+    return `
+━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
+🏔️ BOULDER ROLLING... Phase ${phaseNumber}/${totalPhases}
+   ${phaseName}
 ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━`.trim();
 }
 /**
@@ -129,13 +129,13 @@ export function formatIterationComplete(state) {
         : 0;
     const totalRetries = state.phases.reduce((sum, p) => sum + p.retryCount, 0);
     const retryInfo = totalRetries > 0 ? ` (${totalRetries} retries)` : '';
-    return `
-━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
-🎉 BOULDER REACHED THE TOP!
-━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
-Feature: ${state.featureName}
-Phases:  ${state.totalPhases}/${state.totalPhases} complete${retryInfo}
-Time:    ${duration}s
+    return `
+━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
+🎉 BOULDER REACHED THE TOP!
+━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
+Feature: ${state.featureName}
+Phases:  ${state.totalPhases}/${state.totalPhases} complete${retryInfo}
+Time:    ${duration}s
 ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━`.trim();
 }
 /**

package/dist/infra/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;