@cleocode/cleo 2026.9.7 → 2026.9.10

package/studio-dist/server/chunks/patterns-lh5kn13I.js

@@ -1,48 +0,0 @@
-import { s as storePattern } from './patterns2-CzIcT-ai.js';
-export { a as searchPatterns } from './patterns2-CzIcT-ai.js';
-import './memory-accessor2-B981tHDR.js';
-import './sqlite-Bm5LzbPs.js';
-import './paths-CV7S5-Zm.js';
-import 'node:fs';
-import 'node:path';
-import 'node:os';
-import 'node:events';
-import 'node:diagnostics_channel';
-import 'fs';
-import 'events';
-import 'util';
-import 'path';
-import 'assert';
-import 'worker_threads';
-import 'module';
-import 'node:url';
-import 'url';
-import 'buffer';
-import 'node:module';
-import 'node:child_process';
-import 'node:crypto';
-import 'node:process';
-import 'node:async_hooks';
-import './dual-scope-db-DKnWu1KM.js';
-import './indexes-DZ52grq6.js';
-import './utils-BPSZyajG.js';
-import './query-promise-BkPmGPJy.js';
-import './nexus-sqlite2-BBfY2xnY.js';
-import './nexus-schema2-DP0Qd7CA.js';
-import './chunk-DDP5xfzh.js';
-import './logger-DQIoyZbq.js';
-import 'node:sqlite';
-import './unique-constraint-BZrrwgwc.js';
-import './lock-CA7d6lj7.js';
-import './index-Dtt_h58T.js';
-import 'constants';
-import 'stream';
-import './graph-auto-populate2-Cz0qeebM.js';
-import './quality-scoring-CCPuRQmJ.js';
-import './temporal-supersession-DP4GPG_B.js';
-import './typed-query-l1D_QElt.js';
-
-
-
-export { storePattern };
-//# sourceMappingURL=patterns-lh5kn13I.js.map

package/studio-dist/server/chunks/patterns2-CzIcT-ai.js

