tracelattice 1.2.5

package/dist/core/ThoughtEvaluator.js

@@ -0,0 +1,346 @@
+const ALL_THOUGHT_TYPES = [
+    'regular',
+    'hypothesis',
+    'verification',
+    'critique',
+    'synthesis',
+    'meta'
+];
+class ThoughtEvaluator {
+    computeConfidenceSignals(history, branches) {
+        const typeDistribution = this._countByType(history);
+        const allConfidences = history.map((t)=>t.confidence).filter((c)=>void 0 !== c);
+        const structuralResult = this._computeStructuralQuality(history, branches, typeDistribution, allConfidences);
+        return {
+            reasoning_depth: history.length,
+            revision_count: history.filter((t)=>t.is_revision).length,
+            branch_count: Object.keys(branches).length,
+            thought_type_distribution: typeDistribution,
+            has_hypothesis: history.some((t)=>'hypothesis' === t.thought_type),
+            has_verification: history.some((t)=>'verification' === t.thought_type),
+            average_confidence: allConfidences.length > 0 ? allConfidences.reduce((a, b)=>a + b, 0) / allConfidences.length : null,
+            ...null !== structuralResult && {
+                structural_quality: structuralResult.score,
+                quality_components: structuralResult.components
+            }
+        };
+    }
+    computeReasoningStats(history, branches) {
+        const typeCounts = this._countByType(history);
+        const allScores = history.map((t)=>t.quality_score).filter((s)=>void 0 !== s);
+        const allConfidences = history.map((t)=>t.confidence).filter((c)=>void 0 !== c);
+        const hypotheses = history.filter((t)=>'hypothesis' === t.thought_type);
+        const hypothesisIds = new Set(hypotheses.map((t)=>t.hypothesis_id).filter(Boolean));
+        const verifiedIds = new Set(history.filter((t)=>'verification' === t.thought_type && t.hypothesis_id).map((t)=>t.hypothesis_id));
+        const unresolvedCount = [
+            ...hypothesisIds
+        ].filter((id)=>!verifiedIds.has(id)).length;
+        return {
+            total_thoughts: history.length,
+            total_branches: Object.keys(branches).length,
+            total_revisions: history.filter((t)=>t.is_revision).length,
+            total_merges: history.filter((t)=>(t.merge_from_thoughts?.length ?? 0) > 0 || (t.merge_branch_ids?.length ?? 0) > 0).length,
+            chain_depth: this._computeChainDepth(history),
+            thought_type_counts: typeCounts,
+            hypothesis_count: hypothesisIds.size,
+            verified_hypothesis_count: [
+                ...hypothesisIds
+            ].filter((id)=>verifiedIds.has(id)).length,
+            unresolved_hypothesis_count: unresolvedCount,
+            average_quality_score: allScores.length > 0 ? allScores.reduce((a, b)=>a + b, 0) / allScores.length : null,
+            average_confidence: allConfidences.length > 0 ? allConfidences.reduce((a, b)=>a + b, 0) / allConfidences.length : null
+        };
+    }
+    computePatternSignals(history, branches) {
+        if (0 === history.length) return [];
+        const signals = [];
+        signals.push(...this._detectConsecutiveWithoutVerification(history));
+        signals.push(...this._detectUnverifiedHypothesis(history));
+        signals.push(...this._detectNoAlternativesExplored(history, branches));
+        signals.push(...this._detectMonotonicType(history));
+        signals.push(...this._detectConfidenceDrift(history));
+        signals.push(...this._detectHealthyVerification(history));
+        return signals;
+    }
+    _detectConsecutiveWithoutVerification(history) {
+        const signals = [];
+        let runStart = 0;
+        for(let i = 0; i < history.length; i++){
+            const type = history[i].thought_type ?? 'regular';
+            if ('verification' === type) {
+                runStart = i + 1;
+                continue;
+            }
+            if (i - runStart + 1 >= 3) {
+                const start = history[runStart].thought_number ?? runStart + 1;
+                const end = history[i].thought_number ?? i + 1;
+                signals.push({
+                    pattern: 'consecutive_without_verification',
+                    severity: 'warning',
+                    message: `3+ consecutive thoughts (${start}-${end}) without verification`,
+                    thought_range: [
+                        start,
+                        end
+                    ]
+                });
+                runStart = i + 1;
+            }
+        }
+        return signals;
+    }
+    _detectUnverifiedHypothesis(history) {
+        const signals = [];
+        for(let i = 0; i < history.length; i++){
+            if ('hypothesis' !== history[i].thought_type) continue;
+            const remaining = history.length - i - 1;
+            if (remaining < 3) continue;
+            const lookahead = history.slice(i + 1, i + 4);
+            const hasVerification = lookahead.some((t)=>'verification' === t.thought_type);
+            if (!hasVerification) {
+                const n = history[i].thought_number ?? i + 1;
+                signals.push({
+                    pattern: 'unverified_hypothesis',
+                    severity: 'warning',
+                    message: `Hypothesis at thought ${n} has not been verified within 3 thoughts`,
+                    thought_range: [
+                        n,
+                        n
+                    ]
+                });
+            }
+        }
+        return signals;
+    }
+    _detectNoAlternativesExplored(history, branches) {
+        if (history.length < 5) return [];
+        if (history.some((t)=>'critique' === t.thought_type)) return [];
+        if (Object.keys(branches).length > 0) return [];
+        const start = history[0].thought_number ?? 1;
+        const end = history[history.length - 1].thought_number ?? history.length;
+        return [
+            {
+                pattern: 'no_alternatives_explored',
+                severity: 'info',
+                message: '5+ thoughts with no critique or branching — consider exploring alternatives',
+                thought_range: [
+                    start,
+                    end
+                ]
+            }
+        ];
+    }
+    _detectMonotonicType(history) {
+        if (history.length < 5) return [];
+        const hasExplicitType = history.some((t)=>void 0 !== t.thought_type);
+        if (!hasExplicitType) return [];
+        const signals = [];
+        let runType = history[0].thought_type ?? 'regular';
+        let runStart = 0;
+        let runLength = 1;
+        for(let i = 1; i < history.length; i++){
+            const type = history[i].thought_type ?? 'regular';
+            if (type === runType) runLength++;
+            else {
+                if (runLength >= 4) {
+                    const start = history[runStart].thought_number ?? runStart + 1;
+                    const end = history[runStart + runLength - 1].thought_number ?? runStart + runLength;
+                    signals.push({
+                        pattern: 'monotonic_type',
+                        severity: 'info',
+                        message: `4+ consecutive '${runType}' thoughts (${start}-${end}) — consider varying approach`,
+                        thought_range: [
+                            start,
+                            end
+                        ]
+                    });
+                }
+                runType = type;
+                runStart = i;
+                runLength = 1;
+            }
+        }
+        if (runLength >= 4) {
+            const start = history[runStart].thought_number ?? runStart + 1;
+            const end = history[runStart + runLength - 1].thought_number ?? runStart + runLength;
+            signals.push({
+                pattern: 'monotonic_type',
+                severity: 'info',
+                message: `4+ consecutive '${runType}' thoughts (${start}-${end}) — consider varying approach`,
+                thought_range: [
+                    start,
+                    end
+                ]
+            });
+        }
+        return signals;
+    }
+    _detectConfidenceDrift(history) {
+        const signals = [];
+        let runStart = -1;
+        let runLength = 0;
+        let prevConf = -1;
+        for(let i = 0; i < history.length; i++){
+            const conf = history[i].confidence;
+            if (void 0 === conf) {
+                if (runLength >= 3) {
+                    const start = history[runStart].thought_number ?? runStart + 1;
+                    const end = history[runStart + runLength - 1].thought_number ?? runStart + runLength;
+                    const firstConf = history[runStart].confidence;
+                    const lastConf = history[runStart + runLength - 1].confidence;
+                    signals.push({
+                        pattern: 'confidence_drift',
+                        severity: 'warning',
+                        message: `Confidence decreasing across thoughts ${start}-${end} (${firstConf} → ${lastConf})`,
+                        thought_range: [
+                            start,
+                            end
+                        ]
+                    });
+                }
+                runStart = -1;
+                runLength = 0;
+                prevConf = -1;
+                continue;
+            }
+            if (0 === runLength) {
+                runStart = i;
+                runLength = 1;
+                prevConf = conf;
+            } else if (conf < prevConf) {
+                runLength++;
+                prevConf = conf;
+            } else {
+                if (runLength >= 3) {
+                    const start = history[runStart].thought_number ?? runStart + 1;
+                    const end = history[runStart + runLength - 1].thought_number ?? runStart + runLength;
+                    const firstConf = history[runStart].confidence;
+                    const lastConf = history[runStart + runLength - 1].confidence;
+                    signals.push({
+                        pattern: 'confidence_drift',
+                        severity: 'warning',
+                        message: `Confidence decreasing across thoughts ${start}-${end} (${firstConf} → ${lastConf})`,
+                        thought_range: [
+                            start,
+                            end
+                        ]
+                    });
+                }
+                runStart = i;
+                runLength = 1;
+                prevConf = conf;
+            }
+        }
+        if (runLength >= 3) {
+            const start = history[runStart].thought_number ?? runStart + 1;
+            const end = history[runStart + runLength - 1].thought_number ?? runStart + runLength;
+            const firstConf = history[runStart].confidence;
+            const lastConf = history[runStart + runLength - 1].confidence;
+            signals.push({
+                pattern: 'confidence_drift',
+                severity: 'warning',
+                message: `Confidence decreasing across thoughts ${start}-${end} (${firstConf} → ${lastConf})`,
+                thought_range: [
+                    start,
+                    end
+                ]
+            });
+        }
+        return signals;
+    }
+    _detectHealthyVerification(history) {
+        const signals = [];
+        for(let i = 0; i < history.length; i++){
+            if ('hypothesis' !== history[i].thought_type) continue;
+            const hypId = history[i].hypothesis_id;
+            const lookahead = history.slice(i + 1, i + 4);
+            const verifier = lookahead.find((t)=>'verification' === t.thought_type && (t.hypothesis_id === hypId || t.verification_target === (history[i].thought_number ?? i + 1)));
+            if (verifier) {
+                const n = history[i].thought_number ?? i + 1;
+                const m = verifier.thought_number ?? history.indexOf(verifier) + 1;
+                signals.push({
+                    pattern: 'healthy_verification',
+                    severity: 'info',
+                    message: `Hypothesis at thought ${n} verified at thought ${m} — good practice`,
+                    thought_range: [
+                        n,
+                        m
+                    ]
+                });
+            }
+        }
+        return signals;
+    }
+    _countByType(thoughts) {
+        const counts = Object.fromEntries(ALL_THOUGHT_TYPES.map((t)=>[
+                t,
+                0
+            ]));
+        for (const thought of thoughts){
+            const type = thought.thought_type ?? 'regular';
+            if (type in counts) counts[type]++;
+        }
+        return counts;
+    }
+    _computeChainDepth(history) {
+        if (0 === history.length) return 0;
+        let maxDepth = 1;
+        let currentDepth = 1;
+        for(let i = 1; i < history.length; i++){
+            const thought = history[i];
+            if (thought.branch_from_thought) currentDepth = 1;
+            else {
+                currentDepth++;
+                maxDepth = Math.max(maxDepth, currentDepth);
+            }
+        }
+        return maxDepth;
+    }
+    _computeStructuralQuality(history, branches, typeDistribution, confidences) {
+        if (0 === history.length) return null;
+        const FLOOR = 0.01;
+        const total = history.length;
+        let entropy = 0;
+        for (const type of ALL_THOUGHT_TYPES){
+            const count = typeDistribution[type];
+            if (count > 0) {
+                const pk = count / total;
+                entropy -= pk * Math.log2(pk);
+            }
+        }
+        const typeDiversity = Math.max(entropy / Math.log2(6), FLOOR);
+        const hypotheses = history.filter((t)=>'hypothesis' === t.thought_type);
+        const hypothesisIds = new Set(hypotheses.map((t)=>t.hypothesis_id).filter(Boolean));
+        const verifiedIds = new Set(history.filter((t)=>'verification' === t.thought_type && t.hypothesis_id).map((t)=>t.hypothesis_id));
+        const verificationCoverage = 0 === hypothesisIds.size ? 1.0 : Math.max([
+            ...hypothesisIds
+        ].filter((id)=>verifiedIds.has(id)).length / hypothesisIds.size, FLOOR);
+        const chainDepth = this._computeChainDepth(history);
+        const branchCount = Object.keys(branches).length;
+        const effectiveDepth = Math.max(chainDepth, branchCount + 1);
+        const depthEfficiency = Math.max(Math.min(effectiveDepth / total, 1.0), FLOOR);
+        const confidenceStability = this._computeConfidenceStability(confidences);
+        const components = {
+            type_diversity: typeDiversity,
+            verification_coverage: verificationCoverage,
+            depth_efficiency: depthEfficiency,
+            confidence_stability: confidenceStability
+        };
+        const score = Math.pow(typeDiversity, 0.3) * Math.pow(verificationCoverage, 0.3) * Math.pow(depthEfficiency, 0.2) * Math.pow(confidenceStability, 0.2);
+        return {
+            score,
+            components
+        };
+    }
+    _computeConfidenceStability(confidences) {
+        const FLOOR = 0.01;
+        if (0 === confidences.length) return Math.max(0.5, FLOOR);
+        if (1 === confidences.length) return Math.max(1.0, FLOOR);
+        const mean = confidences.reduce((a, b)=>a + b, 0) / confidences.length;
+        const variance = confidences.reduce((sum, c)=>sum + (c - mean) ** 2, 0) / confidences.length;
+        const stddev = Math.sqrt(variance);
+        return Math.max(1 - stddev, FLOOR);
+    }
+}
+export { ThoughtEvaluator };
+
+//# sourceMappingURL=ThoughtEvaluator.js.map

