@cleocode/core 2026.3.58 → 2026.3.60

package/dist/intelligence/adaptive-validation.js

@@ -0,0 +1,497 @@
+/**
+ * Adaptive Validation module for the CLEO Intelligence dimension.
+ *
+ * Extends the prediction layer with:
+ *   - Gate-level failure tracking: which verification gates fail most for which task types
+ *   - Adaptive focus suggestions: recommend which gates to pay attention to given task attributes
+ *   - Confidence scoring: compute and persist a 0-1 confidence score after task verification
+ *   - Prediction storage: persist quality predictions back to brain as observations so
+ *     subsequent sessions can learn from them
+ *
+ * All storage goes to existing brain tables (brain_observations, brain_learnings,
+ * brain_patterns). No new tables required.
+ *
+ * @task T035
+ * @epic T029
+ * @module intelligence
+ */
+import { randomBytes } from 'node:crypto';
+import { predictValidationOutcome } from './prediction.js';
+// ============================================================================
+// Constants
+// ============================================================================
+/**
+ * Ordered list of all supported verification gates.
+ * Order reflects typical RCASD pipeline sequence.
+ */
+const ALL_GATES = [
+    'implemented',
+    'testsPassed',
+    'qaPassed',
+    'cleanupDone',
+    'securityPassed',
+    'documented',
+];
+/** Minimum confidence threshold to consider a gate "high-risk" for focus. */
+const GATE_RISK_THRESHOLD = 0.3;
+// ============================================================================
+// Adaptive Validation Gate Focus
+// ============================================================================
+/**
+ * Suggest which verification gates to focus on for a task, ordered by risk.
+ *
+ * Uses:
+ * - Historical failure patterns from brain_patterns filtered by task type/labels
+ * - Task characteristics (size, type, labels, priority) to weight gate risk
+ * - Existing gate state from task.verification to skip already-passed gates
+ *
+ * @param taskId - The task to analyze
+ * @param taskAccessor - DataAccessor for tasks.db
+ * @param brainAccessor - BrainDataAccessor for brain.db
+ * @returns Ordered gate focus recommendations and overall confidence
+ */
+export async function suggestGateFocus(taskId, taskAccessor, brainAccessor) {
+    const task = await taskAccessor.loadSingleTask(taskId);
+    if (!task) {
+        return {
+            taskId,
+            gateFocus: [],
+            overallConfidence: 0,
+            tips: [`Task ${taskId} not found — cannot generate gate focus suggestions.`],
+        };
+    }
+    const gateFocus = await computeGateFocusRecommendations(task, brainAccessor);
+    const overallConfidence = computeOverallConfidenceFromGates(gateFocus);
+    const tips = buildAdaptiveTips(task, gateFocus);
+    return {
+        taskId,
+        gateFocus,
+        overallConfidence: Math.round(overallConfidence * 1000) / 1000,
+        tips,
+    };
+}
+// ============================================================================
+// Confidence Scoring for Verification Gates
+// ============================================================================
+/**
+ * Compute a confidence score for a completed verification round and persist
+ * it to brain.db as an observation and learning.
+ *
+ * Called after `cleo verify` gates are set. Stores:
+ * - A `brain_observations` row (type: 'discovery') with score, gates, task metadata
+ * - A `brain_learnings` row if the result is notable (high pass or high failure)
+ *
+ * @param taskId - The task that was verified
+ * @param verification - The task's current verification state
+ * @param taskAccessor - DataAccessor for tasks.db
+ * @param brainAccessor - BrainDataAccessor for brain.db
+ * @param options - Persistence and session options
+ * @returns Computed confidence score with optional persisted observation/learning IDs
+ */
+export async function scoreVerificationConfidence(taskId, verification, taskAccessor, brainAccessor, options = {}) {
+    const task = await taskAccessor.loadSingleTask(taskId);
+    const gatesPassed = [];
+    const gatesFailed = [];
+    for (const gate of ALL_GATES) {
+        const gateValue = verification.gates[gate];
+        if (gateValue === true) {
+            gatesPassed.push(gate);
+        }
+        else if (gateValue === false || gateValue === null) {
+            gatesFailed.push(gate);
+        }
+        // undefined gates are ignored (not required)
+    }
+    const confidenceScore = computeVerificationConfidence(verification, gatesPassed, gatesFailed);
+    if (options.dryRun) {
+        return {
+            taskId,
+            confidenceScore,
+            passed: verification.passed,
+            gatesPassed,
+            gatesFailed,
+        };
+    }
+    // Persist observation to brain
+    const observationId = await persistVerificationObservation(taskId, task, verification, confidenceScore, gatesPassed, gatesFailed, brainAccessor, options);
+    // Extract learning if notable
+    const learningId = await maybeExtractLearning(taskId, task, verification, confidenceScore, gatesPassed, gatesFailed, brainAccessor);
+    return {
+        taskId,
+        confidenceScore,
+        passed: verification.passed,
+        gatesPassed,
+        gatesFailed,
+        observationId,
+        learningId,
+    };
+}
+// ============================================================================
+// Quality Prediction Storage
+// ============================================================================
+/**
+ * Store a validation prediction as a brain observation for future learning.
+ *
+ * Saves the full `ValidationPrediction` to brain_observations so that
+ * accumulated predictions can later be analyzed to improve gate pass rates.
+ *
+ * @param prediction - The prediction to persist
+ * @param brainAccessor - BrainDataAccessor for brain.db
+ * @param options - Dry-run and session options
+ * @returns The created brain observation ID (or undefined on dry run)
+ */
+export async function storePrediction(prediction, brainAccessor, options = {}) {
+    if (options.dryRun)
+        return undefined;
+    const id = `O-pred-${randomBytes(4).toString('hex')}`;
+    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
+    const facts = [
+        `taskId: ${prediction.taskId}`,
+        `stage: ${prediction.stage}`,
+        `passLikelihood: ${prediction.passLikelihood}`,
+        `blockers: ${prediction.blockers.length}`,
+        `suggestions: ${prediction.suggestions.length}`,
+    ];
+    await brainAccessor.addObservation({
+        id,
+        type: 'discovery',
+        title: `Quality prediction: ${prediction.taskId} at ${prediction.stage} stage`,
+        subtitle: `Pass likelihood: ${Math.round(prediction.passLikelihood * 100)}%`,
+        narrative: prediction.blockers.length > 0
+            ? `Blockers: ${prediction.blockers.join('; ')}`
+            : 'No blockers identified.',
+        factsJson: JSON.stringify(facts),
+        conceptsJson: JSON.stringify(['quality-prediction', 'adaptive-validation', prediction.stage]),
+        project: options.project ?? null,
+        filesReadJson: null,
+        filesModifiedJson: null,
+        sourceSessionId: options.sessionId ?? null,
+        sourceType: 'agent',
+        contentHash: null,
+        discoveryTokens: null,
+        createdAt: now,
+        updatedAt: null,
+    });
+    return id;
+}
+/**
+ * Compute a prediction for a task and immediately persist it to brain.
+ *
+ * Convenience wrapper combining `predictValidationOutcome` and `storePrediction`.
+ *
+ * @param taskId - The task to predict and record
+ * @param stage - The lifecycle stage being predicted
+ * @param taskAccessor - DataAccessor for tasks.db
+ * @param brainAccessor - BrainDataAccessor for brain.db
+ * @param options - Dry-run and session options
+ * @returns The prediction with optional stored observation ID
+ */
+export async function predictAndStore(taskId, stage, taskAccessor, brainAccessor, options = {}) {
+    const prediction = await predictValidationOutcome(taskId, stage, taskAccessor, brainAccessor);
+    const observationId = await storePrediction(prediction, brainAccessor, options);
+    return { ...prediction, observationId };
+}
+// ============================================================================
+// Internal: Gate Focus Computation
+// ============================================================================
+async function computeGateFocusRecommendations(task, brainAccessor) {
+    const existingGates = task.verification?.gates ?? {};
+    const taskLabels = new Set((task.labels ?? []).map((l) => l.toLowerCase()));
+    const taskTitle = task.title.toLowerCase();
+    // Load failure patterns to detect which gates commonly fail for similar tasks
+    const failurePatterns = await brainAccessor.findPatterns({ type: 'failure', limit: 100 });
+    const blockerPatterns = await brainAccessor.findPatterns({ type: 'blocker', limit: 50 });
+    const allNegativePatterns = [...failurePatterns, ...blockerPatterns];
+    const recommendations = [];
+    for (const gate of ALL_GATES) {
+        // Skip gates already passed
+        if (existingGates[gate] === true)
+            continue;
+        const gateRisk = computeGateRisk(gate, task, taskLabels, taskTitle, allNegativePatterns);
+        const rationale = buildGateRationale(gate, gateRisk, task, existingGates[gate]);
+        const mitigation = findGateMitigation(gate, taskLabels, taskTitle, allNegativePatterns);
+        const priority = gateRisk >= 0.6 ? 'high' : gateRisk >= GATE_RISK_THRESHOLD ? 'medium' : 'low';
+        recommendations.push({
+            gate,
+            priority,
+            rationale: mitigation ? `${rationale} Suggestion: ${mitigation}` : rationale,
+            estimatedPassLikelihood: gateRisk > 0 ? Math.round((1 - gateRisk) * 1000) / 1000 : null,
+        });
+    }
+    // Sort: high first, then medium, then low; within same priority sort by risk desc
+    const priorityOrder = {
+        high: 0,
+        medium: 1,
+        low: 2,
+    };
+    recommendations.sort((a, b) => priorityOrder[a.priority] - priorityOrder[b.priority] ||
+        (a.estimatedPassLikelihood ?? 0.5) - (b.estimatedPassLikelihood ?? 0.5));
+    return recommendations;
+}
+function computeGateRisk(gate, task, taskLabels, taskTitle, negativePatterns) {
+    let risk = 0;
+    // Base risk by gate type + task attributes
+    risk += getBaseGateRisk(gate, task);
+    // Historical pattern risk: patterns that mention this gate and this task
+    let matchCount = 0;
+    let totalFailureRate = 0;
+    for (const p of negativePatterns) {
+        const patternText = p.pattern.toLowerCase();
+        const contextText = p.context.toLowerCase();
+        const gateText = gate.toLowerCase();
+        const gateMatch = patternText.includes(gateText) || contextText.includes(gateText);
+        const labelMatch = taskLabels.size > 0 &&
+            [...taskLabels].some((l) => patternText.includes(l) || contextText.includes(l));
+        const titleMatch = taskTitle
+            .split(/\s+/)
+            .filter((w) => w.length > 3)
+            .some((w) => patternText.includes(w) || contextText.includes(w));
+        if (gateMatch && (labelMatch || titleMatch)) {
+            matchCount++;
+            const failureRate = p.successRate !== null ? 1 - p.successRate : 0.5;
+            totalFailureRate += failureRate;
+        }
+    }
+    if (matchCount > 0) {
+        const avgHistoricalFailureRate = totalFailureRate / matchCount;
+        // Blend 30% base risk, 70% historical
+        risk = risk * 0.3 + avgHistoricalFailureRate * 0.7;
+    }
+    return Math.min(Math.max(risk, 0), 1);
+}
+/**
+ * Intrinsic risk per gate based on task characteristics alone (no history).
+ */
+function getBaseGateRisk(gate, task) {
+    const size = task.size ?? 'medium';
+    const sizeFactor = size === 'large' ? 0.3 : size === 'medium' ? 0.2 : 0.1;
+    const hasAcceptance = (task.acceptance?.length ?? 0) > 0;
+    const isHighPriority = task.priority === 'critical' || task.priority === 'high';
+    switch (gate) {
+        case 'implemented':
+            // Low intrinsic risk if task is active/done
+            return task.status === 'active' ? 0.2 : 0.15;
+        case 'testsPassed':
+            // Higher risk for large tasks or tasks without acceptance criteria
+            return sizeFactor + (hasAcceptance ? 0 : 0.1) + (isHighPriority ? 0.1 : 0);
+        case 'qaPassed':
+            // Higher risk for large/complex tasks
+            return sizeFactor + (isHighPriority ? 0.15 : 0.05);
+        case 'cleanupDone':
+            // Moderate risk — often overlooked
+            return 0.15 + sizeFactor;
+        case 'securityPassed': // Security-related labels increase risk significantly
+            {
+                const securityLabels = ['auth', 'security', 'crypto', 'permission', 'access'];
+                const matchingLabels = (task.labels ?? []).filter((l) => securityLabels.includes(l.toLowerCase()));
+                // Each security-related label increases risk; 2+ labels → high risk (>= 0.6)
+                if (matchingLabels.length >= 2)
+                    return 0.65;
+                if (matchingLabels.length === 1)
+                    return 0.45;
+                return 0.1;
+            }
+        case 'documented':
+            // Large tasks and those with many acceptance criteria need more docs
+            return sizeFactor + ((task.acceptance?.length ?? 0) >= 3 ? 0.1 : 0);
+        default:
+            return 0.2;
+    }
+}
+function buildGateRationale(gate, risk, task, currentValue) {
+    if (currentValue === false) {
+        return `Gate "${gate}" previously failed. High priority to address before retry.`;
+    }
+    const riskPercent = Math.round(risk * 100);
+    switch (gate) {
+        case 'implemented':
+            return `Verify core implementation is complete (estimated ${riskPercent}% failure risk).`;
+        case 'testsPassed':
+            return `Confirm all tests pass; ${(task.size ?? 'medium') === 'large' ? 'large task increases test surface area. ' : ''}Estimated ${riskPercent}% failure risk.`;
+        case 'qaPassed':
+            return `QA review required${task.priority === 'critical' ? ' — critical priority task needs thorough QA' : ''}. Estimated ${riskPercent}% failure risk.`;
+        case 'cleanupDone':
+            return `Ensure code cleanup is complete (dead code, lint, formatting). Estimated ${riskPercent}% failure risk.`;
+        case 'securityPassed':
+            return `Security review${(task.labels ?? []).some((l) => ['auth', 'security'].includes(l.toLowerCase()))
+                ? ' — security-related labels detected; review is high priority'
+                : ''}. Estimated ${riskPercent}% failure risk.`;
+        case 'documented':
+            return `Ensure documentation is updated. Estimated ${riskPercent}% failure risk.`;
+        default:
+            return `Gate "${gate}" check required. Estimated ${riskPercent}% failure risk.`;
+    }
+}
+function findGateMitigation(gate, taskLabels, taskTitle, negativePatterns) {
+    for (const p of negativePatterns) {
+        if (!p.mitigation)
+            continue;
+        const patternText = p.pattern.toLowerCase();
+        const contextText = p.context.toLowerCase();
+        const gateText = gate.toLowerCase();
+        const gateMatch = patternText.includes(gateText) || contextText.includes(gateText);
+        const labelMatch = taskLabels.size > 0 &&
+            [...taskLabels].some((l) => patternText.includes(l) || contextText.includes(l));
+        const titleMatch = taskTitle
+            .split(/\s+/)
+            .filter((w) => w.length > 3)
+            .some((w) => patternText.includes(w));
+        if (gateMatch && (labelMatch || titleMatch)) {
+            return p.mitigation;
+        }
+    }
+    return null;
+}
+function computeOverallConfidenceFromGates(recommendations) {
+    if (recommendations.length === 0)
+        return 1.0;
+    // Weighted average: high-priority gates drag confidence down more
+    const weights = {
+        high: 3,
+        medium: 2,
+        low: 1,
+    };
+    let totalWeight = 0;
+    let weightedLikelihood = 0;
+    for (const rec of recommendations) {
+        const w = weights[rec.priority];
+        const likelihood = rec.estimatedPassLikelihood ?? 0.5;
+        totalWeight += w;
+        weightedLikelihood += likelihood * w;
+    }
+    return totalWeight > 0 ? weightedLikelihood / totalWeight : 0.5;
+}
+function buildAdaptiveTips(task, recommendations) {
+    const tips = [];
+    const highPriority = recommendations.filter((r) => r.priority === 'high');
+    if (highPriority.length > 0) {
+        tips.push(`Focus first on high-risk gates: ${highPriority.map((r) => r.gate).join(', ')}.`);
+    }
+    if ((task.acceptance?.length ?? 0) === 0) {
+        tips.push('Add acceptance criteria to improve gate prediction accuracy.');
+    }
+    if ((task.labels?.length ?? 0) === 0) {
+        tips.push('Adding labels will improve historical pattern matching for future predictions.');
+    }
+    const alreadyFailed = recommendations.filter((r) => r.rationale.includes('previously failed'));
+    if (alreadyFailed.length > 0) {
+        tips.push(`${alreadyFailed.length} gate(s) failed in a previous round — address these before re-running verification.`);
+    }
+    return tips;
+}
+// ============================================================================
+// Internal: Confidence Score Computation
+// ============================================================================
+function computeVerificationConfidence(verification, gatesPassed, gatesFailed) {
+    // Component 1: Gates passed ratio (up to 0.6)
+    const totalGatesTracked = gatesPassed.length + gatesFailed.length;
+    const gateRatio = totalGatesTracked > 0 ? gatesPassed.length / totalGatesTracked : 0.5;
+    const gateScore = gateRatio * 0.6;
+    // Component 2: Failure log penalty (up to 0.2; fewer failures = higher score)
+    const failureCount = verification.failureLog?.length ?? 0;
+    // Score decreases 0.04 per logged failure, capped at 0.2 deduction
+    const failurePenalty = Math.min(failureCount * 0.04, 0.2);
+    const failureScore = 0.2 - failurePenalty;
+    // Component 3: Round penalty (up to 0.2; fewer rounds = higher score)
+    const round = verification.round ?? 1;
+    // Round 1 = full 0.2; each extra round deducts 0.05
+    const roundPenalty = Math.min((round - 1) * 0.05, 0.2);
+    const roundScore = 0.2 - roundPenalty;
+    const total = gateScore + failureScore + roundScore;
+    return Math.round(Math.min(Math.max(total, 0), 1) * 1000) / 1000;
+}
+// ============================================================================
+// Internal: Brain Persistence Helpers
+// ============================================================================
+async function persistVerificationObservation(taskId, task, verification, confidenceScore, gatesPassed, gatesFailed, brainAccessor, options) {
+    const id = `O-vconf-${randomBytes(4).toString('hex')}`;
+    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
+    const facts = [
+        `taskId: ${taskId}`,
+        `confidenceScore: ${confidenceScore}`,
+        `passed: ${verification.passed}`,
+        `round: ${verification.round}`,
+        `gatesPassed: ${gatesPassed.join(', ') || 'none'}`,
+        `gatesFailed: ${gatesFailed.join(', ') || 'none'}`,
+        `failureLogEntries: ${verification.failureLog?.length ?? 0}`,
+    ];
+    if (task) {
+        facts.push(`taskSize: ${task.size ?? 'unspecified'}`);
+        facts.push(`taskPriority: ${task.priority}`);
+        if (task.labels?.length) {
+            facts.push(`labels: ${task.labels.join(', ')}`);
+        }
+    }
+    const title = verification.passed
+        ? `Verification passed: ${taskId} (confidence: ${Math.round(confidenceScore * 100)}%)`
+        : `Verification failed: ${taskId} (confidence: ${Math.round(confidenceScore * 100)}%)`;
+    await brainAccessor.addObservation({
+        id,
+        type: 'discovery',
+        title,
+        subtitle: `Round ${verification.round} — gates: ${gatesPassed.length} passed, ${gatesFailed.length} failed`,
+        narrative: gatesFailed.length > 0
+            ? `Failed gates: ${gatesFailed.join(', ')}. Consider addressing these before next round.`
+            : 'All tracked gates passed.',
+        factsJson: JSON.stringify(facts),
+        conceptsJson: JSON.stringify([
+            'verification',
+            'confidence-score',
+            'gate-tracking',
+            verification.passed ? 'pass' : 'fail',
+        ]),
+        project: options.project ?? null,
+        filesReadJson: null,
+        filesModifiedJson: null,
+        sourceSessionId: options.sessionId ?? null,
+        sourceType: 'agent',
+        contentHash: null,
+        discoveryTokens: null,
+        createdAt: now,
+        updatedAt: null,
+    });
+    return id;
+}
+async function maybeExtractLearning(taskId, task, verification, confidenceScore, gatesPassed, gatesFailed, brainAccessor) {
+    // Only extract a learning when the result is notable:
+    // - High confidence pass (>= 0.8) on first round: positive learning
+    // - Low confidence or multiple failures: negative learning for future avoidance
+    const isNotable = (verification.passed && confidenceScore >= 0.8 && verification.round === 1) ||
+        (!verification.passed && gatesFailed.length >= 2) ||
+        (!verification.passed && (verification.failureLog?.length ?? 0) >= 3);
+    if (!isNotable)
+        return undefined;
+    const id = `L-vconf-${randomBytes(4).toString('hex')}`;
+    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
+    const taskLabels = task?.labels ?? [];
+    const taskSize = task?.size ?? 'medium';
+    const taskType = task?.type ?? 'task';
+    let insight;
+    let actionable;
+    let confidence;
+    if (verification.passed && confidenceScore >= 0.8) {
+        insight = `High-confidence verification pass for ${taskSize} ${taskType} task${taskLabels.length ? ` with labels [${taskLabels.join(', ')}]` : ''}. Pattern: ${gatesPassed.join(', ')} all passed on round ${verification.round}.`;
+        actionable = false;
+        confidence = confidenceScore;
+    }
+    else {
+        insight = `Verification failure pattern: ${gatesFailed.join(', ')} failed${taskLabels.length ? ` for tasks with labels [${taskLabels.join(', ')}]` : ''}. Failures logged: ${verification.failureLog?.length ?? 0}. Address these gates early.`;
+        actionable = true;
+        confidence = Math.max(0.5, 1 - confidenceScore);
+    }
+    await brainAccessor.addLearning({
+        id,
+        insight,
+        source: `verification-confidence:${taskId}`,
+        confidence,
+        actionable,
+        application: actionable
+            ? `Focus on ${gatesFailed.join(', ')} gates for similar ${taskSize} tasks`
+            : null,
+        applicableTypesJson: JSON.stringify([taskType]),
+        createdAt: now,
+        updatedAt: null,
+    });
+    return id;
+}
+//# sourceMappingURL=adaptive-validation.js.map