@@ -1,177 +0,0 @@
-import { g as getBrainAccessor } from './memory-accessor2-B981tHDR.js';
-import { u as upsertGraphNode } from './graph-auto-populate2-Cz0qeebM.js';
-import { a as computePatternQuality } from './quality-scoring-CCPuRQmJ.js';
-import { d as detectSupersession, s as supersedeMemory } from './temporal-supersession-DP4GPG_B.js';
-import { createHash, randomBytes } from 'node:crypto';
-
-//#region ../core/dist/memory/patterns.js
-/**
-* Pattern Memory system for CLEO BRAIN.
-*
-* Extracts, stores, and queries workflow/blocker/success/failure/optimization
-* patterns from completed tasks and epics.
-*
-* Storage: SQLite brain_patterns table per ADR-009 Section 3.2.
-*
-* @task T4768, T5241
-* @epic T4763
-*/
-/**
-* Generate a pattern ID.
-*/
-function generatePatternId() {
-	return `P-${randomBytes(4).toString("hex")}`;
-}
-/**
-* Store a new pattern.
-* If a similar pattern already exists (same type + matching text), increments frequency.
-* @task T4768, T5241
-*/
-async function storePattern(projectRoot, params) {
-	if (!params.pattern?.trim()) throw new Error("Pattern description is required");
-	if (!params.context?.trim()) throw new Error("Pattern context is required");
-	if (!params._skipGate) {
-		const { verifyCandidate } = await import('./extraction-gate-DDNBq7gu.js');
-		const sourceConf = params.source?.startsWith("auto") ?? false ? "speculative" : "agent";
-		const gateResult = await verifyCandidate(projectRoot, {
-			text: params.pattern.trim(),
-			title: params.context.trim().slice(0, 120),
-			memoryType: "procedural",
-			tier: "medium",
-			confidence: .6,
-			source: "transcript",
-			sourceConfidence: sourceConf
-		});
-		if (gateResult.action !== "stored") {
-			const existing = gateResult.id ? await (await getBrainAccessor(projectRoot)).getPattern(gateResult.id).catch(() => null) : null;
-			if (existing) return {
-				...existing,
-				examples: JSON.parse(existing.examplesJson || "[]")
-			};
-			const now = (/* @__PURE__ */ new Date()).toISOString().replace("T", " ").slice(0, 19);
-			return {
-				id: gateResult.id ?? "",
-				type: params.type,
-				pattern: params.pattern.trim(),
-				context: params.context.trim(),
-				frequency: 1,
-				successRate: params.successRate ?? null,
-				impact: params.impact ?? null,
-				antiPattern: params.antiPattern ?? null,
-				mitigation: params.mitigation ?? null,
-				examplesJson: "[]",
-				examples: [],
-				extractedAt: now,
-				qualityScore: 0,
-				memoryTier: "medium",
-				memoryType: "procedural",
-				sourceConfidence: sourceConf,
-				verified: false,
-				contentHash: "",
-				tierPromotedAt: null,
-				tierPromotionReason: null,
-				invalidAt: null,
-				pruneCandidateAt: null,
-				citationCount: 0,
-				pruneCandidate: false
-			};
-		}
-	}
-	const accessor = await getBrainAccessor(projectRoot);
-	const existingPatterns = await accessor.findPatterns({ type: params.type });
-	const normalizedInput = params.pattern.trim().toLowerCase();
-	const duplicate = existingPatterns.find((e) => e.pattern.trim().toLowerCase() === normalizedInput);
-	const now = (/* @__PURE__ */ new Date()).toISOString().replace("T", " ").slice(0, 19);
-	if (duplicate) {
-		const existingExamples = JSON.parse(duplicate.examplesJson || "[]");
-		const newExamples = params.examples ?? [];
-		const mergedExamples = Array.from(new Set([...existingExamples, ...newExamples]));
-		await accessor.updatePattern(duplicate.id, {
-			frequency: duplicate.frequency + 1,
-			extractedAt: now,
-			examplesJson: JSON.stringify(mergedExamples)
-		});
-		const updated = await accessor.getPattern(duplicate.id);
-		upsertGraphNode(projectRoot, `pattern:${duplicate.id}`, "pattern", duplicate.pattern.substring(0, 200), duplicate.qualityScore ?? .5, duplicate.pattern + duplicate.context, {
-			type: duplicate.type,
-			impact: duplicate.impact ?? void 0,
-			frequency: duplicate.frequency + 1
-		}).catch(() => {});
-		return {
-			...updated,
-			examples: mergedExamples
-		};
-	}
-	const memoryTier = "medium";
-	const memoryType = "procedural";
-	const sourceConfidence = params.source?.startsWith("auto") ? "speculative" : "agent";
-	const verified = false;
-	const examplesJson = params.examples ? JSON.stringify(params.examples) : "[]";
-	const qualityScore = computePatternQuality({
-		type: params.type,
-		pattern: params.pattern.trim(),
-		context: params.context.trim(),
-		examples_json: examplesJson,
-		sourceConfidence,
-		memoryTier
-	});
-	const contentHashValue = createHash("sha256").update(params.pattern.trim().toLowerCase()).digest("hex").slice(0, 16);
-	const entry = {
-		id: generatePatternId(),
-		type: params.type,
-		pattern: params.pattern.trim(),
-		context: params.context.trim(),
-		frequency: 1,
-		successRate: params.successRate ?? null,
-		impact: params.impact ?? null,
-		antiPattern: params.antiPattern ?? null,
-		mitigation: params.mitigation ?? null,
-		examplesJson,
-		extractedAt: now,
-		qualityScore,
-		memoryTier,
-		memoryType,
-		sourceConfidence,
-		verified,
-		contentHash: contentHashValue
-	};
-	const saved = await accessor.addPattern(entry);
-	upsertGraphNode(projectRoot, `pattern:${saved.id}`, "pattern", saved.pattern.substring(0, 200), qualityScore, saved.pattern + saved.context, {
-		type: saved.type,
-		impact: saved.impact ?? void 0
-	}).catch(() => {});
-	if (sourceConfidence === "owner" || sourceConfidence === "task-outcome") detectSupersession(projectRoot, {
-		id: saved.id,
-		text: saved.pattern + " " + saved.context,
-		createdAt: saved.extractedAt ?? (/* @__PURE__ */ new Date()).toISOString().replace("T", " ").slice(0, 19)
-	}).then((candidates) => {
-		for (const candidate of candidates) supersedeMemory(projectRoot, candidate.existingId, saved.id, "auto:pattern-supersedes — high overlap detected at store time").catch(() => {});
-	}).catch(() => {});
-	return {
-		...saved,
-		examples: JSON.parse(saved.examplesJson || "[]")
-	};
-}
-/**
-* Search patterns by criteria.
-* @task T4768, T5241
-*/
-async function searchPatterns(projectRoot, params = {}) {
-	let entries = await (await getBrainAccessor(projectRoot)).findPatterns({
-		type: params.type,
-		impact: params.impact,
-		minFrequency: params.minFrequency,
-		limit: params.limit
-	});
-	if (params.query) {
-		const q = params.query.toLowerCase();
-		entries = entries.filter((e) => e.pattern.toLowerCase().includes(q) || e.context.toLowerCase().includes(q) || e.antiPattern?.toLowerCase().includes(q) || e.mitigation?.toLowerCase().includes(q));
-	}
-	return entries.map((e) => ({
-		...e,
-		examples: JSON.parse(e.examplesJson || "[]")
-	}));
-}
-
-export { searchPatterns as a, storePattern as s };
-//# sourceMappingURL=patterns2-CzIcT-ai.js.map