package/dist/core/ThoughtEvaluator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"core/ThoughtEvaluator.js","sources":["../../src/core/ThoughtEvaluator.ts"],"sourcesContent":["/**\n * Quality signal computation for sequential thinking.\n *\n * Provides the {@link ThoughtEvaluator} class — a stateless service that computes\n * confidence signals and reasoning analytics from thought history. Follows the\n * ThoughtFormatter pattern as a composed dependency of ThoughtProcessor.\n *\n * @module core/evaluator\n */\n\nimport type { ConfidenceSignals, PatternSignal, ReasoningStats, ThoughtType } from './reasoning.js';\nimport type { ThoughtData } from './thought.js';\n\n/** All valid thought types for distribution counting. */\nconst ALL_THOUGHT_TYPES: ThoughtType[] = [\n\t'regular',\n\t'hypothesis',\n\t'verification',\n\t'critique',\n\t'synthesis',\n\t'meta',\n];\n\n/**\n * Stateless service that computes quality signals and reasoning analytics\n * from thought history and branch data.\n *\n * @remarks\n * All methods are pure computations — no side effects, no I/O, no internal state.\n * Designed to be registered as transient in the DI container.\n *\n * @example\n * ```typescript\n * const evaluator = new ThoughtEvaluator();\n *\n * const signals = evaluator.computeConfidenceSignals(history, branches);\n * console.log(signals.reasoning_depth); // 5\n *\n * const stats = evaluator.computeReasoningStats(history, branches);\n * console.log(stats.total_thoughts); // 12\n * ```\n */\nexport class ThoughtEvaluator {\n\t/**\n\t * Compute confidence signals from history context.\n\t * Pure computation — no side effects, no I/O.\n\t *\n\t * @param history - All thoughts in the current session\n\t * @param branches - Map of branch IDs to their thought arrays\n\t * @returns Computed confidence signals reflecting reasoning quality\n\t *\n\t * @example\n\t * ```typescript\n\t * const evaluator = new ThoughtEvaluator();\n * const signals = evaluator.computeConfidenceSignals(\n *   [thought1, thought2, thought3],\n *   { 'branch-a': [branchThought1] }\n * );\n\t *\n\t * console.log(signals.reasoning_depth);   // 3\n\t * console.log(signals.branch_count);      // 1\n\t * console.log(signals.has_hypothesis);    // false\n\t * console.log(signals.average_confidence); // 0.85 or null\n\t * ```\n\t */\n\tpublic computeConfidenceSignals(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>\n\t): ConfidenceSignals {\n\t\tconst typeDistribution = this._countByType(history);\n\t\tconst allConfidences = history\n\t\t\t.map((t) => t.confidence)\n\t\t\t.filter((c): c is number => c !== undefined);\n\n\t\t// Compute structural quality components\n\t\tconst structuralResult = this._computeStructuralQuality(\n\t\t\thistory,\n\t\t\tbranches,\n\t\t\ttypeDistribution,\n\t\t\tallConfidences\n\t\t);\n\n\t\treturn {\n\t\t\treasoning_depth: history.length,\n\t\t\trevision_count: history.filter((t) => t.is_revision).length,\n\t\t\tbranch_count: Object.keys(branches).length,\n\t\t\tthought_type_distribution: typeDistribution,\n\t\t\thas_hypothesis: history.some((t) => t.thought_type === 'hypothesis'),\n\t\t\thas_verification: history.some((t) => t.thought_type === 'verification'),\n\t\t\taverage_confidence:\n\t\t\t\tallConfidences.length > 0\n\t\t\t\t\t? allConfidences.reduce((a, b) => a + b, 0) / allConfidences.length\n\t\t\t\t\t: null,\n\t\t\t...(structuralResult !== null && {\n\t\t\t\tstructural_quality: structuralResult.score,\n\t\t\t\tquality_components: structuralResult.components,\n\t\t\t}),\n\t\t};\n\t}\n\n\t/**\n\t * Compute aggregated reasoning analytics.\n\t * Pure computation from history + branches.\n\t *\n\t * @param history - All thoughts in the current session\n\t * @param branches - Map of branch IDs to their thought arrays\n\t * @returns Aggregated reasoning statistics for the session\n\t *\n\t * @example\n\t * ```typescript\n\t * const evaluator = new ThoughtEvaluator();\n\t * const stats = evaluator.computeReasoningStats(\n\t *   [thought1, thought2, hypothesisThought, verificationThought],\n\t *   { 'explore-a': [branchThought] }\n\t * );\n\t *\n\t * console.log(stats.total_thoughts);              // 4\n\t * console.log(stats.total_branches);              // 1\n\t * console.log(stats.hypothesis_count);            // 1\n\t * console.log(stats.verified_hypothesis_count);   // 1\n\t * console.log(stats.average_quality_score);       // 0.78 or null\n\t * ```\n\t */\n\tpublic computeReasoningStats(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>\n\t): ReasoningStats {\n\t\tconst typeCounts = this._countByType(history);\n\t\tconst allScores = history\n\t\t\t.map((t) => t.quality_score)\n\t\t\t.filter((s): s is number => s !== undefined);\n\t\tconst allConfidences = history\n\t\t\t.map((t) => t.confidence)\n\t\t\t.filter((c): c is number => c !== undefined);\n\n\t\tconst hypotheses = history.filter((t) => t.thought_type === 'hypothesis');\n\t\tconst hypothesisIds = new Set(hypotheses.map((t) => t.hypothesis_id).filter(Boolean));\n\t\tconst verifiedIds = new Set(\n\t\t\thistory\n\t\t\t\t.filter((t) => t.thought_type === 'verification' && t.hypothesis_id)\n\t\t\t\t.map((t) => t.hypothesis_id)\n\t\t);\n\t\tconst unresolvedCount = [...hypothesisIds].filter((id) => !verifiedIds.has(id)).length;\n\n\t\treturn {\n\t\t\ttotal_thoughts: history.length,\n\t\t\ttotal_branches: Object.keys(branches).length,\n\t\t\ttotal_revisions: history.filter((t) => t.is_revision).length,\n\t\t\ttotal_merges: history.filter(\n\t\t\t\t(t) => (t.merge_from_thoughts?.length ?? 0) > 0 || (t.merge_branch_ids?.length ?? 0) > 0\n\t\t\t).length,\n\t\t\tchain_depth: this._computeChainDepth(history),\n\t\t\tthought_type_counts: typeCounts,\n\t\t\thypothesis_count: hypothesisIds.size,\n\t\t\tverified_hypothesis_count: [...hypothesisIds].filter((id) => verifiedIds.has(id)).length,\n\t\t\tunresolved_hypothesis_count: unresolvedCount,\n\t\t\taverage_quality_score:\n\t\t\t\tallScores.length > 0 ? allScores.reduce((a, b) => a + b, 0) / allScores.length : null,\n\t\t\taverage_confidence:\n\t\t\t\tallConfidences.length > 0\n\t\t\t\t\t? allConfidences.reduce((a, b) => a + b, 0) / allConfidences.length\n\t\t\t\t\t: null,\n\t\t};\n\t}\n\n\t/**\n * Detect reasoning patterns (anti-patterns and positive signals) from history.\n * Pure computation — no side effects, no I/O.\n *\n * Detected patterns:\n * - `consecutive_without_verification` (warning) — 3+ consecutive regular thoughts without a verification step\n * - `unverified_hypothesis` (warning) — hypothesis not verified within 3 subsequent thoughts\n * - `no_alternatives_explored` (info) — 5+ thoughts with no critique and no branches\n * - `monotonic_type` (info) — 4+ consecutive thoughts with the same thought_type (requires ≥1 explicit type and ≥5 thoughts)\n * - `confidence_drift` (warning) — 3+ consecutive thoughts with strictly decreasing confidence\n * - `healthy_verification` (info) — hypothesis verified within 3 subsequent thoughts\n *\n * @param history - All thoughts in the current session\n * @param branches - Map of branch IDs to their thought arrays\n * @returns Array of detected pattern signals, possibly empty\n *\n * @example\n * ```typescript\n * const evaluator = new ThoughtEvaluator();\n * const patterns = evaluator.computePatternSignals(history, branches);\n * const warnings = patterns.filter(p => p.severity === 'warning');\n * ```\n */\n\tpublic computePatternSignals(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>\n\t): PatternSignal[] {\n\t\tif (history.length === 0) return [];\n\n\t\tconst signals: PatternSignal[] = [];\n\t\tsignals.push(...this._detectConsecutiveWithoutVerification(history));\n\t\tsignals.push(...this._detectUnverifiedHypothesis(history));\n\t\tsignals.push(...this._detectNoAlternativesExplored(history, branches));\n\t\tsignals.push(...this._detectMonotonicType(history));\n\t\tsignals.push(...this._detectConfidenceDrift(history));\n\t\tsignals.push(...this._detectHealthyVerification(history));\n\t\treturn signals;\n\t}\n\n\t/** Detect runs of 3+ consecutive thoughts without verification. */\n\tprivate _detectConsecutiveWithoutVerification(history: ThoughtData[]): PatternSignal[] {\n\t\tconst signals: PatternSignal[] = [];\n\t\tlet runStart = 0;\n\t\tfor (let i = 0; i < history.length; i++) {\n\t\t\tconst type = history[i]!.thought_type ?? 'regular';\n\t\t\tif (type === 'verification') {\n\t\t\t\trunStart = i + 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (i - runStart + 1 >= 3) {\n\t\t\t\tconst start = history[runStart]!.thought_number ?? runStart + 1;\n\t\t\t\tconst end = history[i]!.thought_number ?? i + 1;\n\t\t\t\tsignals.push({\n\t\t\t\t\tpattern: 'consecutive_without_verification',\n\t\t\t\t\tseverity: 'warning',\n\t\t\t\t\tmessage: `3+ consecutive thoughts (${start}-${end}) without verification`,\n\t\t\t\t\tthought_range: [start, end],\n\t\t\t\t});\n\t\t\t\trunStart = i + 1;\n\t\t\t}\n\t\t}\n\t\treturn signals;\n\t}\n\n\t/** Detect hypothesis thoughts not verified within 3 subsequent thoughts. */\n\tprivate _detectUnverifiedHypothesis(history: ThoughtData[]): PatternSignal[] {\n\t\tconst signals: PatternSignal[] = [];\n\t\tfor (let i = 0; i < history.length; i++) {\n\t\t\tif (history[i]!.thought_type !== 'hypothesis') continue;\n\t\t\tconst remaining = history.length - i - 1;\n\t\t\tif (remaining < 3) continue;\n\t\t\tconst lookahead = history.slice(i + 1, i + 4);\n\t\t\tconst hasVerification = lookahead.some((t) => t.thought_type === 'verification');\n\t\t\tif (!hasVerification) {\n\t\t\t\tconst n = history[i]!.thought_number ?? i + 1;\n\t\t\t\tsignals.push({\n\t\t\t\t\tpattern: 'unverified_hypothesis',\n\t\t\t\t\tseverity: 'warning',\n\t\t\t\t\tmessage: `Hypothesis at thought ${n} has not been verified within 3 thoughts`,\n\t\t\t\t\tthought_range: [n, n],\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\treturn signals;\n\t}\n\n\t/** Detect 5+ thoughts with no critique and no branches. */\n\tprivate _detectNoAlternativesExplored(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>\n\t): PatternSignal[] {\n\t\tif (history.length < 5) return [];\n\t\tif (history.some((t) => t.thought_type === 'critique')) return [];\n\t\tif (Object.keys(branches).length > 0) return [];\n\t\tconst start = history[0]!.thought_number ?? 1;\n\t\tconst end = history[history.length - 1]!.thought_number ?? history.length;\n\t\treturn [\n\t\t\t{\n\t\t\t\tpattern: 'no_alternatives_explored',\n\t\t\t\tseverity: 'info',\n\t\t\t\tmessage: '5+ thoughts with no critique or branching — consider exploring alternatives',\n\t\t\t\tthought_range: [start, end],\n\t\t\t},\n\t\t];\n\t}\n\n\t/**\n\t * Detect runs of 4+ consecutive thoughts with the same thought_type.\n\t * Only fires when history has ≥5 thoughts and at least one explicitly set thought_type.\n\t */\n\tprivate _detectMonotonicType(history: ThoughtData[]): PatternSignal[] {\n\t\tif (history.length < 5) return [];\n\t\tconst hasExplicitType = history.some((t) => t.thought_type !== undefined);\n\t\tif (!hasExplicitType) return [];\n\n\t\tconst signals: PatternSignal[] = [];\n\t\tlet runType = history[0]!.thought_type ?? 'regular';\n\t\tlet runStart = 0;\n\t\tlet runLength = 1;\n\n\t\tfor (let i = 1; i < history.length; i++) {\n\t\t\tconst type = history[i]!.thought_type ?? 'regular';\n\t\t\tif (type === runType) {\n\t\t\t\trunLength++;\n\t\t\t} else {\n\t\t\t\tif (runLength >= 4) {\n\t\t\t\t\tconst start = history[runStart]!.thought_number ?? runStart + 1;\n\t\t\t\t\tconst end = history[runStart + runLength - 1]!.thought_number ?? runStart + runLength;\n\t\t\t\t\tsignals.push({\n\t\t\t\t\t\tpattern: 'monotonic_type',\n\t\t\t\t\t\tseverity: 'info',\n\t\t\t\t\t\tmessage: `4+ consecutive '${runType}' thoughts (${start}-${end}) — consider varying approach`,\n\t\t\t\t\t\tthought_range: [start, end],\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\trunType = type;\n\t\t\t\trunStart = i;\n\t\t\t\trunLength = 1;\n\t\t\t}\n\t\t}\n\t\tif (runLength >= 4) {\n\t\t\tconst start = history[runStart]!.thought_number ?? runStart + 1;\n\t\t\tconst end = history[runStart + runLength - 1]!.thought_number ?? runStart + runLength;\n\t\t\tsignals.push({\n\t\t\t\tpattern: 'monotonic_type',\n\t\t\t\tseverity: 'info',\n\t\t\t\tmessage: `4+ consecutive '${runType}' thoughts (${start}-${end}) — consider varying approach`,\n\t\t\t\tthought_range: [start, end],\n\t\t\t});\n\t\t}\n\t\treturn signals;\n\t}\n\n\t/** Detect runs of 3+ consecutive thoughts with strictly decreasing confidence. */\n\tprivate _detectConfidenceDrift(history: ThoughtData[]): PatternSignal[] {\n\t\tconst signals: PatternSignal[] = [];\n\t\tlet runStart = -1;\n\t\tlet runLength = 0;\n\t\tlet prevConf = -1;\n\n\t\tfor (let i = 0; i < history.length; i++) {\n\t\t\tconst conf = history[i]!.confidence;\n\t\t\tif (conf === undefined) {\n\t\t\t\tif (runLength >= 3) {\n\t\t\t\t\tconst start = history[runStart]!.thought_number ?? runStart + 1;\n\t\t\t\t\tconst end = history[runStart + runLength - 1]!.thought_number ?? runStart + runLength;\n\t\t\t\t\tconst firstConf = history[runStart]!.confidence!;\n\t\t\t\t\tconst lastConf = history[runStart + runLength - 1]!.confidence!;\n\t\t\t\t\tsignals.push({\n\t\t\t\t\t\tpattern: 'confidence_drift',\n\t\t\t\t\t\tseverity: 'warning',\n\t\t\t\t\t\tmessage: `Confidence decreasing across thoughts ${start}-${end} (${firstConf} → ${lastConf})`,\n\t\t\t\t\t\tthought_range: [start, end],\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\trunStart = -1;\n\t\t\t\trunLength = 0;\n\t\t\t\tprevConf = -1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (runLength === 0) {\n\t\t\t\trunStart = i;\n\t\t\t\trunLength = 1;\n\t\t\t\tprevConf = conf;\n\t\t\t} else if (conf < prevConf) {\n\t\t\t\trunLength++;\n\t\t\t\tprevConf = conf;\n\t\t\t} else {\n\t\t\t\tif (runLength >= 3) {\n\t\t\t\t\tconst start = history[runStart]!.thought_number ?? runStart + 1;\n\t\t\t\t\tconst end = history[runStart + runLength - 1]!.thought_number ?? runStart + runLength;\n\t\t\t\t\tconst firstConf = history[runStart]!.confidence!;\n\t\t\t\t\tconst lastConf = history[runStart + runLength - 1]!.confidence!;\n\t\t\t\t\tsignals.push({\n\t\t\t\t\t\tpattern: 'confidence_drift',\n\t\t\t\t\t\tseverity: 'warning',\n\t\t\t\t\t\tmessage: `Confidence decreasing across thoughts ${start}-${end} (${firstConf} → ${lastConf})`,\n\t\t\t\t\t\tthought_range: [start, end],\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\trunStart = i;\n\t\t\t\trunLength = 1;\n\t\t\t\tprevConf = conf;\n\t\t\t}\n\t\t}\n\t\t// Flush final run\n\t\tif (runLength >= 3) {\n\t\t\tconst start = history[runStart]!.thought_number ?? runStart + 1;\n\t\t\tconst end = history[runStart + runLength - 1]!.thought_number ?? runStart + runLength;\n\t\t\tconst firstConf = history[runStart]!.confidence!;\n\t\t\tconst lastConf = history[runStart + runLength - 1]!.confidence!;\n\t\t\tsignals.push({\n\t\t\t\tpattern: 'confidence_drift',\n\t\t\t\tseverity: 'warning',\n\t\t\t\tmessage: `Confidence decreasing across thoughts ${start}-${end} (${firstConf} → ${lastConf})`,\n\t\t\t\tthought_range: [start, end],\n\t\t\t});\n\t\t}\n\t\treturn signals;\n\t}\n\n\t/** Detect hypothesis verified within 3 subsequent thoughts — positive signal. */\n\tprivate _detectHealthyVerification(history: ThoughtData[]): PatternSignal[] {\n\t\tconst signals: PatternSignal[] = [];\n\t\tfor (let i = 0; i < history.length; i++) {\n\t\t\tif (history[i]!.thought_type !== 'hypothesis') continue;\n\t\t\tconst hypId = history[i]!.hypothesis_id;\n\t\t\tconst lookahead = history.slice(i + 1, i + 4);\n\t\t\tconst verifier = lookahead.find(\n\t\t\t\t(t) =>\n\t\t\t\t\tt.thought_type === 'verification' &&\n\t\t\t\t\t(t.hypothesis_id === hypId || t.verification_target === (history[i]!.thought_number ?? i + 1))\n\t\t\t);\n\t\t\tif (verifier) {\n\t\t\t\tconst n = history[i]!.thought_number ?? i + 1;\n\t\t\t\tconst m = verifier.thought_number ?? history.indexOf(verifier) + 1;\n\t\t\t\tsignals.push({\n\t\t\t\t\tpattern: 'healthy_verification',\n\t\t\t\t\tseverity: 'info',\n\t\t\t\t\tmessage: `Hypothesis at thought ${n} verified at thought ${m} — good practice`,\n\t\t\t\t\tthought_range: [n, m],\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\treturn signals;\n\t}\n\n\t/** Count thoughts by type across history. */\n\tprivate _countByType(thoughts: ThoughtData[]): Record<ThoughtType, number> {\n\t\tconst counts = Object.fromEntries(ALL_THOUGHT_TYPES.map((t) => [t, 0])) as Record<\n\t\t\tThoughtType,\n\t\t\tnumber\n\t\t>;\n\n\t\tfor (const thought of thoughts) {\n\t\t\tconst type = thought.thought_type ?? 'regular';\n\t\t\tif (type in counts) {\n\t\t\t\tcounts[type]++;\n\t\t\t}\n\t\t}\n\n\t\treturn counts;\n\t}\n\n\t/** Find longest sequential chain depth (contiguous thoughts without branching). */\n\tprivate _computeChainDepth(history: ThoughtData[]): number {\n\t\tif (history.length === 0) return 0;\n\t\t// Simple: longest contiguous chain without branching\n\t\tlet maxDepth = 1;\n\t\tlet currentDepth = 1;\n\n\t\tfor (let i = 1; i < history.length; i++) {\n\t\t\tconst thought = history[i]!;\n\t\t\tif (!thought.branch_from_thought) {\n\t\t\t\tcurrentDepth++;\n\t\t\t\tmaxDepth = Math.max(maxDepth, currentDepth);\n\t\t\t} else {\n\t\t\t\tcurrentDepth = 1;\n\t\t\t}\n\t\t}\n\n\t\treturn maxDepth;\n\t}\n\n\t/** Compute composite structural quality score from history. */\n\tprivate _computeStructuralQuality(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>,\n\t\ttypeDistribution: Record<ThoughtType, number>,\n\t\tconfidences: number[]\n\t): { score: number; components: { type_diversity: number; verification_coverage: number; depth_efficiency: number; confidence_stability: number } } | null {\n\t\tif (history.length === 0) return null;\n\n\t\tconst FLOOR = 0.01;\n\n\t\t// 1. type_diversity: Shannon entropy / log2(6)\n\t\tconst total = history.length;\n\t\tlet entropy = 0;\n\t\tfor (const type of ALL_THOUGHT_TYPES) {\n\t\t\tconst count = typeDistribution[type];\n\t\t\tif (count > 0) {\n\t\t\t\tconst pk = count / total;\n\t\t\t\tentropy -= pk * Math.log2(pk);\n\t\t\t}\n\t\t}\n\t\tconst typeDiversity = Math.max(entropy / Math.log2(6), FLOOR);\n\n\t\t// 2. verification_coverage: verified / total hypotheses (1.0 if none)\n\t\tconst hypotheses = history.filter((t) => t.thought_type === 'hypothesis');\n\t\tconst hypothesisIds = new Set(hypotheses.map((t) => t.hypothesis_id).filter(Boolean));\n\t\tconst verifiedIds = new Set(\n\t\t\thistory\n\t\t\t\t.filter((t) => t.thought_type === 'verification' && t.hypothesis_id)\n\t\t\t\t.map((t) => t.hypothesis_id)\n\t\t);\n\t\tconst verificationCoverage =\n\t\t\thypothesisIds.size === 0\n\t\t\t\t? 1.0\n\t\t\t\t: Math.max(\n\t\t\t\t\t\t[...hypothesisIds].filter((id) => verifiedIds.has(id)).length / hypothesisIds.size,\n\t\t\t\t\t\tFLOOR\n\t\t\t\t\t);\n\n\t\t// 3. depth_efficiency: max(chain_depth, branch_count + 1) / total_thoughts, clamped to 1.0\n\t\t// NOTE (Metis H3): Branching is desirable — treat branches as depth-equivalent.\n\t\tconst chainDepth = this._computeChainDepth(history);\n\t\tconst branchCount = Object.keys(branches).length;\n\t\tconst effectiveDepth = Math.max(chainDepth, branchCount + 1);\n\t\tconst depthEfficiency = Math.max(Math.min(effectiveDepth / total, 1.0), FLOOR);\n\n\t\t// 4. confidence_stability: 1 - stddev(confidences), default 0.5\n\t\tconst confidenceStability = this._computeConfidenceStability(confidences);\n\n\t\tconst components = {\n\t\t\ttype_diversity: typeDiversity,\n\t\t\tverification_coverage: verificationCoverage,\n\t\t\tdepth_efficiency: depthEfficiency,\n\t\t\tconfidence_stability: confidenceStability,\n\t\t};\n\n\t\t// Weighted geometric mean: td^0.3 * vc^0.3 * de^0.2 * cs^0.2\n\t\tconst score =\n\t\t\tMath.pow(typeDiversity, 0.3) *\n\t\t\tMath.pow(verificationCoverage, 0.3) *\n\t\t\tMath.pow(depthEfficiency, 0.2) *\n\t\t\tMath.pow(confidenceStability, 0.2);\n\n\t\treturn { score, components };\n\t}\n\n\t/** Compute confidence stability: 1 - stddev(confidences). */\n\tprivate _computeConfidenceStability(confidences: number[]): number {\n\t\tconst FLOOR = 0.01;\n\t\tif (confidences.length === 0) return Math.max(0.5, FLOOR);\n\t\tif (confidences.length === 1) return Math.max(1.0, FLOOR);\n\n\t\tconst mean = confidences.reduce((a, b) => a + b, 0) / confidences.length;\n\t\tconst variance = confidences.reduce((sum, c) => sum + (c - mean) ** 2, 0) / confidences.length;\n\t\tconst stddev = Math.sqrt(variance);\n\t\treturn Math.max(1 - stddev, FLOOR);\n\t}\n}\n"],"names":["ALL_THOUGHT_TYPES","ThoughtEvaluator","history","branches","typeDistribution","allConfidences","t","c","undefined","structuralResult","Object","a","b","typeCounts","allScores","s","hypotheses","hypothesisIds","Set","Boolean","verifiedIds","unresolvedCount","id","signals","runStart","i","type","start","end","remaining","lookahead","hasVerification","n","hasExplicitType","runType","runLength","prevConf","conf","firstConf","lastConf","hypId","verifier","m","thoughts","counts","thought","maxDepth","currentDepth","Math","confidences","FLOOR","total","entropy","count","pk","typeDiversity","verificationCoverage","chainDepth","branchCount","effectiveDepth","depthEfficiency","confidenceStability","components","score","mean","variance","sum","stddev"],"mappings":"AAcA,MAAMA,oBAAmC;IACxC;IACA;IACA;IACA;IACA;IACA;CACA;AAqBM,MAAMC;IAuBL,yBACNC,OAAsB,EACtBC,QAAuC,EACnB;QACpB,MAAMC,mBAAmB,IAAI,CAAC,YAAY,CAACF;QAC3C,MAAMG,iBAAiBH,QACrB,GAAG,CAAC,CAACI,IAAMA,EAAE,UAAU,EACvB,MAAM,CAAC,CAACC,IAAmBA,AAAMC,WAAND;QAG7B,MAAME,mBAAmB,IAAI,CAAC,yBAAyB,CACtDP,SACAC,UACAC,kBACAC;QAGD,OAAO;YACN,iBAAiBH,QAAQ,MAAM;YAC/B,gBAAgBA,QAAQ,MAAM,CAAC,CAACI,IAAMA,EAAE,WAAW,EAAE,MAAM;YAC3D,cAAcI,OAAO,IAAI,CAACP,UAAU,MAAM;YAC1C,2BAA2BC;YAC3B,gBAAgBF,QAAQ,IAAI,CAAC,CAACI,IAAMA,AAAmB,iBAAnBA,EAAE,YAAY;YAClD,kBAAkBJ,QAAQ,IAAI,CAAC,CAACI,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY;YACpD,oBACCD,eAAe,MAAM,GAAG,IACrBA,eAAe,MAAM,CAAC,CAACM,GAAGC,IAAMD,IAAIC,GAAG,KAAKP,eAAe,MAAM,GACjE;YACJ,GAAII,AAAqB,SAArBA,oBAA6B;gBAChC,oBAAoBA,iBAAiB,KAAK;gBAC1C,oBAAoBA,iBAAiB,UAAU;YAChD,CAAC;QACF;IACD;IAyBO,sBACNP,OAAsB,EACtBC,QAAuC,EACtB;QACjB,MAAMU,aAAa,IAAI,CAAC,YAAY,CAACX;QACrC,MAAMY,YAAYZ,QAChB,GAAG,CAAC,CAACI,IAAMA,EAAE,aAAa,EAC1B,MAAM,CAAC,CAACS,IAAmBA,AAAMP,WAANO;QAC7B,MAAMV,iBAAiBH,QACrB,GAAG,CAAC,CAACI,IAAMA,EAAE,UAAU,EACvB,MAAM,CAAC,CAACC,IAAmBA,AAAMC,WAAND;QAE7B,MAAMS,aAAad,QAAQ,MAAM,CAAC,CAACI,IAAMA,AAAmB,iBAAnBA,EAAE,YAAY;QACvD,MAAMW,gBAAgB,IAAIC,IAAIF,WAAW,GAAG,CAAC,CAACV,IAAMA,EAAE,aAAa,EAAE,MAAM,CAACa;QAC5E,MAAMC,cAAc,IAAIF,IACvBhB,QACE,MAAM,CAAC,CAACI,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY,IAAuBA,EAAE,aAAa,EAClE,GAAG,CAAC,CAACA,IAAMA,EAAE,aAAa;QAE7B,MAAMe,kBAAkB;eAAIJ;SAAc,CAAC,MAAM,CAAC,CAACK,KAAO,CAACF,YAAY,GAAG,CAACE,KAAK,MAAM;QAEtF,OAAO;YACN,gBAAgBpB,QAAQ,MAAM;YAC9B,gBAAgBQ,OAAO,IAAI,CAACP,UAAU,MAAM;YAC5C,iBAAiBD,QAAQ,MAAM,CAAC,CAACI,IAAMA,EAAE,WAAW,EAAE,MAAM;YAC5D,cAAcJ,QAAQ,MAAM,CAC3B,CAACI,IAAOA,AAAAA,CAAAA,EAAE,mBAAmB,EAAE,UAAU,KAAK,KAAMA,AAAAA,CAAAA,EAAE,gBAAgB,EAAE,UAAU,KAAK,GACtF,MAAM;YACR,aAAa,IAAI,CAAC,kBAAkB,CAACJ;YACrC,qBAAqBW;YACrB,kBAAkBI,cAAc,IAAI;YACpC,2BAA2B;mBAAIA;aAAc,CAAC,MAAM,CAAC,CAACK,KAAOF,YAAY,GAAG,CAACE,KAAK,MAAM;YACxF,6BAA6BD;YAC7B,uBACCP,UAAU,MAAM,GAAG,IAAIA,UAAU,MAAM,CAAC,CAACH,GAAGC,IAAMD,IAAIC,GAAG,KAAKE,UAAU,MAAM,GAAG;YAClF,oBACCT,eAAe,MAAM,GAAG,IACrBA,eAAe,MAAM,CAAC,CAACM,GAAGC,IAAMD,IAAIC,GAAG,KAAKP,eAAe,MAAM,GACjE;QACL;IACD;IAyBO,sBACNH,OAAsB,EACtBC,QAAuC,EACrB;QAClB,IAAID,AAAmB,MAAnBA,QAAQ,MAAM,EAAQ,OAAO,EAAE;QAEnC,MAAMqB,UAA2B,EAAE;QACnCA,QAAQ,IAAI,IAAI,IAAI,CAAC,qCAAqC,CAACrB;QAC3DqB,QAAQ,IAAI,IAAI,IAAI,CAAC,2BAA2B,CAACrB;QACjDqB,QAAQ,IAAI,IAAI,IAAI,CAAC,6BAA6B,CAACrB,SAASC;QAC5DoB,QAAQ,IAAI,IAAI,IAAI,CAAC,oBAAoB,CAACrB;QAC1CqB,QAAQ,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAACrB;QAC5CqB,QAAQ,IAAI,IAAI,IAAI,CAAC,0BAA0B,CAACrB;QAChD,OAAOqB;IACR;IAGQ,sCAAsCrB,OAAsB,EAAmB;QACtF,MAAMqB,UAA2B,EAAE;QACnC,IAAIC,WAAW;QACf,IAAK,IAAIC,IAAI,GAAGA,IAAIvB,QAAQ,MAAM,EAAEuB,IAAK;YACxC,MAAMC,OAAOxB,OAAO,CAACuB,EAAE,CAAE,YAAY,IAAI;YACzC,IAAIC,AAAS,mBAATA,MAAyB;gBAC5BF,WAAWC,IAAI;gBACf;YACD;YACA,IAAIA,IAAID,WAAW,KAAK,GAAG;gBAC1B,MAAMG,QAAQzB,OAAO,CAACsB,SAAS,CAAE,cAAc,IAAIA,WAAW;gBAC9D,MAAMI,MAAM1B,OAAO,CAACuB,EAAE,CAAE,cAAc,IAAIA,IAAI;gBAC9CF,QAAQ,IAAI,CAAC;oBACZ,SAAS;oBACT,UAAU;oBACV,SAAS,CAAC,yBAAyB,EAAEI,MAAM,CAAC,EAAEC,IAAI,sBAAsB,CAAC;oBACzE,eAAe;wBAACD;wBAAOC;qBAAI;gBAC5B;gBACAJ,WAAWC,IAAI;YAChB;QACD;QACA,OAAOF;IACR;IAGQ,4BAA4BrB,OAAsB,EAAmB;QAC5E,MAAMqB,UAA2B,EAAE;QACnC,IAAK,IAAIE,IAAI,GAAGA,IAAIvB,QAAQ,MAAM,EAAEuB,IAAK;YACxC,IAAIvB,AAA6B,iBAA7BA,OAAO,CAACuB,EAAE,CAAE,YAAY,EAAmB;YAC/C,MAAMI,YAAY3B,QAAQ,MAAM,GAAGuB,IAAI;YACvC,IAAII,YAAY,GAAG;YACnB,MAAMC,YAAY5B,QAAQ,KAAK,CAACuB,IAAI,GAAGA,IAAI;YAC3C,MAAMM,kBAAkBD,UAAU,IAAI,CAAC,CAACxB,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY;YAC5D,IAAI,CAACyB,iBAAiB;gBACrB,MAAMC,IAAI9B,OAAO,CAACuB,EAAE,CAAE,cAAc,IAAIA,IAAI;gBAC5CF,QAAQ,IAAI,CAAC;oBACZ,SAAS;oBACT,UAAU;oBACV,SAAS,CAAC,sBAAsB,EAAES,EAAE,wCAAwC,CAAC;oBAC7E,eAAe;wBAACA;wBAAGA;qBAAE;gBACtB;YACD;QACD;QACA,OAAOT;IACR;IAGQ,8BACPrB,OAAsB,EACtBC,QAAuC,EACrB;QAClB,IAAID,QAAQ,MAAM,GAAG,GAAG,OAAO,EAAE;QACjC,IAAIA,QAAQ,IAAI,CAAC,CAACI,IAAMA,AAAmB,eAAnBA,EAAE,YAAY,GAAkB,OAAO,EAAE;QACjE,IAAII,OAAO,IAAI,CAACP,UAAU,MAAM,GAAG,GAAG,OAAO,EAAE;QAC/C,MAAMwB,QAAQzB,OAAO,CAAC,EAAE,CAAE,cAAc,IAAI;QAC5C,MAAM0B,MAAM1B,OAAO,CAACA,QAAQ,MAAM,GAAG,EAAE,CAAE,cAAc,IAAIA,QAAQ,MAAM;QACzE,OAAO;YACN;gBACC,SAAS;gBACT,UAAU;gBACV,SAAS;gBACT,eAAe;oBAACyB;oBAAOC;iBAAI;YAC5B;SACA;IACF;IAMQ,qBAAqB1B,OAAsB,EAAmB;QACrE,IAAIA,QAAQ,MAAM,GAAG,GAAG,OAAO,EAAE;QACjC,MAAM+B,kBAAkB/B,QAAQ,IAAI,CAAC,CAACI,IAAMA,AAAmBE,WAAnBF,EAAE,YAAY;QAC1D,IAAI,CAAC2B,iBAAiB,OAAO,EAAE;QAE/B,MAAMV,UAA2B,EAAE;QACnC,IAAIW,UAAUhC,OAAO,CAAC,EAAE,CAAE,YAAY,IAAI;QAC1C,IAAIsB,WAAW;QACf,IAAIW,YAAY;QAEhB,IAAK,IAAIV,IAAI,GAAGA,IAAIvB,QAAQ,MAAM,EAAEuB,IAAK;YACxC,MAAMC,OAAOxB,OAAO,CAACuB,EAAE,CAAE,YAAY,IAAI;YACzC,IAAIC,SAASQ,SACZC;iBACM;gBACN,IAAIA,aAAa,GAAG;oBACnB,MAAMR,QAAQzB,OAAO,CAACsB,SAAS,CAAE,cAAc,IAAIA,WAAW;oBAC9D,MAAMI,MAAM1B,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,cAAc,IAAIX,WAAWW;oBAC5EZ,QAAQ,IAAI,CAAC;wBACZ,SAAS;wBACT,UAAU;wBACV,SAAS,CAAC,gBAAgB,EAAEW,QAAQ,YAAY,EAAEP,MAAM,CAAC,EAAEC,IAAI,6BAA6B,CAAC;wBAC7F,eAAe;4BAACD;4BAAOC;yBAAI;oBAC5B;gBACD;gBACAM,UAAUR;gBACVF,WAAWC;gBACXU,YAAY;YACb;QACD;QACA,IAAIA,aAAa,GAAG;YACnB,MAAMR,QAAQzB,OAAO,CAACsB,SAAS,CAAE,cAAc,IAAIA,WAAW;YAC9D,MAAMI,MAAM1B,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,cAAc,IAAIX,WAAWW;YAC5EZ,QAAQ,IAAI,CAAC;gBACZ,SAAS;gBACT,UAAU;gBACV,SAAS,CAAC,gBAAgB,EAAEW,QAAQ,YAAY,EAAEP,MAAM,CAAC,EAAEC,IAAI,6BAA6B,CAAC;gBAC7F,eAAe;oBAACD;oBAAOC;iBAAI;YAC5B;QACD;QACA,OAAOL;IACR;IAGQ,uBAAuBrB,OAAsB,EAAmB;QACvE,MAAMqB,UAA2B,EAAE;QACnC,IAAIC,WAAW;QACf,IAAIW,YAAY;QAChB,IAAIC,WAAW;QAEf,IAAK,IAAIX,IAAI,GAAGA,IAAIvB,QAAQ,MAAM,EAAEuB,IAAK;YACxC,MAAMY,OAAOnC,OAAO,CAACuB,EAAE,CAAE,UAAU;YACnC,IAAIY,AAAS7B,WAAT6B,MAAoB;gBACvB,IAAIF,aAAa,GAAG;oBACnB,MAAMR,QAAQzB,OAAO,CAACsB,SAAS,CAAE,cAAc,IAAIA,WAAW;oBAC9D,MAAMI,MAAM1B,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,cAAc,IAAIX,WAAWW;oBAC5E,MAAMG,YAAYpC,OAAO,CAACsB,SAAS,CAAE,UAAU;oBAC/C,MAAMe,WAAWrC,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,UAAU;oBAC9DZ,QAAQ,IAAI,CAAC;wBACZ,SAAS;wBACT,UAAU;wBACV,SAAS,CAAC,sCAAsC,EAAEI,MAAM,CAAC,EAAEC,IAAI,EAAE,EAAEU,UAAU,GAAG,EAAEC,SAAS,CAAC,CAAC;wBAC7F,eAAe;4BAACZ;4BAAOC;yBAAI;oBAC5B;gBACD;gBACAJ,WAAW;gBACXW,YAAY;gBACZC,WAAW;gBACX;YACD;YACA,IAAID,AAAc,MAAdA,WAAiB;gBACpBX,WAAWC;gBACXU,YAAY;gBACZC,WAAWC;YACZ,OAAO,IAAIA,OAAOD,UAAU;gBAC3BD;gBACAC,WAAWC;YACZ,OAAO;gBACN,IAAIF,aAAa,GAAG;oBACnB,MAAMR,QAAQzB,OAAO,CAACsB,SAAS,CAAE,cAAc,IAAIA,WAAW;oBAC9D,MAAMI,MAAM1B,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,cAAc,IAAIX,WAAWW;oBAC5E,MAAMG,YAAYpC,OAAO,CAACsB,SAAS,CAAE,UAAU;oBAC/C,MAAMe,WAAWrC,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,UAAU;oBAC9DZ,QAAQ,IAAI,CAAC;wBACZ,SAAS;wBACT,UAAU;wBACV,SAAS,CAAC,sCAAsC,EAAEI,MAAM,CAAC,EAAEC,IAAI,EAAE,EAAEU,UAAU,GAAG,EAAEC,SAAS,CAAC,CAAC;wBAC7F,eAAe;4BAACZ;4BAAOC;yBAAI;oBAC5B;gBACD;gBACAJ,WAAWC;gBACXU,YAAY;gBACZC,WAAWC;YACZ;QACD;QAEA,IAAIF,aAAa,GAAG;YACnB,MAAMR,QAAQzB,OAAO,CAACsB,SAAS,CAAE,cAAc,IAAIA,WAAW;YAC9D,MAAMI,MAAM1B,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,cAAc,IAAIX,WAAWW;YAC5E,MAAMG,YAAYpC,OAAO,CAACsB,SAAS,CAAE,UAAU;YAC/C,MAAMe,WAAWrC,OAAO,CAACsB,WAAWW,YAAY,EAAE,CAAE,UAAU;YAC9DZ,QAAQ,IAAI,CAAC;gBACZ,SAAS;gBACT,UAAU;gBACV,SAAS,CAAC,sCAAsC,EAAEI,MAAM,CAAC,EAAEC,IAAI,EAAE,EAAEU,UAAU,GAAG,EAAEC,SAAS,CAAC,CAAC;gBAC7F,eAAe;oBAACZ;oBAAOC;iBAAI;YAC5B;QACD;QACA,OAAOL;IACR;IAGQ,2BAA2BrB,OAAsB,EAAmB;QAC3E,MAAMqB,UAA2B,EAAE;QACnC,IAAK,IAAIE,IAAI,GAAGA,IAAIvB,QAAQ,MAAM,EAAEuB,IAAK;YACxC,IAAIvB,AAA6B,iBAA7BA,OAAO,CAACuB,EAAE,CAAE,YAAY,EAAmB;YAC/C,MAAMe,QAAQtC,OAAO,CAACuB,EAAE,CAAE,aAAa;YACvC,MAAMK,YAAY5B,QAAQ,KAAK,CAACuB,IAAI,GAAGA,IAAI;YAC3C,MAAMgB,WAAWX,UAAU,IAAI,CAC9B,CAACxB,IACAA,AAAmB,mBAAnBA,EAAE,YAAY,IACbA,CAAAA,EAAE,aAAa,KAAKkC,SAASlC,EAAE,mBAAmB,KAAMJ,CAAAA,OAAO,CAACuB,EAAE,CAAE,cAAc,IAAIA,IAAI,EAAC;YAE9F,IAAIgB,UAAU;gBACb,MAAMT,IAAI9B,OAAO,CAACuB,EAAE,CAAE,cAAc,IAAIA,IAAI;gBAC5C,MAAMiB,IAAID,SAAS,cAAc,IAAIvC,QAAQ,OAAO,CAACuC,YAAY;gBACjElB,QAAQ,IAAI,CAAC;oBACZ,SAAS;oBACT,UAAU;oBACV,SAAS,CAAC,sBAAsB,EAAES,EAAE,qBAAqB,EAAEU,EAAE,gBAAgB,CAAC;oBAC9E,eAAe;wBAACV;wBAAGU;qBAAE;gBACtB;YACD;QACD;QACA,OAAOnB;IACR;IAGQ,aAAaoB,QAAuB,EAA+B;QAC1E,MAAMC,SAASlC,OAAO,WAAW,CAACV,kBAAkB,GAAG,CAAC,CAACM,IAAM;gBAACA;gBAAG;aAAE;QAKrE,KAAK,MAAMuC,WAAWF,SAAU;YAC/B,MAAMjB,OAAOmB,QAAQ,YAAY,IAAI;YACrC,IAAInB,QAAQkB,QACXA,MAAM,CAAClB,KAAK;QAEd;QAEA,OAAOkB;IACR;IAGQ,mBAAmB1C,OAAsB,EAAU;QAC1D,IAAIA,AAAmB,MAAnBA,QAAQ,MAAM,EAAQ,OAAO;QAEjC,IAAI4C,WAAW;QACf,IAAIC,eAAe;QAEnB,IAAK,IAAItB,IAAI,GAAGA,IAAIvB,QAAQ,MAAM,EAAEuB,IAAK;YACxC,MAAMoB,UAAU3C,OAAO,CAACuB,EAAE;YAC1B,IAAKoB,QAAQ,mBAAmB,EAI/BE,eAAe;iBAJkB;gBACjCA;gBACAD,WAAWE,KAAK,GAAG,CAACF,UAAUC;YAC/B;QAGD;QAEA,OAAOD;IACR;IAGQ,0BACP5C,OAAsB,EACtBC,QAAuC,EACvCC,gBAA6C,EAC7C6C,WAAqB,EACqI;QAC1J,IAAI/C,AAAmB,MAAnBA,QAAQ,MAAM,EAAQ,OAAO;QAEjC,MAAMgD,QAAQ;QAGd,MAAMC,QAAQjD,QAAQ,MAAM;QAC5B,IAAIkD,UAAU;QACd,KAAK,MAAM1B,QAAQ1B,kBAAmB;YACrC,MAAMqD,QAAQjD,gBAAgB,CAACsB,KAAK;YACpC,IAAI2B,QAAQ,GAAG;gBACd,MAAMC,KAAKD,QAAQF;gBACnBC,WAAWE,KAAKN,KAAK,IAAI,CAACM;YAC3B;QACD;QACA,MAAMC,gBAAgBP,KAAK,GAAG,CAACI,UAAUJ,KAAK,IAAI,CAAC,IAAIE;QAGvD,MAAMlC,aAAad,QAAQ,MAAM,CAAC,CAACI,IAAMA,AAAmB,iBAAnBA,EAAE,YAAY;QACvD,MAAMW,gBAAgB,IAAIC,IAAIF,WAAW,GAAG,CAAC,CAACV,IAAMA,EAAE,aAAa,EAAE,MAAM,CAACa;QAC5E,MAAMC,cAAc,IAAIF,IACvBhB,QACE,MAAM,CAAC,CAACI,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY,IAAuBA,EAAE,aAAa,EAClE,GAAG,CAAC,CAACA,IAAMA,EAAE,aAAa;QAE7B,MAAMkD,uBACLvC,AAAuB,MAAvBA,cAAc,IAAI,GACf,MACA+B,KAAK,GAAG,CACR;eAAI/B;SAAc,CAAC,MAAM,CAAC,CAACK,KAAOF,YAAY,GAAG,CAACE,KAAK,MAAM,GAAGL,cAAc,IAAI,EAClFiC;QAKJ,MAAMO,aAAa,IAAI,CAAC,kBAAkB,CAACvD;QAC3C,MAAMwD,cAAchD,OAAO,IAAI,CAACP,UAAU,MAAM;QAChD,MAAMwD,iBAAiBX,KAAK,GAAG,CAACS,YAAYC,cAAc;QAC1D,MAAME,kBAAkBZ,KAAK,GAAG,CAACA,KAAK,GAAG,CAACW,iBAAiBR,OAAO,MAAMD;QAGxE,MAAMW,sBAAsB,IAAI,CAAC,2BAA2B,CAACZ;QAE7D,MAAMa,aAAa;YAClB,gBAAgBP;YAChB,uBAAuBC;YACvB,kBAAkBI;YAClB,sBAAsBC;QACvB;QAGA,MAAME,QACLf,KAAK,GAAG,CAACO,eAAe,OACxBP,KAAK,GAAG,CAACQ,sBAAsB,OAC/BR,KAAK,GAAG,CAACY,iBAAiB,OAC1BZ,KAAK,GAAG,CAACa,qBAAqB;QAE/B,OAAO;YAAEE;YAAOD;QAAW;IAC5B;IAGQ,4BAA4Bb,WAAqB,EAAU;QAClE,MAAMC,QAAQ;QACd,IAAID,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAOD,KAAK,GAAG,CAAC,KAAKE;QACnD,IAAID,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAOD,KAAK,GAAG,CAAC,KAAKE;QAEnD,MAAMc,OAAOf,YAAY,MAAM,CAAC,CAACtC,GAAGC,IAAMD,IAAIC,GAAG,KAAKqC,YAAY,MAAM;QACxE,MAAMgB,WAAWhB,YAAY,MAAM,CAAC,CAACiB,KAAK3D,IAAM2D,MAAO3D,AAAAA,CAAAA,IAAIyD,IAAG,KAAM,GAAG,KAAKf,YAAY,MAAM;QAC9F,MAAMkB,SAASnB,KAAK,IAAI,CAACiB;QACzB,OAAOjB,KAAK,GAAG,CAAC,IAAImB,QAAQjB;IAC7B;AACD"}

