@su-record/vibe 2.4.52 → 2.4.53
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +10 -12
- package/dist/cli/index.d.ts +0 -12
- package/dist/cli/index.d.ts.map +1 -1
- package/dist/cli/index.js +7 -30
- package/dist/cli/index.js.map +1 -1
- package/dist/cli/postinstall.d.ts +7 -0
- package/dist/cli/postinstall.d.ts.map +1 -0
- package/dist/cli/postinstall.js +136 -0
- package/dist/cli/postinstall.js.map +1 -0
- package/dist/cli/setup.d.ts.map +1 -1
- package/dist/cli/setup.js +12 -5
- package/dist/cli/setup.js.map +1 -1
- package/dist/tools/index.d.ts +0 -14
- package/dist/tools/index.d.ts.map +1 -1
- package/dist/tools/index.js +0 -19
- package/dist/tools/index.js.map +1 -1
- package/package.json +3 -7
- package/dist/tools/analytics/getUsageAnalytics.d.ts +0 -10
- package/dist/tools/analytics/getUsageAnalytics.d.ts.map +0 -1
- package/dist/tools/analytics/getUsageAnalytics.js +0 -246
- package/dist/tools/analytics/getUsageAnalytics.js.map +0 -1
- package/dist/tools/analytics/index.d.ts +0 -5
- package/dist/tools/analytics/index.d.ts.map +0 -1
- package/dist/tools/analytics/index.js +0 -5
- package/dist/tools/analytics/index.js.map +0 -1
- package/dist/tools/planning/analyzeRequirements.d.ts +0 -9
- package/dist/tools/planning/analyzeRequirements.d.ts.map +0 -1
- package/dist/tools/planning/analyzeRequirements.js +0 -171
- package/dist/tools/planning/analyzeRequirements.js.map +0 -1
- package/dist/tools/planning/createUserStories.d.ts +0 -9
- package/dist/tools/planning/createUserStories.d.ts.map +0 -1
- package/dist/tools/planning/createUserStories.js +0 -124
- package/dist/tools/planning/createUserStories.js.map +0 -1
- package/dist/tools/planning/featureRoadmap.d.ts +0 -10
- package/dist/tools/planning/featureRoadmap.d.ts.map +0 -1
- package/dist/tools/planning/featureRoadmap.js +0 -207
- package/dist/tools/planning/featureRoadmap.js.map +0 -1
- package/dist/tools/planning/generatePrd.d.ts +0 -11
- package/dist/tools/planning/generatePrd.d.ts.map +0 -1
- package/dist/tools/planning/generatePrd.js +0 -161
- package/dist/tools/planning/generatePrd.js.map +0 -1
- package/dist/tools/planning/index.d.ts +0 -8
- package/dist/tools/planning/index.d.ts.map +0 -1
- package/dist/tools/planning/index.js +0 -8
- package/dist/tools/planning/index.js.map +0 -1
- package/dist/tools/prompt/analyzePrompt.d.ts +0 -7
- package/dist/tools/prompt/analyzePrompt.d.ts.map +0 -1
- package/dist/tools/prompt/analyzePrompt.js +0 -150
- package/dist/tools/prompt/analyzePrompt.js.map +0 -1
- package/dist/tools/prompt/enhancePrompt.d.ts +0 -8
- package/dist/tools/prompt/enhancePrompt.d.ts.map +0 -1
- package/dist/tools/prompt/enhancePrompt.js +0 -110
- package/dist/tools/prompt/enhancePrompt.js.map +0 -1
- package/dist/tools/prompt/enhancePromptGemini.d.ts +0 -8
- package/dist/tools/prompt/enhancePromptGemini.d.ts.map +0 -1
- package/dist/tools/prompt/enhancePromptGemini.js +0 -332
- package/dist/tools/prompt/enhancePromptGemini.js.map +0 -1
- package/dist/tools/prompt/index.d.ts +0 -7
- package/dist/tools/prompt/index.d.ts.map +0 -1
- package/dist/tools/prompt/index.js +0 -7
- package/dist/tools/prompt/index.js.map +0 -1
- package/dist/tools/reasoning/applyReasoningFramework.d.ts +0 -8
- package/dist/tools/reasoning/applyReasoningFramework.d.ts.map +0 -1
- package/dist/tools/reasoning/applyReasoningFramework.js +0 -266
- package/dist/tools/reasoning/applyReasoningFramework.js.map +0 -1
- package/dist/tools/reasoning/index.d.ts +0 -5
- package/dist/tools/reasoning/index.d.ts.map +0 -1
- package/dist/tools/reasoning/index.js +0 -5
- package/dist/tools/reasoning/index.js.map +0 -1
- package/dist/tools/thinking/analyzeProblem.d.ts +0 -7
- package/dist/tools/thinking/analyzeProblem.d.ts.map +0 -1
- package/dist/tools/thinking/analyzeProblem.js +0 -55
- package/dist/tools/thinking/analyzeProblem.js.map +0 -1
- package/dist/tools/thinking/breakDownProblem.d.ts +0 -8
- package/dist/tools/thinking/breakDownProblem.d.ts.map +0 -1
- package/dist/tools/thinking/breakDownProblem.js +0 -145
- package/dist/tools/thinking/breakDownProblem.js.map +0 -1
- package/dist/tools/thinking/createThinkingChain.d.ts +0 -7
- package/dist/tools/thinking/createThinkingChain.d.ts.map +0 -1
- package/dist/tools/thinking/createThinkingChain.js +0 -44
- package/dist/tools/thinking/createThinkingChain.js.map +0 -1
- package/dist/tools/thinking/formatAsPlan.d.ts +0 -9
- package/dist/tools/thinking/formatAsPlan.d.ts.map +0 -1
- package/dist/tools/thinking/formatAsPlan.js +0 -78
- package/dist/tools/thinking/formatAsPlan.js.map +0 -1
- package/dist/tools/thinking/index.d.ts +0 -10
- package/dist/tools/thinking/index.d.ts.map +0 -1
- package/dist/tools/thinking/index.js +0 -10
- package/dist/tools/thinking/index.js.map +0 -1
- package/dist/tools/thinking/stepByStepAnalysis.d.ts +0 -8
- package/dist/tools/thinking/stepByStepAnalysis.d.ts.map +0 -1
- package/dist/tools/thinking/stepByStepAnalysis.js +0 -63
- package/dist/tools/thinking/stepByStepAnalysis.js.map +0 -1
- package/dist/tools/thinking/thinkAloudProcess.d.ts +0 -8
- package/dist/tools/thinking/thinkAloudProcess.d.ts.map +0 -1
- package/dist/tools/thinking/thinkAloudProcess.js +0 -80
- package/dist/tools/thinking/thinkAloudProcess.js.map +0 -1
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/tools/prompt/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC"}
|
|
@@ -1,8 +0,0 @@
|
|
|
1
|
-
import { ToolResult, ToolDefinition } from '../../types/tool.js';
|
|
2
|
-
export declare const applyReasoningFrameworkDefinition: ToolDefinition;
|
|
3
|
-
export declare function applyReasoningFramework(args: {
|
|
4
|
-
problem: string;
|
|
5
|
-
context?: string;
|
|
6
|
-
focus_steps?: number[];
|
|
7
|
-
}): Promise<ToolResult>;
|
|
8
|
-
//# sourceMappingURL=applyReasoningFramework.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"applyReasoningFramework.d.ts","sourceRoot":"","sources":["../../../src/tools/reasoning/applyReasoningFramework.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAEjE,eAAO,MAAM,iCAAiC,EAAE,cA8B/C,CAAC;AAUF,wBAAsB,uBAAuB,CAAC,IAAI,EAAE;IAClD,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;CACxB,GAAG,OAAO,CAAC,UAAU,CAAC,CA8HtB"}
|
|
@@ -1,266 +0,0 @@
|
|
|
1
|
-
// Apply 9-step reasoning framework to complex problems
|
|
2
|
-
export const applyReasoningFrameworkDefinition = {
|
|
3
|
-
name: 'apply_reasoning_framework',
|
|
4
|
-
description: '추론 프레임워크|체계적 분석|논리적 사고|reasoning framework|systematic analysis|logical thinking - Apply 9-step reasoning framework to analyze complex problems systematically',
|
|
5
|
-
inputSchema: {
|
|
6
|
-
type: 'object',
|
|
7
|
-
properties: {
|
|
8
|
-
problem: {
|
|
9
|
-
type: 'string',
|
|
10
|
-
description: 'The problem or task to analyze using the reasoning framework'
|
|
11
|
-
},
|
|
12
|
-
context: {
|
|
13
|
-
type: 'string',
|
|
14
|
-
description: 'Additional context about the problem (project constraints, tech stack, etc.)'
|
|
15
|
-
},
|
|
16
|
-
focus_steps: {
|
|
17
|
-
type: 'array',
|
|
18
|
-
items: { type: 'number' },
|
|
19
|
-
description: 'Specific framework steps to focus on (1-9). If not provided, all steps will be applied.'
|
|
20
|
-
}
|
|
21
|
-
},
|
|
22
|
-
required: ['problem']
|
|
23
|
-
},
|
|
24
|
-
annotations: {
|
|
25
|
-
title: 'Apply Reasoning Framework',
|
|
26
|
-
audience: ['user', 'assistant'],
|
|
27
|
-
readOnlyHint: true,
|
|
28
|
-
destructiveHint: false,
|
|
29
|
-
idempotentHint: true,
|
|
30
|
-
openWorldHint: false
|
|
31
|
-
}
|
|
32
|
-
};
|
|
33
|
-
export async function applyReasoningFramework(args) {
|
|
34
|
-
const { problem, context, focus_steps } = args;
|
|
35
|
-
const allSteps = [
|
|
36
|
-
{
|
|
37
|
-
step: 1,
|
|
38
|
-
title: '논리적 종속성 및 제약 조건',
|
|
39
|
-
description: '정책, 작업 순서, 전제 조건, 사용자 제약을 중요도 순으로 분석',
|
|
40
|
-
questions: [
|
|
41
|
-
'어떤 정책이나 필수 규칙이 적용되는가?',
|
|
42
|
-
'작업 순서를 재정렬해야 하는가? (선행 작업 확인)',
|
|
43
|
-
'필요한 전제 조건이나 정보는?',
|
|
44
|
-
'명시적 사용자 제약 조건이 있는가?'
|
|
45
|
-
],
|
|
46
|
-
output: analyzeConstraints(problem, context)
|
|
47
|
-
},
|
|
48
|
-
{
|
|
49
|
-
step: 2,
|
|
50
|
-
title: '위험 평가',
|
|
51
|
-
description: '행동의 결과와 향후 문제 가능성 평가',
|
|
52
|
-
questions: [
|
|
53
|
-
'이 행동이 미래에 문제를 일으킬 수 있는가?',
|
|
54
|
-
'탐색 작업인가, 구현 작업인가? (위험 수준 결정)',
|
|
55
|
-
'호환성, 보안, 성능 위험은?',
|
|
56
|
-
'롤백이 가능한가?'
|
|
57
|
-
],
|
|
58
|
-
output: assessRisks(problem, context)
|
|
59
|
-
},
|
|
60
|
-
{
|
|
61
|
-
step: 3,
|
|
62
|
-
title: '귀납적 추론 및 가설 탐색',
|
|
63
|
-
description: '문제의 근본 원인에 대한 가설 생성 및 우선순위화',
|
|
64
|
-
questions: [
|
|
65
|
-
'즉각적 원인을 넘어선 근본 원인은?',
|
|
66
|
-
'각 가설을 어떻게 검증할 것인가?',
|
|
67
|
-
'가능성이 낮은 원인도 고려했는가?'
|
|
68
|
-
],
|
|
69
|
-
output: generateHypotheses(problem, context)
|
|
70
|
-
},
|
|
71
|
-
{
|
|
72
|
-
step: 4,
|
|
73
|
-
title: '결과 평가 및 적응성',
|
|
74
|
-
description: '관찰 결과에 따라 계획 조정',
|
|
75
|
-
questions: [
|
|
76
|
-
'이전 관찰이 계획 변경을 요구하는가?',
|
|
77
|
-
'가설이 반증되었다면 새 가설을 생성했는가?',
|
|
78
|
-
'막다른 길에 도달했다면 백트래킹이 필요한가?'
|
|
79
|
-
],
|
|
80
|
-
output: evaluateAdaptability(problem, context)
|
|
81
|
-
},
|
|
82
|
-
{
|
|
83
|
-
step: 5,
|
|
84
|
-
title: '정보 가용성',
|
|
85
|
-
description: '모든 정보 소스 식별 및 활용',
|
|
86
|
-
questions: [
|
|
87
|
-
'사용 가능한 도구는? (MCP, 파일 시스템, Git 등)',
|
|
88
|
-
'참조해야 할 정책/규칙 문서는? (CLAUDE.md, constitution.md)',
|
|
89
|
-
'이전 대화나 메모리에서 관련 정보를 찾았는가?',
|
|
90
|
-
'사용자에게 물어야 할 정보는?'
|
|
91
|
-
],
|
|
92
|
-
output: identifyInformationSources(problem, context)
|
|
93
|
-
},
|
|
94
|
-
{
|
|
95
|
-
step: 6,
|
|
96
|
-
title: '정밀성 및 근거',
|
|
97
|
-
description: '주장에 대한 정확한 근거 제시',
|
|
98
|
-
questions: [
|
|
99
|
-
'정책 참조 시 정확히 인용했는가?',
|
|
100
|
-
'코드 참조 시 파일명:라인을 명시했는가?',
|
|
101
|
-
'숫자와 메트릭이 정확한가?'
|
|
102
|
-
],
|
|
103
|
-
output: ensurePrecision(problem, context)
|
|
104
|
-
},
|
|
105
|
-
{
|
|
106
|
-
step: 7,
|
|
107
|
-
title: '완전성',
|
|
108
|
-
description: '모든 요구사항, 옵션, 선호도 통합',
|
|
109
|
-
questions: [
|
|
110
|
-
'충돌하는 요구사항을 중요도 순으로 해결했는가?',
|
|
111
|
-
'조기 결론을 내리지 않았는가? (여러 옵션 고려)',
|
|
112
|
-
'모든 관련 정보 소스를 검토했는가?'
|
|
113
|
-
],
|
|
114
|
-
output: ensureCompleteness(problem, context)
|
|
115
|
-
},
|
|
116
|
-
{
|
|
117
|
-
step: 8,
|
|
118
|
-
title: '끈기와 인내',
|
|
119
|
-
description: '모든 추론을 소진할 때까지 포기하지 않기',
|
|
120
|
-
questions: [
|
|
121
|
-
'일시적 오류는 재시도했는가?',
|
|
122
|
-
'명확한 한계(재시도 제한, 타임아웃)에 도달했는가?',
|
|
123
|
-
'같은 실패를 반복하지 않고 전략을 변경했는가?'
|
|
124
|
-
],
|
|
125
|
-
output: demonstratePersistence(problem, context)
|
|
126
|
-
},
|
|
127
|
-
{
|
|
128
|
-
step: 9,
|
|
129
|
-
title: '응답 억제',
|
|
130
|
-
description: '추론 완료 후에만 행동',
|
|
131
|
-
questions: [
|
|
132
|
-
'위의 모든 추론이 완료되었는가?',
|
|
133
|
-
'추론 과정을 문서화했는가?',
|
|
134
|
-
'한 번에 하나의 주요 행동만 수행하는가?'
|
|
135
|
-
],
|
|
136
|
-
output: planExecution(problem, context)
|
|
137
|
-
}
|
|
138
|
-
];
|
|
139
|
-
// Filter steps if focus_steps is provided
|
|
140
|
-
const stepsToApply = focus_steps && focus_steps.length > 0
|
|
141
|
-
? allSteps.filter(s => focus_steps.includes(s.step))
|
|
142
|
-
: allSteps;
|
|
143
|
-
const result = {
|
|
144
|
-
problem,
|
|
145
|
-
context: context || 'No additional context provided',
|
|
146
|
-
steps_applied: stepsToApply.length,
|
|
147
|
-
framework_steps: stepsToApply,
|
|
148
|
-
summary: generateSummary(problem, stepsToApply)
|
|
149
|
-
};
|
|
150
|
-
const output = formatOutput(result);
|
|
151
|
-
return {
|
|
152
|
-
content: [{ type: 'text', text: output }]
|
|
153
|
-
};
|
|
154
|
-
}
|
|
155
|
-
// Helper methods
|
|
156
|
-
function analyzeConstraints(problem, context) {
|
|
157
|
-
return `**제약 조건 분석**:
|
|
158
|
-
- 정책/규칙: ${context ? '프로젝트 컨텍스트 확인 필요' : 'CLAUDE.md, constitution.md 확인 필요'}
|
|
159
|
-
- 작업 순서: 선행 작업 식별 필요 (DB → Backend → Frontend 패턴 고려)
|
|
160
|
-
- 전제 조건: ${problem}을(를) 위한 필수 정보/도구 확인
|
|
161
|
-
- 사용자 제약: 명시적 요청사항 우선 적용`;
|
|
162
|
-
}
|
|
163
|
-
function assessRisks(problem, context) {
|
|
164
|
-
const isExploration = problem.toLowerCase().includes('찾') ||
|
|
165
|
-
problem.toLowerCase().includes('분석') ||
|
|
166
|
-
problem.toLowerCase().includes('확인') ||
|
|
167
|
-
problem.toLowerCase().includes('find') ||
|
|
168
|
-
problem.toLowerCase().includes('analyze');
|
|
169
|
-
return `**위험 평가**:
|
|
170
|
-
- 작업 유형: ${isExploration ? '탐색 작업 (낮은 위험)' : '구현 작업 (높은 위험)'}
|
|
171
|
-
- 롤백 가능성: ${isExploration ? '높음' : '확인 필요'}
|
|
172
|
-
- 호환성 위험: 기존 코드와의 충돌 가능성 검토
|
|
173
|
-
- 보안 위험: SQL Injection, XSS, 민감 정보 노출 검토
|
|
174
|
-
- 성능 위험: N+1 쿼리, 메모리 누수, 불필요한 리렌더 검토`;
|
|
175
|
-
}
|
|
176
|
-
function generateHypotheses(problem, context) {
|
|
177
|
-
return `**가설 생성**:
|
|
178
|
-
1. **가설 1** (가능성: 높음)
|
|
179
|
-
- 근거: ${problem}의 가장 직접적인 원인
|
|
180
|
-
- 검증: [도구/파일]을 통해 확인
|
|
181
|
-
2. **가설 2** (가능성: 중간)
|
|
182
|
-
- 근거: 간접적 요인 또는 환경 차이
|
|
183
|
-
- 검증: 추가 정보 수집 필요
|
|
184
|
-
3. **가설 3** (가능성: 낮음)
|
|
185
|
-
- 근거: 엣지 케이스 또는 드문 상황
|
|
186
|
-
- 검증: 다른 가설 반증 시 검토
|
|
187
|
-
|
|
188
|
-
**우선순위**: 가능성 높은 순으로 검증하되, 낮은 가능성도 완전히 배제하지 않음`;
|
|
189
|
-
}
|
|
190
|
-
function evaluateAdaptability(problem, context) {
|
|
191
|
-
return `**적응성 평가**:
|
|
192
|
-
- 관찰 결과 반영: 새로운 정보에 따라 계획 수정 필요 여부 확인
|
|
193
|
-
- 가설 업데이트: 반증된 가설 폐기, 새 가설 생성
|
|
194
|
-
- 백트래킹: 막다른 길 도달 시 이전 단계로 돌아가 다른 경로 탐색
|
|
195
|
-
- 계획 재평가: 전체 접근법이 유효한지 주기적으로 검토`;
|
|
196
|
-
}
|
|
197
|
-
function identifyInformationSources(problem, context) {
|
|
198
|
-
return `**정보 소스**:
|
|
199
|
-
1. **도구**:
|
|
200
|
-
- vibe 내장 도구 (36개)
|
|
201
|
-
- 파일 시스템 (Read, Write, Edit, Glob, Grep)
|
|
202
|
-
- Git, 패키지 관리자
|
|
203
|
-
2. **정책/규칙**:
|
|
204
|
-
- CLAUDE.md (기술 스택, 아키텍처)
|
|
205
|
-
- .claude/vibe/constitution.md (프로젝트 규칙)
|
|
206
|
-
- skills/ 폴더 (품질 기준, 코딩 표준)
|
|
207
|
-
3. **메모리**:
|
|
208
|
-
- recall_memory (이전 세션 정보)
|
|
209
|
-
- restore_session_context (컨텍스트 복원)
|
|
210
|
-
4. **사용자 확인**:
|
|
211
|
-
- 비즈니스 로직 세부사항
|
|
212
|
-
- 디자인 선호도
|
|
213
|
-
- 우선순위 결정`;
|
|
214
|
-
}
|
|
215
|
-
function ensurePrecision(problem, context) {
|
|
216
|
-
return `**정밀성 확보**:
|
|
217
|
-
- 정책 인용: "CLAUDE.md:12에 따르면..." 형식으로 명시
|
|
218
|
-
- 코드 참조: "users.py:45의 User 모델" 형식으로 파일명:라인 포함
|
|
219
|
-
- 숫자 정확성: 복잡도, 커버리지, 성능 지표를 정확한 수치로 표현
|
|
220
|
-
- 근거 제시: 모든 주장에 대해 출처와 근거 명확히`;
|
|
221
|
-
}
|
|
222
|
-
function ensureCompleteness(problem, context) {
|
|
223
|
-
return `**완전성 확보**:
|
|
224
|
-
- 충돌 해결: 정책 → 작업 순서 → 전제 조건 → 사용자 선호도 순
|
|
225
|
-
- 옵션 탐색: 단일 해결책에 조기 고정하지 않고 여러 대안 검토
|
|
226
|
-
- 정보 검토: 모든 관련 정보 소스(#5) 철저히 검토
|
|
227
|
-
- 사용자 확인: 불확실한 부분은 가정하지 말고 확인`;
|
|
228
|
-
}
|
|
229
|
-
function demonstratePersistence(problem, context) {
|
|
230
|
-
return `**끈기 전략**:
|
|
231
|
-
- 일시적 오류: 지수 백오프로 재시도 (예: 1초, 2초, 4초...)
|
|
232
|
-
- 한계 인식: 명확한 재시도 제한, 타임아웃 도달 시 중단
|
|
233
|
-
- 전략 변경: 같은 실패 반복 X → 다른 접근법 시도
|
|
234
|
-
- 철저한 분석: 시간이 걸리더라도 모든 추론 단계 완료`;
|
|
235
|
-
}
|
|
236
|
-
function planExecution(problem, context) {
|
|
237
|
-
return `**실행 계획**:
|
|
238
|
-
1. **추론 문서화**: 복잡한 결정의 경우 추론 과정 간략히 설명
|
|
239
|
-
2. **단계별 실행**: 한 번에 하나의 주요 행동만 수행
|
|
240
|
-
3. **결과 확인**: 각 행동의 결과를 확인한 후 다음 단계로 진행
|
|
241
|
-
4. **롤백 대비**: 문제 발생 시 이전 상태로 복구 가능하도록 준비`;
|
|
242
|
-
}
|
|
243
|
-
function generateSummary(problem, steps) {
|
|
244
|
-
return `9단계 추론 프레임워크를 "${problem}"에 적용했습니다.
|
|
245
|
-
총 ${steps.length}개 단계를 체계적으로 분석하여 논리적 종속성, 위험, 가설, 정보 소스를 포괄적으로 검토했습니다.`;
|
|
246
|
-
}
|
|
247
|
-
function formatOutput(result) {
|
|
248
|
-
let output = `# 추론 프레임워크 분석\n\n`;
|
|
249
|
-
output += `**문제**: ${result.problem}\n`;
|
|
250
|
-
output += `**컨텍스트**: ${result.context}\n`;
|
|
251
|
-
output += `**적용 단계**: ${result.steps_applied}/9\n\n`;
|
|
252
|
-
output += `---\n\n`;
|
|
253
|
-
for (const step of result.framework_steps) {
|
|
254
|
-
output += `## ${step.step}. ${step.title}\n\n`;
|
|
255
|
-
output += `${step.description}\n\n`;
|
|
256
|
-
output += `**핵심 질문**:\n`;
|
|
257
|
-
step.questions.forEach((q) => {
|
|
258
|
-
output += `- ${q}\n`;
|
|
259
|
-
});
|
|
260
|
-
output += `\n${step.output}\n\n`;
|
|
261
|
-
output += `---\n\n`;
|
|
262
|
-
}
|
|
263
|
-
output += `## 요약\n\n${result.summary}`;
|
|
264
|
-
return output;
|
|
265
|
-
}
|
|
266
|
-
//# sourceMappingURL=applyReasoningFramework.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"applyReasoningFramework.js","sourceRoot":"","sources":["../../../src/tools/reasoning/applyReasoningFramework.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAIvD,MAAM,CAAC,MAAM,iCAAiC,GAAmB;IAC/D,IAAI,EAAE,2BAA2B;IACjC,WAAW,EAAE,+JAA+J;IAC5K,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,OAAO,EAAE;gBACP,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,8DAA8D;aAC5E;YACD,OAAO,EAAE;gBACP,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,8EAA8E;aAC5F;YACD,WAAW,EAAE;gBACX,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACzB,WAAW,EAAE,yFAAyF;aACvG;SACF;QACD,QAAQ,EAAE,CAAC,SAAS,CAAC;KACtB;IACD,WAAW,EAAE;QACX,KAAK,EAAE,2BAA2B;QAClC,QAAQ,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;QAC/B,YAAY,EAAE,IAAI;QAClB,eAAe,EAAE,KAAK;QACtB,cAAc,EAAE,IAAI;QACpB,aAAa,EAAE,KAAK;KACrB;CACF,CAAC;AAUF,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAAC,IAI7C;IACC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC;IAE/C,MAAM,QAAQ,GAAoB;QAChC;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,iBAAiB;YACxB,WAAW,EAAE,sCAAsC;YACnD,SAAS,EAAE;gBACT,uBAAuB;gBACvB,8BAA8B;gBAC9B,kBAAkB;gBAClB,qBAAqB;aACtB;YACD,MAAM,EAAE,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC;SAC7C;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,OAAO;YACd,WAAW,EAAE,sBAAsB;YACnC,SAAS,EAAE;gBACT,0BAA0B;gBAC1B,8BAA8B;gBAC9B,kBAAkB;gBAClB,WAAW;aACZ;YACD,MAAM,EAAE,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC;SACtC;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,gBAAgB;YACvB,WAAW,EAAE,6BAA6B;YAC1C,SAAS,EAAE;gBACT,qBAAqB;gBACrB,oBAAoB;gBACpB,oBAAoB;aACrB;YACD,MAAM,EAAE,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC;SAC7C;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,aAAa;YACpB,WAAW,EAAE,iBAAiB;YAC9B,SAAS,EAAE;gBACT,sBAAsB;gBACtB,yBAAyB;gBACzB,0BAA0B;aAC3B;YACD,MAAM,EAAE,oBAAoB,CAAC,OAAO,EAAE,OAAO,CAAC;SAC/C;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,QAAQ;YACf,WAAW,EAAE,kBAAkB;YAC/B,SAAS,EAAE;gBACT,kCAAkC;gBAClC,gDAAgD;gBAChD,2BAA2B;gBAC3B,kBAAkB;aACnB;YACD,MAAM,EAAE,0BAA0B,CAAC,OAAO,EAAE,OAAO,CAAC;SACrD;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,UAAU;YACjB,WAAW,EAAE,kBAAkB;YAC/B,SAAS,EAAE;gBACT,oBAAoB;gBACpB,wBAAwB;gBACxB,gBAAgB;aACjB;YACD,MAAM,EAAE,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC;SAC1C;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,KAAK;YACZ,WAAW,EAAE,qBAAqB;YAClC,SAAS,EAAE;gBACT,2BAA2B;gBAC3B,6BAA6B;gBAC7B,qBAAqB;aACtB;YACD,MAAM,EAAE,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC;SAC7C;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,QAAQ;YACf,WAAW,EAAE,wBAAwB;YACrC,SAAS,EAAE;gBACT,iBAAiB;gBACjB,8BAA8B;gBAC9B,2BAA2B;aAC5B;YACD,MAAM,EAAE,sBAAsB,CAAC,OAAO,EAAE,OAAO,CAAC;SACjD;QACD;YACE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,OAAO;YACd,WAAW,EAAE,cAAc;YAC3B,SAAS,EAAE;gBACT,mBAAmB;gBACnB,gBAAgB;gBAChB,wBAAwB;aACzB;YACD,MAAM,EAAE,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;SACxC;KACF,CAAC;IAEF,0CAA0C;IAC1C,MAAM,YAAY,GAAG,WAAW,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;QACxD,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACpD,CAAC,CAAC,QAAQ,CAAC;IAEb,MAAM,MAAM,GAAG;QACb,OAAO;QACP,OAAO,EAAE,OAAO,IAAI,gCAAgC;QACpD,aAAa,EAAE,YAAY,CAAC,MAAM;QAClC,eAAe,EAAE,YAAY;QAC7B,OAAO,EAAE,eAAe,CAAC,OAAO,EAAE,YAAY,CAAC;KAChD,CAAC;IAEF,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAEpC,OAAO;QACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;KAC1C,CAAC;AACJ,CAAC;AAED,iBAAiB;AACjB,SAAS,kBAAkB,CAAC,OAAe,EAAE,OAAgB;IAC3D,OAAO;WACE,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,kCAAkC;;WAEhE,OAAO;yBACO,CAAC;AAC1B,CAAC;AAED,SAAS,WAAW,CAAC,OAAe,EAAE,OAAgB;IACpD,MAAM,aAAa,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC;QACnC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC;QACpC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC;QACpC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC;QACtC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAEhE,OAAO;WACE,aAAa,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe;YAChD,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO;;;qCAGL,CAAC;AACtC,CAAC;AAED,SAAS,kBAAkB,CAAC,OAAe,EAAE,OAAgB;IAC3D,OAAO;;WAEE,OAAO;;;;;;;;;+CAS6B,CAAC;AAChD,CAAC;AAED,SAAS,oBAAoB,CAAC,OAAe,EAAE,OAAgB;IAC7D,OAAO;;;;gCAIuB,CAAC;AACjC,CAAC;AAED,SAAS,0BAA0B,CAAC,OAAe,EAAE,OAAgB;IACnE,OAAO;;;;;;;;;;;;;;;aAeI,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,OAAe,EAAE,OAAgB;IACxD,OAAO;;;;8BAIqB,CAAC;AAC/B,CAAC;AAED,SAAS,kBAAkB,CAAC,OAAe,EAAE,OAAgB;IAC3D,OAAO;;;;8BAIqB,CAAC;AAC/B,CAAC;AAED,SAAS,sBAAsB,CAAC,OAAe,EAAE,OAAgB;IAC/D,OAAO;;;;gCAIuB,CAAC;AACjC,CAAC;AAED,SAAS,aAAa,CAAC,OAAe,EAAE,OAAgB;IACtD,OAAO;;;;yCAIgC,CAAC;AAC1C,CAAC;AAED,SAAS,eAAe,CAAC,OAAe,EAAE,KAAsB;IAC9D,OAAO,kBAAkB,OAAO;IAC9B,KAAK,CAAC,MAAM,wDAAwD,CAAC;AACzE,CAAC;AAED,SAAS,YAAY,CAAC,MAAW;IAC/B,IAAI,MAAM,GAAG,mBAAmB,CAAC;IACjC,MAAM,IAAI,WAAW,MAAM,CAAC,OAAO,IAAI,CAAC;IACxC,MAAM,IAAI,aAAa,MAAM,CAAC,OAAO,IAAI,CAAC;IAC1C,MAAM,IAAI,cAAc,MAAM,CAAC,aAAa,QAAQ,CAAC;IACrD,MAAM,IAAI,SAAS,CAAC;IAEpB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;QAC1C,MAAM,IAAI,MAAM,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,MAAM,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,MAAM,CAAC;QACpC,MAAM,IAAI,cAAc,CAAC;QACzB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;YACnC,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC;QACvB,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,KAAK,IAAI,CAAC,MAAM,MAAM,CAAC;QACjC,MAAM,IAAI,SAAS,CAAC;IACtB,CAAC;IAED,MAAM,IAAI,YAAY,MAAM,CAAC,OAAO,EAAE,CAAC;IAEvC,OAAO,MAAM,CAAC;AAChB,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/tools/reasoning/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/tools/reasoning/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC"}
|
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
import { ToolResult, ToolDefinition } from '../../types/tool.js';
|
|
2
|
-
export declare const analyzeProblemDefinition: ToolDefinition;
|
|
3
|
-
export declare function analyzeProblem(args: {
|
|
4
|
-
problem: string;
|
|
5
|
-
domain?: string;
|
|
6
|
-
}): Promise<ToolResult>;
|
|
7
|
-
//# sourceMappingURL=analyzeProblem.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"analyzeProblem.d.ts","sourceRoot":"","sources":["../../../src/tools/thinking/analyzeProblem.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAEjE,eAAO,MAAM,wBAAwB,EAAE,cAmBtC,CAAC;AAEF,wBAAsB,cAAc,CAAC,IAAI,EAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAAC,UAAU,CAAC,CAkCpG"}
|
|
@@ -1,55 +0,0 @@
|
|
|
1
|
-
// Sequential thinking tool - completely independent
|
|
2
|
-
export const analyzeProblemDefinition = {
|
|
3
|
-
name: 'analyze_problem',
|
|
4
|
-
description: '문제 분석|어떻게 접근|분석해줘|analyze this|how to approach|break this down - Break down complex problem into structured steps',
|
|
5
|
-
inputSchema: {
|
|
6
|
-
type: 'object',
|
|
7
|
-
properties: {
|
|
8
|
-
problem: { type: 'string', description: 'Problem to analyze' },
|
|
9
|
-
domain: { type: 'string', description: 'Problem domain' }
|
|
10
|
-
},
|
|
11
|
-
required: ['problem']
|
|
12
|
-
},
|
|
13
|
-
annotations: {
|
|
14
|
-
title: 'Analyze Problem',
|
|
15
|
-
audience: ['user', 'assistant'],
|
|
16
|
-
readOnlyHint: true,
|
|
17
|
-
destructiveHint: false,
|
|
18
|
-
idempotentHint: true,
|
|
19
|
-
openWorldHint: false
|
|
20
|
-
}
|
|
21
|
-
};
|
|
22
|
-
export async function analyzeProblem(args) {
|
|
23
|
-
const { problem, domain = 'general' } = args;
|
|
24
|
-
const problemAnalysis = {
|
|
25
|
-
action: 'analyze_problem',
|
|
26
|
-
problem,
|
|
27
|
-
domain,
|
|
28
|
-
analysis: {
|
|
29
|
-
breakdown: [
|
|
30
|
-
'Define the problem clearly',
|
|
31
|
-
'Identify key constraints and requirements',
|
|
32
|
-
'Break down into smaller sub-problems',
|
|
33
|
-
'Determine solution approach',
|
|
34
|
-
'Plan implementation steps'
|
|
35
|
-
],
|
|
36
|
-
considerations: [
|
|
37
|
-
'What are the inputs and expected outputs?',
|
|
38
|
-
'Are there any edge cases to consider?',
|
|
39
|
-
'What are the performance requirements?',
|
|
40
|
-
'How will this integrate with existing systems?'
|
|
41
|
-
],
|
|
42
|
-
nextSteps: [
|
|
43
|
-
'Research existing solutions',
|
|
44
|
-
'Create detailed implementation plan',
|
|
45
|
-
'Identify potential risks and mitigation strategies',
|
|
46
|
-
'Define success criteria'
|
|
47
|
-
]
|
|
48
|
-
},
|
|
49
|
-
status: 'success'
|
|
50
|
-
};
|
|
51
|
-
return {
|
|
52
|
-
content: [{ type: 'text', text: `Problem: ${problem}\nDomain: ${domain}\n\nBreakdown:\n${problemAnalysis.analysis.breakdown.map((b, i) => `${i + 1}. ${b}`).join('\n')}\n\nConsiderations:\n${problemAnalysis.analysis.considerations.map(c => `- ${c}`).join('\n')}\n\nNext Steps:\n${problemAnalysis.analysis.nextSteps.map(n => `- ${n}`).join('\n')}` }]
|
|
53
|
-
};
|
|
54
|
-
}
|
|
55
|
-
//# sourceMappingURL=analyzeProblem.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"analyzeProblem.js","sourceRoot":"","sources":["../../../src/tools/thinking/analyzeProblem.ts"],"names":[],"mappings":"AAAA,oDAAoD;AAIpD,MAAM,CAAC,MAAM,wBAAwB,GAAmB;IACtD,IAAI,EAAE,iBAAiB;IACvB,WAAW,EAAE,mHAAmH;IAChI,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,oBAAoB,EAAE;YAC9D,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,gBAAgB,EAAE;SAC1D;QACD,QAAQ,EAAE,CAAC,SAAS,CAAC;KACtB;IACD,WAAW,EAAE;QACX,KAAK,EAAE,iBAAiB;QACxB,QAAQ,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;QAC/B,YAAY,EAAE,IAAI;QAClB,eAAe,EAAE,KAAK;QACtB,cAAc,EAAE,IAAI;QACpB,aAAa,EAAE,KAAK;KACrB;CACF,CAAC;AAEF,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAA0C;IAC7E,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC;IAE7C,MAAM,eAAe,GAAG;QACtB,MAAM,EAAE,iBAAiB;QACzB,OAAO;QACP,MAAM;QACN,QAAQ,EAAE;YACR,SAAS,EAAE;gBACT,4BAA4B;gBAC5B,2CAA2C;gBAC3C,sCAAsC;gBACtC,6BAA6B;gBAC7B,2BAA2B;aAC5B;YACD,cAAc,EAAE;gBACd,2CAA2C;gBAC3C,uCAAuC;gBACvC,wCAAwC;gBACxC,gDAAgD;aACjD;YACD,SAAS,EAAE;gBACT,6BAA6B;gBAC7B,qCAAqC;gBACrC,oDAAoD;gBACpD,yBAAyB;aAC1B;SACF;QACD,MAAM,EAAE,SAAS;KAClB,CAAC;IAEF,OAAO;QACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,OAAO,aAAa,MAAM,mBAAmB,eAAe,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,eAAe,CAAC,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,eAAe,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;KAC3V,CAAC;AACJ,CAAC"}
|
|
@@ -1,8 +0,0 @@
|
|
|
1
|
-
import { ToolResult, ToolDefinition } from '../../types/tool.js';
|
|
2
|
-
export declare const breakDownProblemDefinition: ToolDefinition;
|
|
3
|
-
export declare function breakDownProblem(args: {
|
|
4
|
-
problem: string;
|
|
5
|
-
maxDepth?: number;
|
|
6
|
-
approach?: string;
|
|
7
|
-
}): Promise<ToolResult>;
|
|
8
|
-
//# sourceMappingURL=breakDownProblem.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"breakDownProblem.d.ts","sourceRoot":"","sources":["../../../src/tools/thinking/breakDownProblem.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAiBjE,eAAO,MAAM,0BAA0B,EAAE,cAoBxC,CAAC;AAEF,wBAAsB,gBAAgB,CAAC,IAAI,EAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAAC,UAAU,CAAC,CAwH3H"}
|
|
@@ -1,145 +0,0 @@
|
|
|
1
|
-
// Sequential thinking tool - completely independent
|
|
2
|
-
import { Project, ScriptKind } from "ts-morph";
|
|
3
|
-
const AST_PROJECT = new Project({
|
|
4
|
-
useInMemoryFileSystem: true,
|
|
5
|
-
compilerOptions: { allowJs: true, skipLibCheck: true }
|
|
6
|
-
});
|
|
7
|
-
export const breakDownProblemDefinition = {
|
|
8
|
-
name: 'break_down_problem',
|
|
9
|
-
description: '나눠서|단계별로|세분화|break down|divide|split into parts - Break complex problems into sub-problems',
|
|
10
|
-
inputSchema: {
|
|
11
|
-
type: 'object',
|
|
12
|
-
properties: {
|
|
13
|
-
problem: { type: 'string', description: 'Complex problem to break down' },
|
|
14
|
-
maxDepth: { type: 'number', description: 'Maximum breakdown depth' },
|
|
15
|
-
approach: { type: 'string', description: 'Breakdown approach', enum: ['sequential', 'hierarchical', 'dependency-based'] }
|
|
16
|
-
},
|
|
17
|
-
required: ['problem']
|
|
18
|
-
},
|
|
19
|
-
annotations: {
|
|
20
|
-
title: 'Break Down Problem',
|
|
21
|
-
audience: ['user', 'assistant'],
|
|
22
|
-
readOnlyHint: true,
|
|
23
|
-
destructiveHint: false,
|
|
24
|
-
idempotentHint: true,
|
|
25
|
-
openWorldHint: false
|
|
26
|
-
}
|
|
27
|
-
};
|
|
28
|
-
export async function breakDownProblem(args) {
|
|
29
|
-
const { problem: breakdownProblem, maxDepth = 3, approach = 'hierarchical' } = args;
|
|
30
|
-
// 코드로 추정되는 입력이면 AST 기반 구조 분해 시도
|
|
31
|
-
let codeStructureSubProblems = null;
|
|
32
|
-
if (breakdownProblem.includes('function') || breakdownProblem.includes('class') || breakdownProblem.includes('=>')) {
|
|
33
|
-
try {
|
|
34
|
-
const sourceFile = AST_PROJECT.createSourceFile('temp.ts', breakdownProblem, {
|
|
35
|
-
overwrite: true,
|
|
36
|
-
scriptKind: ScriptKind.TS
|
|
37
|
-
});
|
|
38
|
-
const funcs = sourceFile.getFunctions();
|
|
39
|
-
const classes = sourceFile.getClasses();
|
|
40
|
-
const vars = sourceFile.getVariableDeclarations();
|
|
41
|
-
codeStructureSubProblems = [];
|
|
42
|
-
funcs.forEach((f, i) => {
|
|
43
|
-
codeStructureSubProblems.push({
|
|
44
|
-
id: `codeFunc${i + 1}`,
|
|
45
|
-
title: `함수 분석: ${f.getName() || '익명함수'}`,
|
|
46
|
-
description: f.getText().slice(0, 100) + (f.getText().length > 100 ? '...' : ''),
|
|
47
|
-
complexity: 'medium',
|
|
48
|
-
priority: 'high',
|
|
49
|
-
dependencies: []
|
|
50
|
-
});
|
|
51
|
-
});
|
|
52
|
-
classes.forEach((c, i) => {
|
|
53
|
-
codeStructureSubProblems.push({
|
|
54
|
-
id: `codeClass${i + 1}`,
|
|
55
|
-
title: `클래스 분석: ${c.getName() || '익명클래스'}`,
|
|
56
|
-
description: c.getText().slice(0, 100) + (c.getText().length > 100 ? '...' : ''),
|
|
57
|
-
complexity: 'high',
|
|
58
|
-
priority: 'high',
|
|
59
|
-
dependencies: []
|
|
60
|
-
});
|
|
61
|
-
});
|
|
62
|
-
vars.forEach((v, i) => {
|
|
63
|
-
codeStructureSubProblems.push({
|
|
64
|
-
id: `codeVar${i + 1}`,
|
|
65
|
-
title: `변수 분석: ${v.getName()}`,
|
|
66
|
-
description: v.getText().slice(0, 100) + (v.getText().length > 100 ? '...' : ''),
|
|
67
|
-
complexity: 'low',
|
|
68
|
-
priority: 'medium',
|
|
69
|
-
dependencies: []
|
|
70
|
-
});
|
|
71
|
-
});
|
|
72
|
-
if (codeStructureSubProblems.length === 0)
|
|
73
|
-
codeStructureSubProblems = null;
|
|
74
|
-
}
|
|
75
|
-
catch (e) {
|
|
76
|
-
codeStructureSubProblems = null;
|
|
77
|
-
}
|
|
78
|
-
}
|
|
79
|
-
const generateSubProblems = (parentProblem, depth, maxDepth) => {
|
|
80
|
-
if (depth >= maxDepth)
|
|
81
|
-
return null;
|
|
82
|
-
const subProblems = [
|
|
83
|
-
{
|
|
84
|
-
id: `${depth}.1`,
|
|
85
|
-
title: `Understanding ${parentProblem}`,
|
|
86
|
-
description: `Analyze and understand the core aspects of ${parentProblem}`,
|
|
87
|
-
complexity: 'low',
|
|
88
|
-
priority: 'high',
|
|
89
|
-
dependencies: []
|
|
90
|
-
},
|
|
91
|
-
{
|
|
92
|
-
id: `${depth}.2`,
|
|
93
|
-
title: `Planning solution for ${parentProblem}`,
|
|
94
|
-
description: `Create detailed plan to solve ${parentProblem}`,
|
|
95
|
-
complexity: 'medium',
|
|
96
|
-
priority: 'high',
|
|
97
|
-
dependencies: [`${depth}.1`]
|
|
98
|
-
},
|
|
99
|
-
{
|
|
100
|
-
id: `${depth}.3`,
|
|
101
|
-
title: `Implementing solution for ${parentProblem}`,
|
|
102
|
-
description: `Execute the planned solution for ${parentProblem}`,
|
|
103
|
-
complexity: 'high',
|
|
104
|
-
priority: 'medium',
|
|
105
|
-
dependencies: [`${depth}.2`]
|
|
106
|
-
}
|
|
107
|
-
];
|
|
108
|
-
if (depth < maxDepth - 1) {
|
|
109
|
-
subProblems.forEach((subProblem) => {
|
|
110
|
-
subProblem.subProblems = generateSubProblems(subProblem.title, depth + 1, maxDepth);
|
|
111
|
-
});
|
|
112
|
-
}
|
|
113
|
-
return subProblems;
|
|
114
|
-
};
|
|
115
|
-
const problemBreakdown = {
|
|
116
|
-
action: 'break_down_problem',
|
|
117
|
-
problem: breakdownProblem,
|
|
118
|
-
approach,
|
|
119
|
-
maxDepth,
|
|
120
|
-
breakdown: {
|
|
121
|
-
rootProblem: {
|
|
122
|
-
id: '0',
|
|
123
|
-
title: breakdownProblem,
|
|
124
|
-
description: `Root problem: ${breakdownProblem}`,
|
|
125
|
-
complexity: 'high',
|
|
126
|
-
subProblems: codeStructureSubProblems || generateSubProblems(breakdownProblem, 1, maxDepth)
|
|
127
|
-
}
|
|
128
|
-
},
|
|
129
|
-
executionOrder: approach === 'dependency-based' ?
|
|
130
|
-
['Understanding phase', 'Planning phase', 'Implementation phase'] :
|
|
131
|
-
approach === 'sequential' ?
|
|
132
|
-
['Step 1', 'Step 2', 'Step 3', '...'] :
|
|
133
|
-
['Top-level analysis', 'Mid-level breakdown', 'Detailed tasks'],
|
|
134
|
-
status: 'success'
|
|
135
|
-
};
|
|
136
|
-
const formatSubProblems = (subs, indent = 0) => {
|
|
137
|
-
if (!subs)
|
|
138
|
-
return '';
|
|
139
|
-
return subs.map(s => `${' '.repeat(indent)}- ${s.title} (${s.complexity}, ${s.priority})${s.subProblems ? '\n' + formatSubProblems(s.subProblems, indent + 1) : ''}`).join('\n');
|
|
140
|
-
};
|
|
141
|
-
return {
|
|
142
|
-
content: [{ type: 'text', text: `Problem: ${breakdownProblem}\nApproach: ${approach}\nMax Depth: ${maxDepth}\n\nBreakdown:\n${formatSubProblems(problemBreakdown.breakdown.rootProblem.subProblems)}\n\nExecution: ${problemBreakdown.executionOrder.join(' → ')}` }]
|
|
143
|
-
};
|
|
144
|
-
}
|
|
145
|
-
//# sourceMappingURL=breakDownProblem.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"breakDownProblem.js","sourceRoot":"","sources":["../../../src/tools/thinking/breakDownProblem.ts"],"names":[],"mappings":"AAAA,oDAAoD;AAEpD,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAG/C,MAAM,WAAW,GAAG,IAAI,OAAO,CAAC;IAC9B,qBAAqB,EAAE,IAAI;IAC3B,eAAe,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE;CACvD,CAAC,CAAC;AAYH,MAAM,CAAC,MAAM,0BAA0B,GAAmB;IACxD,IAAI,EAAE,oBAAoB;IAC1B,WAAW,EAAE,4FAA4F;IACzG,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,+BAA+B,EAAE;YACzE,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,yBAAyB,EAAE;YACpE,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,oBAAoB,EAAE,IAAI,EAAE,CAAC,YAAY,EAAE,cAAc,EAAE,kBAAkB,CAAC,EAAE;SAC1H;QACD,QAAQ,EAAE,CAAC,SAAS,CAAC;KACtB;IACD,WAAW,EAAE;QACX,KAAK,EAAE,oBAAoB;QAC3B,QAAQ,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;QAC/B,YAAY,EAAE,IAAI;QAClB,eAAe,EAAE,KAAK;QACtB,cAAc,EAAE,IAAI;QACpB,aAAa,EAAE,KAAK;KACrB;CACF,CAAC;AAEF,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,IAA+D;IACpG,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,cAAc,EAAE,GAAG,IAAI,CAAC;IAEpF,gCAAgC;IAChC,IAAI,wBAAwB,GAAwB,IAAI,CAAC;IACzD,IAAI,gBAAgB,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACnH,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,WAAW,CAAC,gBAAgB,CAAC,SAAS,EAAE,gBAAgB,EAAE;gBAC3E,SAAS,EAAE,IAAI;gBACf,UAAU,EAAE,UAAU,CAAC,EAAE;aAC1B,CAAC,CAAC;YACH,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,UAAU,CAAC,uBAAuB,EAAE,CAAC;YAClD,wBAAwB,GAAG,EAAE,CAAC;YAC9B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACrB,wBAAyB,CAAC,IAAI,CAAC;oBAC7B,EAAE,EAAE,WAAW,CAAC,GAAC,CAAC,EAAE;oBACpB,KAAK,EAAE,UAAU,CAAC,CAAC,OAAO,EAAE,IAAI,MAAM,EAAE;oBACxC,WAAW,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChF,UAAU,EAAE,QAAQ;oBACpB,QAAQ,EAAE,MAAM;oBAChB,YAAY,EAAE,EAAE;iBACjB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;YACH,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,wBAAyB,CAAC,IAAI,CAAC;oBAC7B,EAAE,EAAE,YAAY,CAAC,GAAC,CAAC,EAAE;oBACrB,KAAK,EAAE,WAAW,CAAC,CAAC,OAAO,EAAE,IAAI,OAAO,EAAE;oBAC1C,WAAW,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChF,UAAU,EAAE,MAAM;oBAClB,QAAQ,EAAE,MAAM;oBAChB,YAAY,EAAE,EAAE;iBACjB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACpB,wBAAyB,CAAC,IAAI,CAAC;oBAC7B,EAAE,EAAE,UAAU,CAAC,GAAC,CAAC,EAAE;oBACnB,KAAK,EAAE,UAAU,CAAC,CAAC,OAAO,EAAE,EAAE;oBAC9B,WAAW,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChF,UAAU,EAAE,KAAK;oBACjB,QAAQ,EAAE,QAAQ;oBAClB,YAAY,EAAE,EAAE;iBACjB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;YACH,IAAI,wBAAwB,CAAC,MAAM,KAAK,CAAC;gBAAE,wBAAwB,GAAG,IAAI,CAAC;QAC7E,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,wBAAwB,GAAG,IAAI,CAAC;QAClC,CAAC;IACH,CAAC;IAED,MAAM,mBAAmB,GAAG,CAAC,aAAqB,EAAE,KAAa,EAAE,QAAgB,EAAuB,EAAE;QAC1G,IAAI,KAAK,IAAI,QAAQ;YAAE,OAAO,IAAI,CAAC;QAEnC,MAAM,WAAW,GAAiB;YAChC;gBACE,EAAE,EAAE,GAAG,KAAK,IAAI;gBAChB,KAAK,EAAE,iBAAiB,aAAa,EAAE;gBACvC,WAAW,EAAE,8CAA8C,aAAa,EAAE;gBAC1E,UAAU,EAAE,KAAc;gBAC1B,QAAQ,EAAE,MAAe;gBACzB,YAAY,EAAE,EAAE;aACjB;YACD;gBACE,EAAE,EAAE,GAAG,KAAK,IAAI;gBAChB,KAAK,EAAE,yBAAyB,aAAa,EAAE;gBAC/C,WAAW,EAAE,iCAAiC,aAAa,EAAE;gBAC7D,UAAU,EAAE,QAAiB;gBAC7B,QAAQ,EAAE,MAAe;gBACzB,YAAY,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC;aAC7B;YACD;gBACE,EAAE,EAAE,GAAG,KAAK,IAAI;gBAChB,KAAK,EAAE,6BAA6B,aAAa,EAAE;gBACnD,WAAW,EAAE,oCAAoC,aAAa,EAAE;gBAChE,UAAU,EAAE,MAAe;gBAC3B,QAAQ,EAAE,QAAiB;gBAC3B,YAAY,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC;aAC7B;SACF,CAAC;QAEF,IAAI,KAAK,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC;YACzB,WAAW,CAAC,OAAO,CAAC,CAAC,UAAsB,EAAE,EAAE;gBAC7C,UAAU,CAAC,WAAW,GAAG,mBAAmB,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtF,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC;IAEF,MAAM,gBAAgB,GAAG;QACvB,MAAM,EAAE,oBAAoB;QAC5B,OAAO,EAAE,gBAAgB;QACzB,QAAQ;QACR,QAAQ;QACR,SAAS,EAAE;YACT,WAAW,EAAE;gBACX,EAAE,EAAE,GAAG;gBACP,KAAK,EAAE,gBAAgB;gBACvB,WAAW,EAAE,iBAAiB,gBAAgB,EAAE;gBAChD,UAAU,EAAE,MAAM;gBAClB,WAAW,EAAE,wBAAwB,IAAI,mBAAmB,CAAC,gBAAgB,EAAE,CAAC,EAAE,QAAQ,CAAC;aAC5F;SACF;QACD,cAAc,EAAE,QAAQ,KAAK,kBAAkB,CAAC,CAAC;YAC/C,CAAC,qBAAqB,EAAE,gBAAgB,EAAE,sBAAsB,CAAC,CAAC,CAAC;YACnE,QAAQ,KAAK,YAAY,CAAC,CAAC;gBAC3B,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;gBACvC,CAAC,oBAAoB,EAAE,qBAAqB,EAAE,gBAAgB,CAAC;QACjE,MAAM,EAAE,SAAS;KAClB,CAAC;IAEF,MAAM,iBAAiB,GAAG,CAAC,IAAyB,EAAE,MAAM,GAAG,CAAC,EAAU,EAAE;QAC1E,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpL,CAAC,CAAC;IAEF,OAAO;QACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,gBAAgB,eAAe,QAAQ,gBAAgB,QAAQ,mBAAmB,iBAAiB,CAAC,gBAAgB,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,gBAAgB,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;KACtQ,CAAC;AACJ,CAAC"}
|
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
import { ToolResult, ToolDefinition } from '../../types/tool.js';
|
|
2
|
-
export declare const createThinkingChainDefinition: ToolDefinition;
|
|
3
|
-
export declare function createThinkingChain(args: {
|
|
4
|
-
topic: string;
|
|
5
|
-
steps?: number;
|
|
6
|
-
}): Promise<ToolResult>;
|
|
7
|
-
//# sourceMappingURL=createThinkingChain.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"createThinkingChain.d.ts","sourceRoot":"","sources":["../../../src/tools/thinking/createThinkingChain.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAEjE,eAAO,MAAM,6BAA6B,EAAE,cAmB3C,CAAC;AAEF,wBAAsB,mBAAmB,CAAC,IAAI,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAAC,UAAU,CAAC,CAuBtG"}
|
|
@@ -1,44 +0,0 @@
|
|
|
1
|
-
// Sequential thinking tool - completely independent
|
|
2
|
-
export const createThinkingChainDefinition = {
|
|
3
|
-
name: 'create_thinking_chain',
|
|
4
|
-
description: '생각 과정|사고 흐름|연쇄적으로|thinking process|chain of thought|reasoning chain - Create sequential thinking chain',
|
|
5
|
-
inputSchema: {
|
|
6
|
-
type: 'object',
|
|
7
|
-
properties: {
|
|
8
|
-
topic: { type: 'string', description: 'Topic to think about' },
|
|
9
|
-
steps: { type: 'number', description: 'Number of thinking steps' }
|
|
10
|
-
},
|
|
11
|
-
required: ['topic']
|
|
12
|
-
},
|
|
13
|
-
annotations: {
|
|
14
|
-
title: 'Create Thinking Chain',
|
|
15
|
-
audience: ['user', 'assistant'],
|
|
16
|
-
readOnlyHint: true,
|
|
17
|
-
destructiveHint: false,
|
|
18
|
-
idempotentHint: true,
|
|
19
|
-
openWorldHint: false
|
|
20
|
-
}
|
|
21
|
-
};
|
|
22
|
-
export async function createThinkingChain(args) {
|
|
23
|
-
const { topic, steps = 5 } = args;
|
|
24
|
-
const thinkingChain = {
|
|
25
|
-
action: 'create_thinking_chain',
|
|
26
|
-
topic,
|
|
27
|
-
steps,
|
|
28
|
-
chain: Array.from({ length: steps }, (_, i) => ({
|
|
29
|
-
step: i + 1,
|
|
30
|
-
title: `Step ${i + 1}: Analyze ${topic}`,
|
|
31
|
-
content: `Think about ${topic} from perspective ${i + 1}`,
|
|
32
|
-
questions: [
|
|
33
|
-
`What are the key aspects of ${topic}?`,
|
|
34
|
-
`How does this relate to the overall problem?`,
|
|
35
|
-
`What are the potential implications?`
|
|
36
|
-
]
|
|
37
|
-
})),
|
|
38
|
-
status: 'success'
|
|
39
|
-
};
|
|
40
|
-
return {
|
|
41
|
-
content: [{ type: 'text', text: `Topic: ${topic}\nSteps: ${steps}\n\n${thinkingChain.chain.map(s => `${s.step}. ${s.title}\n ${s.content}\n Q: ${s.questions.join(', ')}`).join('\n\n')}` }]
|
|
42
|
-
};
|
|
43
|
-
}
|
|
44
|
-
//# sourceMappingURL=createThinkingChain.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"createThinkingChain.js","sourceRoot":"","sources":["../../../src/tools/thinking/createThinkingChain.ts"],"names":[],"mappings":"AAAA,oDAAoD;AAIpD,MAAM,CAAC,MAAM,6BAA6B,GAAmB;IAC3D,IAAI,EAAE,uBAAuB;IAC7B,WAAW,EAAE,wGAAwG;IACrH,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,sBAAsB,EAAE;YAC9D,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,0BAA0B,EAAE;SACnE;QACD,QAAQ,EAAE,CAAC,OAAO,CAAC;KACpB;IACD,WAAW,EAAE;QACX,KAAK,EAAE,uBAAuB;QAC9B,QAAQ,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;QAC/B,YAAY,EAAE,IAAI;QAClB,eAAe,EAAE,KAAK;QACtB,cAAc,EAAE,IAAI;QACpB,aAAa,EAAE,KAAK;KACrB;CACF,CAAC;AAEF,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,IAAuC;IAC/E,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;IAElC,MAAM,aAAa,GAAG;QACpB,MAAM,EAAE,uBAAuB;QAC/B,KAAK;QACL,KAAK;QACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9C,IAAI,EAAE,CAAC,GAAG,CAAC;YACX,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,aAAa,KAAK,EAAE;YACxC,OAAO,EAAE,eAAe,KAAK,qBAAqB,CAAC,GAAG,CAAC,EAAE;YACzD,SAAS,EAAE;gBACT,+BAA+B,KAAK,GAAG;gBACvC,8CAA8C;gBAC9C,sCAAsC;aACvC;SACF,CAAC,CAAC;QACH,MAAM,EAAE,SAAS;KAClB,CAAC;IAEF,OAAO;QACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,KAAK,YAAY,KAAK,OAAO,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,OAAO,WAAW,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;KACjM,CAAC;AACJ,CAAC"}
|
|
@@ -1,9 +0,0 @@
|
|
|
1
|
-
import { ToolResult, ToolDefinition } from '../../types/tool.js';
|
|
2
|
-
export declare const formatAsPlanDefinition: ToolDefinition;
|
|
3
|
-
export declare function formatAsPlan(args: {
|
|
4
|
-
content: string;
|
|
5
|
-
priority?: string;
|
|
6
|
-
includeTimeEstimates?: boolean;
|
|
7
|
-
includeCheckboxes?: boolean;
|
|
8
|
-
}): Promise<ToolResult>;
|
|
9
|
-
//# sourceMappingURL=formatAsPlan.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"formatAsPlan.d.ts","sourceRoot":"","sources":["../../../src/tools/thinking/formatAsPlan.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAEjE,eAAO,MAAM,sBAAsB,EAAE,cAqBpC,CAAC;AAEF,wBAAsB,YAAY,CAAC,IAAI,EAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAAC,iBAAiB,CAAC,EAAE,OAAO,CAAA;CAAE,GAAG,OAAO,CAAC,UAAU,CAAC,CAwDjK"}
|