package/studio-dist/server/chunks/pipeline-stage-IB_pOft-.js

@@ -1,63 +0,0 @@
-import { g as getPipelineStageOrder } from './tasks-SHX7UPGY.js';
-import './paths-CV7S5-Zm.js';
-import 'node:fs';
-import 'node:path';
-import 'node:os';
-import 'node:events';
-import 'node:diagnostics_channel';
-import 'fs';
-import 'events';
-import 'util';
-import 'path';
-import 'assert';
-import 'worker_threads';
-import 'module';
-import 'node:url';
-import 'url';
-import 'buffer';
-import 'node:module';
-import 'node:child_process';
-import 'node:crypto';
-import 'node:process';
-import 'node:async_hooks';
-import './data-accessor-CWgVndbR.js';
-import './sqlite-Bm5LzbPs.js';
-import './dual-scope-db-DKnWu1KM.js';
-import './indexes-DZ52grq6.js';
-import './utils-BPSZyajG.js';
-import './query-promise-BkPmGPJy.js';
-import './nexus-sqlite2-BBfY2xnY.js';
-import './nexus-schema2-DP0Qd7CA.js';
-import './chunk-DDP5xfzh.js';
-import './logger-DQIoyZbq.js';
-import 'node:sqlite';
-import './unique-constraint-BZrrwgwc.js';
-import './lock-CA7d6lj7.js';
-import './index-Dtt_h58T.js';
-import 'constants';
-import 'stream';
-import 'node:fs/promises';
-import 'jsonc-parser';
-import '@cleocode/cant';
-import 'node:util';
-import 'node:buffer';
-import 'child_process';
-import './branch-lock-Cq7zzmFK.js';
-import './src2-DK8DKufK.js';
-import 'llmtxt/identity';
-import './sessions-33DD4hkt.js';
-import './registry2-DoPYJnUW.js';
-import './index-61916rmV.js';
-import './mvi-helpers-BNsJ8ZpQ.js';
-import './session-store--N_xHxUH.js';
-import './storage-B9UA3BHR.js';
-import './config-DHj9CcFs.js';
-import './json-Bfixam3g.js';
-import './data-safety-central-DaFxK27G.js';
-import './sqlite-data-accessor-DD_RFX6r.js';
-import './cross-db-cleanup-1LWTUKPi.js';
-
-
-
-export { getPipelineStageOrder };
-//# sourceMappingURL=pipeline-stage-IB_pOft-.js.map