package/dist/core/ThoughtFormatter.d.ts

@@ -0,0 +1,133 @@
+/**
+ * Display formatting for thoughts and recommendations.
+ *
+ * This module provides the `ThoughtFormatter` class which handles all
+ * presentation logic for thought data, including clean, simple output
+ * formatting and structured display of tool/skill recommendations.
+ *
+ * @module formatter
+ */
+import type { StepRecommendation } from './step.js';
+import type { ThoughtData } from './thought.js';
+/**
+ * Formatter for thought data and step recommendations.
+ *
+ * This class separates presentation concerns from business logic, providing
+ * clean, readable output for thoughts with structured display of
+ * tool and skill recommendations.
+ *
+ * @remarks
+ * Output Format is clean and simple:
+ * - 💭 Thought - Regular thought (blue)
+ * - 🔬 Hypothesis - Proposed explanation (magenta)
+ * - ✅ Verification - Testing a hypothesis (green)
+ * - 🔍 Critique - Self-critique of reasoning (red)
+ * - 🧬 Synthesis - Combining thoughts/branches (cyan)
+ * - 🧠 Meta - Metacognitive observation (gray)
+ * - 🔄 Revision - Thought that revises a previous thought (yellow)
+ * - 🌿 Branch - Thought that creates a new branch (green)
+ * @example
+ * ```typescript
+ * const formatter = new ThoughtFormatter();
+ *
+ * // Format a thought with recommendations
+ * const output = formatter.formatThought({
+ *   thought: 'I need to analyze the data structure',
+ *   thought_number: 1,
+ *   total_thoughts: 3,
+ *   next_thought_needed: true,
+ *   current_step: {
+ *     step_description: 'Analyze data structure',
+ *     recommended_tools: [{
+ *       tool_name: 'Read',
+ *       confidence: 0.95,
+ *       rationale: 'Direct file reading',
+ *       priority: 1,
+ *       suggested_inputs: { file_path: './data/schema.json' }
+ *     }],
+ *     expected_outcome: 'Understanding of data schema'
+ *   }
+ * });
+ *
+ * console.log(output);
+ * ```
+ */
+export declare class ThoughtFormatter {
+    /**
+     * Formats a step recommendation into a readable string.
+     *
+     * Creates a structured display of the step description, recommended tools,
+     * recommended skills, expected outcome, and conditions for the next step.
+     *
+     * @param step - The step recommendation to format
+     * @returns A formatted string representation of the recommendation
+     *
+     * @example
+     * ```typescript
+     * const step: StepRecommendation = {
+     *   step_description: 'Search for API endpoints',
+     *   recommended_tools: [{
+     *     tool_name: 'Grep',
+     *     confidence: 0.9,
+     *     rationale: 'Best for searching code patterns',
+     *     priority: 1,
+     *     suggested_inputs: { pattern: 'export.*function' }
+     *   }],
+     *   expected_outcome: 'List of all exported API functions',
+     *   next_step_conditions: ['If no results, try broader pattern']
+     * };
+     *
+     * const formatted = formatter.formatRecommendation(step);
+     * console.log(formatted);
+     * ```
+     */
+    formatRecommendation(step: StepRecommendation): string;
+    /**
+     * Formats a thought into a clean, simple display.
+     *
+     * Creates a clean output containing the thought content with an appropriate
+     * header indicating the thought type. Priority order for icon selection:
+     * `is_revision` > `branch_from_thought` > `thought_type`.
+     *
+     * Supported `thought_type` icons:
+     * - `'regular'` (or undefined): 💭 blue "Thought" (default)
+     * - `'hypothesis'`: 🔬 magenta "Hypothesis"
+     * - `'verification'`: ✅ green "Verification"
+     * - `'critique'`: 🔍 red "Critique"
+     * - `'synthesis'`: 🧬 cyan "Synthesis"
+     * - `'meta'`: 🧠 gray "Meta"
+     *
+     * @param thoughtData - The thought data to format
+     * @returns A formatted string with thought and recommendations
+     *
+     * @example
+     * ```typescript
+     * // Regular thought
+     * const regular = formatter.formatThought({
+     *   thought: 'I should read the configuration file',
+     *   thought_number: 1,
+     *   total_thoughts: 3,
+     *   next_thought_needed: true
+     * });
+     * // Output: 💭 Thought 1/3: I should read the configuration file
+     *
+     * // With recommendation
+     * const withRec = formatter.formatThought({
+     *   thought: 'I need to search the codebase',
+     *   thought_number: 1,
+     *   total_thoughts: 3,
+     *   next_thought_needed: true,
+     *   current_step: {
+     *     step_description: 'Search for files',
+     *     recommended_tools: [{ tool_name: 'Grep', priority: 1 }],
+     *     expected_outcome: 'List of matching files'
+     *   }
+     * });
+     * // Output:
+     * // 💭 Thought 1/3: I need to search the codebase
+     * //   → Tools: Grep | List of matching files
+     * ```
+     */
+    formatThought(thoughtData: ThoughtData): string;
+}
+//# sourceMappingURL=ThoughtFormatter.d.ts.map