package/dist/intelligence/adaptive-validation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adaptive-validation.js","sourceRoot":"","sources":["../../src/intelligence/adaptive-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAI1C,OAAO,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAG3D,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,SAAS,GAAuB;IACpC,aAAa;IACb,aAAa;IACb,UAAU;IACV,aAAa;IACb,gBAAgB;IAChB,YAAY;CACb,CAAC;AAEF,6EAA6E;AAC7E,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAkFhC,+EAA+E;AAC/E,iCAAiC;AACjC,+EAA+E;AAE/E;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,MAAc,EACd,YAA0B,EAC1B,aAAgC;IAEhC,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACvD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO;YACL,MAAM;YACN,SAAS,EAAE,EAAE;YACb,iBAAiB,EAAE,CAAC;YACpB,IAAI,EAAE,CAAC,QAAQ,MAAM,sDAAsD,CAAC;SAC7E,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,+BAA+B,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC7E,MAAM,iBAAiB,GAAG,iCAAiC,CAAC,SAAS,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAEhD,OAAO;QACL,MAAM;QACN,SAAS;QACT,iBAAiB,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,GAAG,IAAI;QAC9D,IAAI;KACL,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,4CAA4C;AAC5C,+EAA+E;AAE/E;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,MAAc,EACd,YAA8B,EAC9B,YAA0B,EAC1B,aAAgC,EAChC,UAAkC,EAAE;IAEpC,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAEvD,MAAM,WAAW,GAAuB,EAAE,CAAC;IAC3C,MAAM,WAAW,GAAuB,EAAE,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;aAAM,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACrD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,6CAA6C;IAC/C,CAAC;IAED,MAAM,eAAe,GAAG,6BAA6B,CAAC,YAAY,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;IAE9F,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACnB,OAAO;YACL,MAAM;YACN,eAAe;YACf,MAAM,EAAE,YAAY,CAAC,MAAM;YAC3B,WAAW;YACX,WAAW;SACZ,CAAC;IACJ,CAAC;IAED,+BAA+B;IAC/B,MAAM,aAAa,GAAG,MAAM,8BAA8B,CACxD,MAAM,EACN,IAAI,EACJ,YAAY,EACZ,eAAe,EACf,WAAW,EACX,WAAW,EACX,aAAa,EACb,OAAO,CACR,CAAC;IAEF,8BAA8B;IAC9B,MAAM,UAAU,GAAG,MAAM,oBAAoB,CAC3C,MAAM,EACN,IAAI,EACJ,YAAY,EACZ,eAAe,EACf,WAAW,EACX,WAAW,EACX,aAAa,CACd,CAAC;IAEF,OAAO;QACL,MAAM;QACN,eAAe;QACf,MAAM,EAAE,YAAY,CAAC,MAAM;QAC3B,WAAW;QACX,WAAW;QACX,aAAa;QACb,UAAU;KACX,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,6BAA6B;AAC7B,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,UAAgC,EAChC,aAAgC,EAChC,UAAkC,EAAE;IAEpC,IAAI,OAAO,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAErC,MAAM,EAAE,GAAG,UAAU,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;IACtD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpE,MAAM,KAAK,GAAa;QACtB,WAAW,UAAU,CAAC,MAAM,EAAE;QAC9B,UAAU,UAAU,CAAC,KAAK,EAAE;QAC5B,mBAAmB,UAAU,CAAC,cAAc,EAAE;QAC9C,aAAa,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE;QACzC,gBAAgB,UAAU,CAAC,WAAW,CAAC,MAAM,EAAE;KAChD,CAAC;IAEF,MAAM,aAAa,CAAC,cAAc,CAAC;QACjC,EAAE;QACF,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,uBAAuB,UAAU,CAAC,MAAM,OAAO,UAAU,CAAC,KAAK,QAAQ;QAC9E,QAAQ,EAAE,oBAAoB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,cAAc,GAAG,GAAG,CAAC,GAAG;QAC5E,SAAS,EACP,UAAU,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YAC5B,CAAC,CAAC,aAAa,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC/C,CAAC,CAAC,yBAAyB;QAC/B,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;QAChC,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,oBAAoB,EAAE,qBAAqB,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QAC7F,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,IAAI;QAChC,aAAa,EAAE,IAAI;QACnB,iBAAiB,EAAE,IAAI;QACvB,eAAe,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI;QAC1C,UAAU,EAAE,OAAO;QACnB,WAAW,EAAE,IAAI;QACjB,eAAe,EAAE,IAAI;QACrB,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,IAAI;KAChB,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAc,EACd,KAAa,EACb,YAA0B,EAC1B,aAAgC,EAChC,UAAkC,EAAE;IAEpC,MAAM,UAAU,GAAG,MAAM,wBAAwB,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;IAC9F,MAAM,aAAa,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC;IAChF,OAAO,EAAE,GAAG,UAAU,EAAE,aAAa,EAAE,CAAC;AAC1C,CAAC;AAED,+EAA+E;AAC/E,mCAAmC;AACnC,+EAA+E;AAE/E,KAAK,UAAU,+BAA+B,CAC5C,IAAU,EACV,aAAgC;IAEhC,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,EAAE,KAAK,IAAI,EAAE,CAAC;IACrD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;IAE3C,8EAA8E;IAC9E,MAAM,eAAe,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1F,MAAM,eAAe,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACzF,MAAM,mBAAmB,GAAG,CAAC,GAAG,eAAe,EAAE,GAAG,eAAe,CAAC,CAAC;IAErE,MAAM,eAAe,GAA8B,EAAE,CAAC;IAEtD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,4BAA4B;QAC5B,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,SAAS;QAE3C,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,mBAAmB,CAAC,CAAC;QAEzF,MAAM,SAAS,GAAG,kBAAkB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QAChF,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,mBAAmB,CAAC,CAAC;QAExF,MAAM,QAAQ,GACZ,QAAQ,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,IAAI,mBAAmB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;QAEhF,eAAe,CAAC,IAAI,CAAC;YACnB,IAAI;YACJ,QAAQ;YACR,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,gBAAgB,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS;YAC5E,uBAAuB,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI;SACxF,CAAC,CAAC;IACL,CAAC;IAED,kFAAkF;IAClF,MAAM,aAAa,GAAwD;QACzE,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IACF,eAAe,CAAC,IAAI,CAClB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC;QACrD,CAAC,CAAC,CAAC,uBAAuB,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,uBAAuB,IAAI,GAAG,CAAC,CAC1E,CAAC;IAEF,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,SAAS,eAAe,CACtB,IAAsB,EACtB,IAAU,EACV,UAAuB,EACvB,SAAiB,EACjB,gBAAyF;IAEzF,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,2CAA2C;IAC3C,IAAI,IAAI,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEpC,yEAAyE;IACzE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,KAAK,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;QACjC,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAEpC,MAAM,SAAS,GAAG,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACnF,MAAM,UAAU,GACd,UAAU,CAAC,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,UAAU,GAAG,SAAS;aACzB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;aAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnE,IAAI,SAAS,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,EAAE,CAAC;YAC5C,UAAU,EAAE,CAAC;YACb,MAAM,WAAW,GAAG,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;YACrE,gBAAgB,IAAI,WAAW,CAAC;QAClC,CAAC;IACH,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,wBAAwB,GAAG,gBAAgB,GAAG,UAAU,CAAC;QAC/D,sCAAsC;QACtC,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,wBAAwB,GAAG,GAAG,CAAC;IACrD,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,IAAsB,EAAE,IAAU;IACzD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC;IACnC,MAAM,UAAU,GAAG,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC1E,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACzD,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC;IAEhF,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,aAAa;YAChB,4CAA4C;YAC5C,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAE/C,KAAK,aAAa;YAChB,mEAAmE;YACnE,OAAO,UAAU,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7E,KAAK,UAAU;YACb,sCAAsC;YACtC,OAAO,UAAU,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAErD,KAAK,aAAa;YAChB,mCAAmC;YACnC,OAAO,IAAI,GAAG,UAAU,CAAC;QAE3B,KAAK,gBAAgB,EAAE,sDAAsD;YAC3E,CAAC;gBACC,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;gBAC9E,MAAM,cAAc,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACtD,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CACzC,CAAC;gBACF,6EAA6E;gBAC7E,IAAI,cAAc,CAAC,MAAM,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;gBAC5C,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;gBAC7C,OAAO,GAAG,CAAC;YACb,CAAC;QAEH,KAAK,YAAY;YACf,qEAAqE;YACrE,OAAO,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtE;YACE,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,IAAsB,EACtB,IAAY,EACZ,IAAU,EACV,YAAwC;IAExC,IAAI,YAAY,KAAK,KAAK,EAAE,CAAC;QAC3B,OAAO,SAAS,IAAI,6DAA6D,CAAC;IACpF,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;IAE3C,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,aAAa;YAChB,OAAO,qDAAqD,WAAW,kBAAkB,CAAC;QAC5F,KAAK,aAAa;YAChB,OAAO,2BACL,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,0CAA0C,CAAC,CAAC,CAAC,EACrF,aAAa,WAAW,iBAAiB,CAAC;QAC5C,KAAK,UAAU;YACb,OAAO,qBACL,IAAI,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC,CAAC,6CAA6C,CAAC,CAAC,CAAC,EACjF,eAAe,WAAW,iBAAiB,CAAC;QAC9C,KAAK,aAAa;YAChB,OAAO,4EAA4E,WAAW,iBAAiB,CAAC;QAClH,KAAK,gBAAgB;YACnB,OAAO,kBACL,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;gBAC7E,CAAC,CAAC,8DAA8D;gBAChE,CAAC,CAAC,EACN,eAAe,WAAW,iBAAiB,CAAC;QAC9C,KAAK,YAAY;YACf,OAAO,8CAA8C,WAAW,iBAAiB,CAAC;QACpF;YACE,OAAO,SAAS,IAAI,+BAA+B,WAAW,iBAAiB,CAAC;IACpF,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,IAAsB,EACtB,UAAuB,EACvB,SAAiB,EACjB,gBAIE;IAEF,KAAK,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;QACjC,IAAI,CAAC,CAAC,CAAC,UAAU;YAAE,SAAS;QAE5B,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAEpC,MAAM,SAAS,GAAG,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACnF,MAAM,UAAU,GACd,UAAU,CAAC,IAAI,GAAG,CAAC;YACnB,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,UAAU,GAAG,SAAS;aACzB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;aAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAExC,IAAI,SAAS,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,EAAE,CAAC;YAC5C,OAAO,CAAC,CAAC,UAAU,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,iCAAiC,CAAC,eAA0C;IACnF,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAE7C,kEAAkE;IAClE,MAAM,OAAO,GAAwD;QACnE,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IAEF,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAE3B,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,UAAU,GAAG,GAAG,CAAC,uBAAuB,IAAI,GAAG,CAAC;QACtD,WAAW,IAAI,CAAC,CAAC;QACjB,kBAAkB,IAAI,UAAU,GAAG,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;AAClE,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAU,EAAE,eAA0C;IAC/E,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC;IAC1E,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,mCAAmC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9F,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,8DAA8D,CAAC,CAAC;IAC5E,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,gFAAgF,CAAC,CAAC;IAC9F,CAAC;IAED,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAC/F,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI,CACP,GAAG,aAAa,CAAC,MAAM,qFAAqF,CAC7G,CAAC;IACJ,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+EAA+E;AAC/E,yCAAyC;AACzC,+EAA+E;AAE/E,SAAS,6BAA6B,CACpC,YAA8B,EAC9B,WAA+B,EAC/B,WAA+B;IAE/B,8CAA8C;IAC9C,MAAM,iBAAiB,GAAG,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;IAClE,MAAM,SAAS,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC;IACvF,MAAM,SAAS,GAAG,SAAS,GAAG,GAAG,CAAC;IAElC,8EAA8E;IAC9E,MAAM,YAAY,GAAG,YAAY,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,CAAC;IAC1D,mEAAmE;IACnE,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1D,MAAM,YAAY,GAAG,GAAG,GAAG,cAAc,CAAC;IAE1C,sEAAsE;IACtE,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,IAAI,CAAC,CAAC;IACtC,oDAAoD;IACpD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;IACvD,MAAM,UAAU,GAAG,GAAG,GAAG,YAAY,CAAC;IAEtC,MAAM,KAAK,GAAG,SAAS,GAAG,YAAY,GAAG,UAAU,CAAC;IACpD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACnE,CAAC;AAED,+EAA+E;AAC/E,sCAAsC;AACtC,+EAA+E;AAE/E,KAAK,UAAU,8BAA8B,CAC3C,MAAc,EACd,IAAiB,EACjB,YAA8B,EAC9B,eAAuB,EACvB,WAA+B,EAC/B,WAA+B,EAC/B,aAAgC,EAChC,OAA+B;IAE/B,MAAM,EAAE,GAAG,WAAW,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;IACvD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpE,MAAM,KAAK,GAAa;QACtB,WAAW,MAAM,EAAE;QACnB,oBAAoB,eAAe,EAAE;QACrC,WAAW,YAAY,CAAC,MAAM,EAAE;QAChC,UAAU,YAAY,CAAC,KAAK,EAAE;QAC9B,gBAAgB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,EAAE;QAClD,gBAAgB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,EAAE;QAClD,sBAAsB,YAAY,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,EAAE;KAC7D,CAAC;IAEF,IAAI,IAAI,EAAE,CAAC;QACT,KAAK,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,IAAI,aAAa,EAAE,CAAC,CAAC;QACtD,KAAK,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC7C,IAAI,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM;QAC/B,CAAC,CAAC,wBAAwB,MAAM,iBAAiB,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,GAAG,CAAC,IAAI;QACtF,CAAC,CAAC,wBAAwB,MAAM,iBAAiB,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,GAAG,CAAC,IAAI,CAAC;IAEzF,MAAM,aAAa,CAAC,cAAc,CAAC;QACjC,EAAE;QACF,IAAI,EAAE,WAAW;QACjB,KAAK;QACL,QAAQ,EAAE,SAAS,YAAY,CAAC,KAAK,aAAa,WAAW,CAAC,MAAM,YAAY,WAAW,CAAC,MAAM,SAAS;QAC3G,SAAS,EACP,WAAW,CAAC,MAAM,GAAG,CAAC;YACpB,CAAC,CAAC,iBAAiB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,gDAAgD;YACzF,CAAC,CAAC,2BAA2B;QACjC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;QAChC,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC;YAC3B,cAAc;YACd,kBAAkB;YAClB,eAAe;YACf,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;SACtC,CAAC;QACF,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,IAAI;QAChC,aAAa,EAAE,IAAI;QACnB,iBAAiB,EAAE,IAAI;QACvB,eAAe,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI;QAC1C,UAAU,EAAE,OAAO;QACnB,WAAW,EAAE,IAAI;QACjB,eAAe,EAAE,IAAI;QACrB,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,IAAI;KAChB,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,KAAK,UAAU,oBAAoB,CACjC,MAAc,EACd,IAAiB,EACjB,YAA8B,EAC9B,eAAuB,EACvB,WAA+B,EAC/B,WAA+B,EAC/B,aAAgC;IAEhC,sDAAsD;IACtD,oEAAoE;IACpE,gFAAgF;IAChF,MAAM,SAAS,GACb,CAAC,YAAY,CAAC,MAAM,IAAI,eAAe,IAAI,GAAG,IAAI,YAAY,CAAC,KAAK,KAAK,CAAC,CAAC;QAC3E,CAAC,CAAC,YAAY,CAAC,MAAM,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,CAAC;QACjD,CAAC,CAAC,YAAY,CAAC,MAAM,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAExE,IAAI,CAAC,SAAS;QAAE,OAAO,SAAS,CAAC;IAEjC,MAAM,EAAE,GAAG,WAAW,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;IACvD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpE,MAAM,UAAU,GAAG,IAAI,EAAE,MAAM,IAAI,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,EAAE,IAAI,IAAI,QAAQ,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,EAAE,IAAI,IAAI,MAAM,CAAC;IAEtC,IAAI,OAAe,CAAC;IACpB,IAAI,UAAmB,CAAC;IACxB,IAAI,UAAkB,CAAC;IAEvB,IAAI,YAAY,CAAC,MAAM,IAAI,eAAe,IAAI,GAAG,EAAE,CAAC;QAClD,OAAO,GAAG,yCAAyC,QAAQ,IAAI,QAAQ,QACrE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAClE,cAAc,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,YAAY,CAAC,KAAK,GAAG,CAAC;QAClF,UAAU,GAAG,KAAK,CAAC;QACnB,UAAU,GAAG,eAAe,CAAC;IAC/B,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,iCAAiC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,UAC/D,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,2BAA2B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAC5E,sBAAsB,YAAY,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,8BAA8B,CAAC;QACzF,UAAU,GAAG,IAAI,CAAC;QAClB,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,eAAe,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,aAAa,CAAC,WAAW,CAAC;QAC9B,EAAE;QACF,OAAO;QACP,MAAM,EAAE,2BAA2B,MAAM,EAAE;QAC3C,UAAU;QACV,UAAU;QACV,WAAW,EAAE,UAAU;YACrB,CAAC,CAAC,YAAY,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,sBAAsB,QAAQ,QAAQ;YAC1E,CAAC,CAAC,IAAI;QACR,mBAAmB,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC/C,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,IAAI;KAChB,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/intelligence/impact.d.ts