package/studio-dist/server/chunks/prediction-D1lSGJ4c.js

@@ -1,217 +0,0 @@
-//#region ../core/dist/intelligence/prediction.js
-/**
-* Quality Prediction module for the CLEO Intelligence dimension.
-*
-* Provides risk scoring for tasks based on complexity, historical patterns,
-* and blocking analysis. Also predicts lifecycle gate validation outcomes
-* using brain_patterns and brain_learnings data.
-*
-* Uses the existing BrainDataAccessor and DataAccessor — no new tables.
-*
-* @task Wave3A
-* @epic T5149
-*/
-/** Risk factor weights — tuned to prioritize blocking risk and complexity. */
-var RISK_WEIGHTS = {
-	complexity: .25,
-	historicalFailure: .25,
-	blockingRisk: .3,
-	dependencyDepth: .2
-};
-/** Thresholds for risk level recommendations. */
-var RISK_THRESHOLDS = {
-	low: .3,
-	medium: .6,
-	high: .8
-};
-/** Size-to-complexity mapping (0-1 scale). */
-var SIZE_COMPLEXITY = {
-	small: .2,
-	medium: .5,
-	large: .8
-};
-/**
-* Calculate the risk score for a task based on multiple contributing factors.
-*
-* Factors considered:
-* - Task complexity (size, dependency count, hierarchy depth)
-* - Historical patterns (similar tasks' failure rates from brain_patterns)
-* - Blocking risk (does this task block others?)
-* - Dependency depth (how deep in the dependency chain)
-*
-* @param taskId - The task to assess
-* @param taskAccessor - DataAccessor for tasks.db
-* @param brainAccessor - BrainDataAccessor for brain.db
-* @returns A complete risk assessment with score, confidence, factors, and recommendation
-*/
-async function calculateTaskRisk(taskId, taskAccessor, brainAccessor) {
-	const task = await taskAccessor.loadSingleTask(taskId);
-	if (!task) return {
-		taskId,
-		riskScore: 0,
-		confidence: 0,
-		factors: [],
-		recommendation: `Task ${taskId} not found — cannot assess risk.`
-	};
-	const factors = [];
-	let dataPoints = 0;
-	const complexityFactor = await computeComplexityFactor(task, taskAccessor);
-	factors.push(complexityFactor);
-	dataPoints += 1;
-	const historicalFactor = await computeHistoricalFailureFactor(task, brainAccessor);
-	factors.push(historicalFactor);
-	if (historicalFactor.value > 0) dataPoints += 1;
-	const blockingFactor = await computeBlockingFactor(task, taskAccessor);
-	factors.push(blockingFactor);
-	dataPoints += 1;
-	const depthFactor = await computeDependencyDepthFactor(task, taskAccessor);
-	factors.push(depthFactor);
-	dataPoints += 1;
-	const riskScore = computeWeightedScore(factors);
-	const confidence = Math.min(1, .25 + dataPoints / 4 * .75);
-	const recommendation = generateRecommendation(riskScore, factors);
-	return {
-		taskId,
-		riskScore: Math.round(riskScore * 1e3) / 1e3,
-		confidence: Math.round(confidence * 1e3) / 1e3,
-		factors,
-		recommendation
-	};
-}
-async function computeComplexityFactor(task, accessor) {
-	const depCount = task.depends?.length ?? 0;
-	let childCount = 0;
-	try {
-		childCount = await accessor.countChildren(task.id);
-	} catch {}
-	const sizeValue = SIZE_COMPLEXITY[task.size ?? "medium"] ?? .5;
-	const depNormalized = Math.min(depCount / 10, 1);
-	const childNormalized = Math.min(childCount / 20, 1);
-	const value = sizeValue * .4 + depNormalized * .3 + childNormalized * .3;
-	const parts = [];
-	if (task.size) parts.push(`size=${task.size}`);
-	if (depCount > 0) parts.push(`${depCount} dependencies`);
-	if (childCount > 0) parts.push(`${childCount} children`);
-	return {
-		name: "complexity",
-		weight: RISK_WEIGHTS.complexity,
-		value: Math.round(value * 1e3) / 1e3,
-		description: parts.length > 0 ? `Task complexity based on ${parts.join(", ")}` : "Default complexity (no size/deps/children data)"
-	};
-}
-async function computeHistoricalFailureFactor(task, brainAccessor) {
-	const failurePatterns = await brainAccessor.findPatterns({
-		type: "failure",
-		limit: 50
-	});
-	const blockerPatterns = await brainAccessor.findPatterns({
-		type: "blocker",
-		limit: 50
-	});
-	const allNegativePatterns = [...failurePatterns, ...blockerPatterns];
-	if (allNegativePatterns.length === 0) return {
-		name: "historical_failure",
-		weight: RISK_WEIGHTS.historicalFailure,
-		value: 0,
-		description: "No historical failure patterns found in brain.db"
-	};
-	let matchCount = 0;
-	let totalFailureRate = 0;
-	const taskLabels = new Set((task.labels ?? []).map((l) => l.toLowerCase()));
-	const taskTitle = task.title.toLowerCase();
-	const taskDesc = (task.description ?? "").toLowerCase();
-	for (const p of allNegativePatterns) {
-		const patternText = p.pattern.toLowerCase();
-		const contextText = p.context.toLowerCase();
-		const hasLabelMatch = taskLabels.size > 0 && [...taskLabels].some((l) => patternText.includes(l) || contextText.includes(l));
-		const hasTitleMatch = patternText.includes(taskTitle) || taskTitle.includes(patternText.slice(0, 20));
-		const hasDescMatch = taskDesc.length > 10 && (patternText.includes(taskDesc.slice(0, 30)) || taskDesc.includes(patternText.slice(0, 30)));
-		if (hasLabelMatch || hasTitleMatch || hasDescMatch) {
-			matchCount++;
-			const failureRate = p.successRate !== null ? 1 - p.successRate : .5;
-			totalFailureRate += failureRate;
-		}
-	}
-	if (matchCount === 0) return {
-		name: "historical_failure",
-		weight: RISK_WEIGHTS.historicalFailure,
-		value: 0,
-		description: "No matching historical failure patterns for this task"
-	};
-	const avgFailureRate = totalFailureRate / matchCount;
-	return {
-		name: "historical_failure",
-		weight: RISK_WEIGHTS.historicalFailure,
-		value: Math.round(avgFailureRate * 1e3) / 1e3,
-		description: `${matchCount} matching failure/blocker pattern(s) with avg failure rate ${Math.round(avgFailureRate * 100)}%`
-	};
-}
-async function computeBlockingFactor(task, accessor) {
-	let blockedCount = 0;
-	try {
-		const { tasks: allTasks } = await accessor.queryTasks({ status: [
-			"pending",
-			"active",
-			"blocked"
-		] });
-		for (const t of allTasks) if (t.depends?.includes(task.id)) blockedCount++;
-	} catch {}
-	const value = Math.min(blockedCount / 5, 1);
-	return {
-		name: "blocking_risk",
-		weight: RISK_WEIGHTS.blockingRisk,
-		value: Math.round(value * 1e3) / 1e3,
-		description: blockedCount > 0 ? `This task blocks ${blockedCount} other task(s)` : "This task does not block any other tasks"
-	};
-}
-async function computeDependencyDepthFactor(task, accessor) {
-	let depth = 0;
-	const visited = /* @__PURE__ */ new Set();
-	let current = task;
-	while (current.depends && current.depends.length > 0 && depth < 10) {
-		const firstDep = current.depends[0];
-		if (visited.has(firstDep)) break;
-		visited.add(firstDep);
-		const depTask = await accessor.loadSingleTask(firstDep);
-		if (!depTask) break;
-		depth++;
-		current = depTask;
-	}
-	let hierarchyDepth = 0;
-	let parentId = task.parentId;
-	const visitedParents = /* @__PURE__ */ new Set();
-	while (parentId && hierarchyDepth < 10) {
-		if (visitedParents.has(parentId)) break;
-		visitedParents.add(parentId);
-		const parent = await accessor.loadSingleTask(parentId);
-		if (!parent) break;
-		hierarchyDepth++;
-		parentId = parent.parentId;
-	}
-	const totalDepth = depth + hierarchyDepth;
-	const value = Math.min(totalDepth / 8, 1);
-	return {
-		name: "dependency_depth",
-		weight: RISK_WEIGHTS.dependencyDepth,
-		value: Math.round(value * 1e3) / 1e3,
-		description: `Dependency chain depth: ${depth}, hierarchy depth: ${hierarchyDepth}`
-	};
-}
-function computeWeightedScore(factors) {
-	let totalWeight = 0;
-	let weightedSum = 0;
-	for (const f of factors) {
-		weightedSum += f.weight * f.value;
-		totalWeight += f.weight;
-	}
-	return totalWeight > 0 ? weightedSum / totalWeight : 0;
-}
-function generateRecommendation(score, factors) {
-	if (score <= RISK_THRESHOLDS.low) return "Low risk. Proceed with normal workflow.";
-	if (score <= RISK_THRESHOLDS.medium) return `Moderate risk (${factors.filter((f) => f.value > .4).sort((a, b) => b.value * b.weight - a.value * a.weight).slice(0, 2).map((f) => f.name).join(", ")}). Consider extra review or decomposition.`;
-	if (score <= RISK_THRESHOLDS.high) return "High risk. Recommend decomposition, additional testing, or pair review before proceeding.";
-	return "Critical risk. Strongly recommend breaking this task into smaller units and addressing blockers first.";
-}
-
-export { calculateTaskRisk };
-//# sourceMappingURL=prediction-D1lSGJ4c.js.map