package/dist/core/ThoughtFormatter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ThoughtFormatter.d.ts","sourceRoot":"","sources":["../../src/core/ThoughtFormatter.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACpD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAEhD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,qBAAa,gBAAgB;IAC5B;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACI,oBAAoB,CAAC,IAAI,EAAE,kBAAkB,GAAG,MAAM;IAuB7D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6CG;IACI,aAAa,CAAC,WAAW,EAAE,WAAW,GAAG,MAAM;CA0EtD"}

package/dist/core/ThoughtFormatter.js

@@ -0,0 +1,70 @@
+import chalk from "chalk";
+class ThoughtFormatter {
+    formatRecommendation(step) {
+        const parts = [];
+        if (step.recommended_tools?.length) {
+            const toolNames = step.recommended_tools.map((t)=>t.tool_name).join(', ');
+            parts.push(chalk.cyan(`Tools: ${toolNames}`));
+        }
+        if (step.recommended_skills?.length) {
+            const skillNames = step.recommended_skills.map((s)=>s.skill_name).join(', ');
+            parts.push(chalk.green(`Skills: ${skillNames}`));
+        }
+        if (step.expected_outcome) parts.push(chalk.gray(`→ ${step.expected_outcome}`));
+        return parts.join(' | ');
+    }
+    formatThought(thoughtData) {
+        const { thought_number, total_thoughts, thought, is_revision, revises_thought, branch_from_thought, current_step } = thoughtData;
+        let icon;
+        let label = 'Thought';
+        let suffix = '';
+        if (is_revision) {
+            icon = chalk.yellow('🔄');
+            label = 'Revision';
+            suffix = chalk.gray(` (revise #${revises_thought})`);
+        } else if (branch_from_thought) {
+            icon = chalk.green('🌿');
+            label = 'Branch';
+            suffix = chalk.gray(` (from #${branch_from_thought})`);
+        } else {
+            const thoughtType = thoughtData.thought_type ?? 'regular';
+            switch(thoughtType){
+                case 'hypothesis':
+                    icon = chalk.magenta('🔬');
+                    label = 'Hypothesis';
+                    break;
+                case 'verification':
+                    icon = chalk.green('✅');
+                    label = 'Verification';
+                    break;
+                case 'critique':
+                    icon = chalk.red('🔍');
+                    label = 'Critique';
+                    break;
+                case 'synthesis':
+                    icon = chalk.cyan('🧬');
+                    label = 'Synthesis';
+                    break;
+                case 'meta':
+                    icon = chalk.gray('🧠');
+                    label = 'Meta';
+                    break;
+                default:
+                    icon = chalk.blue('💭');
+                    break;
+            }
+        }
+        const header = `${icon} ${label} ${thought_number}/${total_thoughts}${suffix}: `;
+        const lines = [];
+        lines.push(`${header}${thought}`);
+        if (current_step) {
+            const recommendation = this.formatRecommendation(current_step);
+            lines.push(`  ${recommendation}`);
+        }
+        if (thoughtData.meta_observation) lines.push(`  ${chalk.gray(`📝 ${thoughtData.meta_observation}`)}`);
+        return lines.join('\n');
+    }
+}
+export { ThoughtFormatter };
+
+//# sourceMappingURL=ThoughtFormatter.js.map