@@ -6,11 +6,12 @@
  *   - Task impact assessment (direct + transitive dependents)
  *   - Change impact prediction (cancel, block, complete, reprioritize)
  *   - Blast radius calculation (scope quantification)
+ *   - Free-text impact prediction (predictImpact) — T043
  *
  * @module intelligence
  */
 import type { DataAccessor } from '../store/data-accessor.js';
-import type { BlastRadius, ChangeImpact, ChangeType, ImpactAssessment } from './types.js';
+import type { BlastRadius, ChangeImpact, ChangeType, ImpactAssessment, ImpactReport } from './types.js';
 /**
  * Analyze the full downstream impact of a task.
  *
@@ -48,4 +49,36 @@ export declare function analyzeChangeImpact(taskId: string, changeType: ChangeTy
  * @returns Blast radius metrics
  */
 export declare function calculateBlastRadius(taskId: string, accessor?: DataAccessor, cwd?: string): Promise<BlastRadius>;
+/**
+ * Predict the downstream impact of a free-text change description.
+ *
+ * Uses fuzzy keyword matching to identify candidate tasks that relate to
+ * the change, then walks the reverse dependency graph to enumerate all
+ * downstream tasks that may be affected.
+ *
+ * @remarks
+ * The matching is purely lexical (no embeddings). Tasks are ranked by
+ * how many tokens from the change description appear in their title and
+ * description. The top `matchLimit` (default: 5) matched tasks are used
+ * as seeds for downstream dependency tracing.
+ *
+ * @example
+ * ```ts
+ * import { predictImpact } from '@cleocode/core';
+ *
+ * const report = await predictImpact('Modify authentication flow', process.cwd());
+ * console.log(report.summary);
+ * // "3 tasks matched 'Modify authentication flow'; 7 downstream tasks affected."
+ * for (const task of report.affectedTasks) {
+ *   console.log(`${task.id} (${task.exposure}): ${task.reason}`);
+ * }
+ * ```
+ *
+ * @param change - Free-text description of the proposed change (e.g. "Modify X")
+ * @param cwd - Working directory used to locate the tasks database
+ * @param accessor - Optional pre-created DataAccessor (useful in tests)
+ * @param matchLimit - Maximum number of seed tasks to match (default: 5)
+ * @returns Full impact prediction report
+ */
+export declare function predictImpact(change: string, cwd?: string, accessor?: DataAccessor, matchLimit?: number): Promise<ImpactReport>;
 //# sourceMappingURL=impact.d.ts.map