package/studio-dist/server/chunks/premature-close-audit-VG09uAco.js

@@ -1,53 +0,0 @@
-import { c as getProjectRoot } from './paths-CV7S5-Zm.js';
-import { join } from 'node:path';
-import { mkdir, appendFile } from 'node:fs/promises';
-import 'node:fs';
-import 'node:os';
-import 'node:events';
-import 'node:diagnostics_channel';
-import 'fs';
-import 'events';
-import 'util';
-import 'path';
-import 'assert';
-import 'worker_threads';
-import 'module';
-import 'node:url';
-import 'url';
-import 'buffer';
-import 'node:module';
-import 'node:child_process';
-import 'node:crypto';
-import 'node:process';
-import 'node:async_hooks';
-
-//#region ../core/dist/tasks/premature-close-audit.js
-/**
-* Premature-close audit trail.
-*
-* Records override entries to `.cleo/audit/premature-close.jsonl` when a caller
-* bypasses the `E_EPIC_HAS_PENDING_CHILDREN` guard via `--override-reason`.
-*
-* Pattern mirrors `nexus-risk-audit.ts` (T1073) — one JSONL file per audit
-* concern, created on demand, appended atomically.
-*
-* @epic T1627
-* @task T1632
-*/
-/**
-* Append a premature-close override entry to the audit file.
-*
-* Creates `.cleo/audit/` if it does not exist and atomically appends a
-* single-line JSON record to `.cleo/audit/premature-close.jsonl`.
-*
-* @param entry - The audit entry to append.
-* @param projectRoot - Absolute path to the project root (defaults to `getProjectRoot()`).
-*/
-async function appendPrematureCloseAudit(entry, projectRoot) {
-	const auditDir = join(projectRoot ?? getProjectRoot(), ".cleo", "audit");
-	await mkdir(auditDir, { recursive: true });
-	await appendFile(join(auditDir, "premature-close.jsonl"), `${JSON.stringify(entry)}\n`, { encoding: "utf8" });
-}
-
-export { appendPrematureCloseAudit };
-//# sourceMappingURL=premature-close-audit-VG09uAco.js.map