package/dist/core/ThoughtFormatter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"core/ThoughtFormatter.js","sources":["../../src/core/ThoughtFormatter.ts"],"sourcesContent":["/**\n * Display formatting for thoughts and recommendations.\n *\n * This module provides the `ThoughtFormatter` class which handles all\n * presentation logic for thought data, including clean, simple output\n * formatting and structured display of tool/skill recommendations.\n *\n * @module formatter\n */\n\nimport chalk from 'chalk';\nimport type { ThoughtType } from './reasoning.js';\nimport type { StepRecommendation } from './step.js';\nimport type { ThoughtData } from './thought.js';\n\n/**\n * Formatter for thought data and step recommendations.\n *\n * This class separates presentation concerns from business logic, providing\n * clean, readable output for thoughts with structured display of\n * tool and skill recommendations.\n *\n * @remarks\n * Output Format is clean and simple:\n * - 💭 Thought - Regular thought (blue)\n * - 🔬 Hypothesis - Proposed explanation (magenta)\n * - ✅ Verification - Testing a hypothesis (green)\n * - 🔍 Critique - Self-critique of reasoning (red)\n * - 🧬 Synthesis - Combining thoughts/branches (cyan)\n * - 🧠 Meta - Metacognitive observation (gray)\n * - 🔄 Revision - Thought that revises a previous thought (yellow)\n * - 🌿 Branch - Thought that creates a new branch (green)\n * @example\n * ```typescript\n * const formatter = new ThoughtFormatter();\n *\n * // Format a thought with recommendations\n * const output = formatter.formatThought({\n *   thought: 'I need to analyze the data structure',\n *   thought_number: 1,\n *   total_thoughts: 3,\n *   next_thought_needed: true,\n *   current_step: {\n *     step_description: 'Analyze data structure',\n *     recommended_tools: [{\n *       tool_name: 'Read',\n *       confidence: 0.95,\n *       rationale: 'Direct file reading',\n *       priority: 1,\n *       suggested_inputs: { file_path: './data/schema.json' }\n *     }],\n *     expected_outcome: 'Understanding of data schema'\n *   }\n * });\n *\n * console.log(output);\n * ```\n */\nexport class ThoughtFormatter {\n\t/**\n\t * Formats a step recommendation into a readable string.\n\t *\n\t * Creates a structured display of the step description, recommended tools,\n\t * recommended skills, expected outcome, and conditions for the next step.\n\t *\n\t * @param step - The step recommendation to format\n\t * @returns A formatted string representation of the recommendation\n\t *\n\t * @example\n\t * ```typescript\n\t * const step: StepRecommendation = {\n\t *   step_description: 'Search for API endpoints',\n\t *   recommended_tools: [{\n\t *     tool_name: 'Grep',\n\t *     confidence: 0.9,\n\t *     rationale: 'Best for searching code patterns',\n\t *     priority: 1,\n\t *     suggested_inputs: { pattern: 'export.*function' }\n\t *   }],\n\t *   expected_outcome: 'List of all exported API functions',\n\t *   next_step_conditions: ['If no results, try broader pattern']\n\t * };\n\t *\n\t * const formatted = formatter.formatRecommendation(step);\n\t * console.log(formatted);\n\t * ```\n\t */\n\tpublic formatRecommendation(step: StepRecommendation): string {\n\t\tconst parts: string[] = [];\n\n\t\t// Add tools if present\n\t\tif (step.recommended_tools?.length) {\n\t\t\tconst toolNames = step.recommended_tools.map((t) => t.tool_name).join(', ');\n\t\t\tparts.push(chalk.cyan(`Tools: ${toolNames}`));\n\t\t}\n\n\t\t// Add skills if present\n\t\tif (step.recommended_skills?.length) {\n\t\t\tconst skillNames = step.recommended_skills.map((s) => s.skill_name).join(', ');\n\t\t\tparts.push(chalk.green(`Skills: ${skillNames}`));\n\t\t}\n\n\t\t// Add expected outcome\n\t\tif (step.expected_outcome) {\n\t\t\tparts.push(chalk.gray(`→ ${step.expected_outcome}`));\n\t\t}\n\n\t\treturn parts.join(' | ');\n\t}\n\n\t/**\n\t * Formats a thought into a clean, simple display.\n\t *\n\t * Creates a clean output containing the thought content with an appropriate\n\t * header indicating the thought type. Priority order for icon selection:\n\t * `is_revision` > `branch_from_thought` > `thought_type`.\n\t *\n\t * Supported `thought_type` icons:\n\t * - `'regular'` (or undefined): 💭 blue \"Thought\" (default)\n\t * - `'hypothesis'`: 🔬 magenta \"Hypothesis\"\n\t * - `'verification'`: ✅ green \"Verification\"\n\t * - `'critique'`: 🔍 red \"Critique\"\n\t * - `'synthesis'`: 🧬 cyan \"Synthesis\"\n\t * - `'meta'`: 🧠 gray \"Meta\"\n\t *\n\t * @param thoughtData - The thought data to format\n\t * @returns A formatted string with thought and recommendations\n\t *\n\t * @example\n\t * ```typescript\n\t * // Regular thought\n\t * const regular = formatter.formatThought({\n\t *   thought: 'I should read the configuration file',\n\t *   thought_number: 1,\n\t *   total_thoughts: 3,\n\t *   next_thought_needed: true\n\t * });\n\t * // Output: 💭 Thought 1/3: I should read the configuration file\n\t *\n\t * // With recommendation\n\t * const withRec = formatter.formatThought({\n\t *   thought: 'I need to search the codebase',\n\t *   thought_number: 1,\n\t *   total_thoughts: 3,\n\t *   next_thought_needed: true,\n\t *   current_step: {\n\t *     step_description: 'Search for files',\n\t *     recommended_tools: [{ tool_name: 'Grep', priority: 1 }],\n\t *     expected_outcome: 'List of matching files'\n\t *   }\n\t * });\n\t * // Output:\n\t * // 💭 Thought 1/3: I need to search the codebase\n\t * //   → Tools: Grep | List of matching files\n\t * ```\n\t */\n\tpublic formatThought(thoughtData: ThoughtData): string {\n\t\tconst {\n\t\t\tthought_number,\n\t\t\ttotal_thoughts,\n\t\t\tthought,\n\t\t\tis_revision,\n\t\t\trevises_thought,\n\t\t\tbranch_from_thought,\n\t\t\tcurrent_step,\n\t\t} = thoughtData;\n\n\t\tlet icon: string;\n\t\tlet label = 'Thought';\n\t\tlet suffix = '';\n\n\t\tif (is_revision) {\n\t\t\ticon = chalk.yellow('🔄');\n\t\t\tlabel = 'Revision';\n\t\t\tsuffix = chalk.gray(` (revise #${revises_thought})`);\n\t\t} else if (branch_from_thought) {\n\t\t\ticon = chalk.green('🌿');\n\t\t\tlabel = 'Branch';\n\t\t\tsuffix = chalk.gray(` (from #${branch_from_thought})`);\n\t\t} else {\n\t\t\tconst thoughtType: ThoughtType = thoughtData.thought_type ?? 'regular';\n\t\t\tswitch (thoughtType) {\n\t\t\t\tcase 'hypothesis':\n\t\t\t\t\ticon = chalk.magenta('🔬');\n\t\t\t\t\tlabel = 'Hypothesis';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'verification':\n\t\t\t\t\ticon = chalk.green('✅');\n\t\t\t\t\tlabel = 'Verification';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'critique':\n\t\t\t\t\ticon = chalk.red('🔍');\n\t\t\t\t\tlabel = 'Critique';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'synthesis':\n\t\t\t\t\ticon = chalk.cyan('🧬');\n\t\t\t\t\tlabel = 'Synthesis';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'meta':\n\t\t\t\t\ticon = chalk.gray('🧠');\n\t\t\t\t\tlabel = 'Meta';\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\ticon = chalk.blue('💭');\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t// Build header: \"💭 Thought 1/3: \"\n\t\tconst header = `${icon} ${label} ${thought_number}/${total_thoughts}${suffix}: `;\n\n\t\t// Build content lines\n\t\tconst lines: string[] = [];\n\n\t\t// Add the thought content\n\t\tlines.push(`${header}${thought}`);\n\n\t\t// Add recommendation if present\n\t\tif (current_step) {\n\t\t\tconst recommendation = this.formatRecommendation(current_step);\n\t\t\tlines.push(`  ${recommendation}`);\n\t\t}\n\n\t\t// Add meta observation if present\n\t\tif (thoughtData.meta_observation) {\n\t\t\tlines.push(`  ${chalk.gray(`📝 ${thoughtData.meta_observation}`)}`);\n\t\t}\n\n\t\treturn lines.join('\\n');\n\t}\n}\n"],"names":["ThoughtFormatter","step","parts","toolNames","t","chalk","skillNames","s","thoughtData","thought_number","total_thoughts","thought","is_revision","revises_thought","branch_from_thought","current_step","icon","label","suffix","thoughtType","header","lines","recommendation"],"mappings":";AA0DO,MAAMA;IA6BL,qBAAqBC,IAAwB,EAAU;QAC7D,MAAMC,QAAkB,EAAE;QAG1B,IAAID,KAAK,iBAAiB,EAAE,QAAQ;YACnC,MAAME,YAAYF,KAAK,iBAAiB,CAAC,GAAG,CAAC,CAACG,IAAMA,EAAE,SAAS,EAAE,IAAI,CAAC;YACtEF,MAAM,IAAI,CAACG,MAAM,IAAI,CAAC,CAAC,OAAO,EAAEF,WAAW;QAC5C;QAGA,IAAIF,KAAK,kBAAkB,EAAE,QAAQ;YACpC,MAAMK,aAAaL,KAAK,kBAAkB,CAAC,GAAG,CAAC,CAACM,IAAMA,EAAE,UAAU,EAAE,IAAI,CAAC;YACzEL,MAAM,IAAI,CAACG,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAEC,YAAY;QAC/C;QAGA,IAAIL,KAAK,gBAAgB,EACxBC,MAAM,IAAI,CAACG,MAAM,IAAI,CAAC,CAAC,EAAE,EAAEJ,KAAK,gBAAgB,EAAE;QAGnD,OAAOC,MAAM,IAAI,CAAC;IACnB;IAgDO,cAAcM,WAAwB,EAAU;QACtD,MAAM,EACLC,cAAc,EACdC,cAAc,EACdC,OAAO,EACPC,WAAW,EACXC,eAAe,EACfC,mBAAmB,EACnBC,YAAY,EACZ,GAAGP;QAEJ,IAAIQ;QACJ,IAAIC,QAAQ;QACZ,IAAIC,SAAS;QAEb,IAAIN,aAAa;YAChBI,OAAOX,MAAM,MAAM,CAAC;YACpBY,QAAQ;YACRC,SAASb,MAAM,IAAI,CAAC,CAAC,UAAU,EAAEQ,gBAAgB,CAAC,CAAC;QACpD,OAAO,IAAIC,qBAAqB;YAC/BE,OAAOX,MAAM,KAAK,CAAC;YACnBY,QAAQ;YACRC,SAASb,MAAM,IAAI,CAAC,CAAC,QAAQ,EAAES,oBAAoB,CAAC,CAAC;QACtD,OAAO;YACN,MAAMK,cAA2BX,YAAY,YAAY,IAAI;YAC7D,OAAQW;gBACP,KAAK;oBACJH,OAAOX,MAAM,OAAO,CAAC;oBACrBY,QAAQ;oBACR;gBACD,KAAK;oBACJD,OAAOX,MAAM,KAAK,CAAC;oBACnBY,QAAQ;oBACR;gBACD,KAAK;oBACJD,OAAOX,MAAM,GAAG,CAAC;oBACjBY,QAAQ;oBACR;gBACD,KAAK;oBACJD,OAAOX,MAAM,IAAI,CAAC;oBAClBY,QAAQ;oBACR;gBACD,KAAK;oBACJD,OAAOX,MAAM,IAAI,CAAC;oBAClBY,QAAQ;oBACR;gBACD;oBACCD,OAAOX,MAAM,IAAI,CAAC;oBAClB;YACF;QACD;QAGA,MAAMe,SAAS,GAAGJ,KAAK,CAAC,EAAEC,MAAM,CAAC,EAAER,eAAe,CAAC,EAAEC,iBAAiBQ,OAAO,EAAE,CAAC;QAGhF,MAAMG,QAAkB,EAAE;QAG1BA,MAAM,IAAI,CAAC,GAAGD,SAAST,SAAS;QAGhC,IAAII,cAAc;YACjB,MAAMO,iBAAiB,IAAI,CAAC,oBAAoB,CAACP;YACjDM,MAAM,IAAI,CAAC,CAAC,EAAE,EAAEC,gBAAgB;QACjC;QAGA,IAAId,YAAY,gBAAgB,EAC/Ba,MAAM,IAAI,CAAC,CAAC,EAAE,EAAEhB,MAAM,IAAI,CAAC,CAAC,GAAG,EAAEG,YAAY,gBAAgB,EAAE,GAAG;QAGnE,OAAOa,MAAM,IAAI,CAAC;IACnB;AACD"}