package/dist/intelligence/impact.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"impact.d.ts","sourceRoot":"","sources":["../../src/intelligence/impact.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAI9D,OAAO,KAAK,EAEV,WAAW,EAEX,YAAY,EACZ,UAAU,EACV,gBAAgB,EACjB,MAAM,YAAY,CAAC;AA6KpB;;;;;;;;;;GAUG;AACH,wBAAsB,iBAAiB,CACrC,MAAM,EAAE,MAAM,EACd,QAAQ,CAAC,EAAE,YAAY,EACvB,GAAG,CAAC,EAAE,MAAM,GACX,OAAO,CAAC,gBAAgB,CAAC,CAyC3B;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,mBAAmB,CACvC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,UAAU,EACtB,QAAQ,CAAC,EAAE,YAAY,EACvB,GAAG,CAAC,EAAE,MAAM,GACX,OAAO,CAAC,YAAY,CAAC,CAkDvB;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,oBAAoB,CACxC,MAAM,EAAE,MAAM,EACd,QAAQ,CAAC,EAAE,YAAY,EACvB,GAAG,CAAC,EAAE,MAAM,GACX,OAAO,CAAC,WAAW,CAAC,CAoBtB"}
+{"version":3,"file":"impact.d.ts","sourceRoot":"","sources":["../../src/intelligence/impact.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAI9D,OAAO,KAAK,EAEV,WAAW,EAEX,YAAY,EACZ,UAAU,EACV,gBAAgB,EAEhB,YAAY,EACb,MAAM,YAAY,CAAC;AA6KpB;;;;;;;;;;GAUG;AACH,wBAAsB,iBAAiB,CACrC,MAAM,EAAE,MAAM,EACd,QAAQ,CAAC,EAAE,YAAY,EACvB,GAAG,CAAC,EAAE,MAAM,GACX,OAAO,CAAC,gBAAgB,CAAC,CAyC3B;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,mBAAmB,CACvC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,UAAU,EACtB,QAAQ,CAAC,EAAE,YAAY,EACvB,GAAG,CAAC,EAAE,MAAM,GACX,OAAO,CAAC,YAAY,CAAC,CAkDvB;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,oBAAoB,CACxC,MAAM,EAAE,MAAM,EACd,QAAQ,CAAC,EAAE,YAAY,EACvB,GAAG,CAAC,EAAE,MAAM,GACX,OAAO,CAAC,WAAW,CAAC,CAoBtB;AA+UD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,wBAAsB,aAAa,CACjC,MAAM,EAAE,MAAM,EACd,GAAG,CAAC,EAAE,MAAM,EACZ,QAAQ,CAAC,EAAE,YAAY,EACvB,UAAU,SAAI,GACb,OAAO,CAAC,YAAY,CAAC,CA2GvB"}