@cleocode/core 2026.4.13 → 2026.4.15

package/dist/intelligence/prediction.js

@@ -1,499 +0,0 @@
-/**
- * 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
- */
-// ============================================================================
-// Constants
-// ============================================================================
-/** Risk factor weights — tuned to prioritize blocking risk and complexity. */
-const RISK_WEIGHTS = {
-    complexity: 0.25,
-    historicalFailure: 0.25,
-    blockingRisk: 0.3,
-    dependencyDepth: 0.2,
-};
-/** Thresholds for risk level recommendations. */
-const RISK_THRESHOLDS = {
-    low: 0.3,
-    medium: 0.6,
-    high: 0.8,
-};
-/** Size-to-complexity mapping (0-1 scale). */
-const SIZE_COMPLEXITY = {
-    small: 0.2,
-    medium: 0.5,
-    large: 0.8,
-};
-// ============================================================================
-// Risk Scoring
-// ============================================================================
-/**
- * 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
- */
-export 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;
-    // Factor 1: Complexity (size + dependency count + child count)
-    const complexityFactor = await computeComplexityFactor(task, taskAccessor);
-    factors.push(complexityFactor);
-    dataPoints += 1;
-    // Factor 2: Historical failure patterns from brain_patterns
-    const historicalFactor = await computeHistoricalFailureFactor(task, brainAccessor);
-    factors.push(historicalFactor);
-    if (historicalFactor.value > 0)
-        dataPoints += 1;
-    // Factor 3: Blocking risk (how many tasks does this block?)
-    const blockingFactor = await computeBlockingFactor(task, taskAccessor);
-    factors.push(blockingFactor);
-    dataPoints += 1;
-    // Factor 4: Dependency depth
-    const depthFactor = await computeDependencyDepthFactor(task, taskAccessor);
-    factors.push(depthFactor);
-    dataPoints += 1;
-    // Compute weighted aggregate score
-    const riskScore = computeWeightedScore(factors);
-    // Confidence scales with available data (0.25 base, up to 1.0)
-    const confidence = Math.min(1.0, 0.25 + (dataPoints / 4) * 0.75);
-    const recommendation = generateRecommendation(riskScore, factors);
-    return {
-        taskId,
-        riskScore: Math.round(riskScore * 1000) / 1000,
-        confidence: Math.round(confidence * 1000) / 1000,
-        factors,
-        recommendation,
-    };
-}
-// ============================================================================
-// Validation Outcome Prediction
-// ============================================================================
-/**
- * Predict the likelihood of a task passing a lifecycle validation gate.
- *
- * Combines:
- * - Historical gate results for similar tasks (from brain_patterns)
- * - Current task completion state
- * - Applicable learnings from brain_learnings
- *
- * @param taskId - The task to evaluate
- * @param stage - The lifecycle stage (e.g., "specification", "implementation")
- * @param taskAccessor - DataAccessor for tasks.db
- * @param brainAccessor - BrainDataAccessor for brain.db
- * @returns Prediction with pass likelihood, blockers, and suggestions
- */
-export async function predictValidationOutcome(taskId, stage, taskAccessor, brainAccessor) {
-    const task = await taskAccessor.loadSingleTask(taskId);
-    if (!task) {
-        return {
-            taskId,
-            stage,
-            passLikelihood: 0,
-            blockers: [`Task ${taskId} not found`],
-            suggestions: [],
-        };
-    }
-    const blockers = [];
-    const suggestions = [];
-    let passSignals = 0;
-    let failSignals = 0;
-    let totalSignals = 0;
-    // Signal 1: Task status assessment
-    const statusResult = assessTaskStatus(task, stage);
-    passSignals += statusResult.pass;
-    failSignals += statusResult.fail;
-    totalSignals += statusResult.total;
-    blockers.push(...statusResult.blockers);
-    suggestions.push(...statusResult.suggestions);
-    // Signal 2: Acceptance criteria completeness
-    const criteriaResult = assessAcceptanceCriteria(task);
-    passSignals += criteriaResult.pass;
-    failSignals += criteriaResult.fail;
-    totalSignals += criteriaResult.total;
-    blockers.push(...criteriaResult.blockers);
-    suggestions.push(...criteriaResult.suggestions);
-    // Signal 3: Historical success patterns from brain_patterns
-    const patternResult = await assessHistoricalPatterns(task, stage, brainAccessor);
-    passSignals += patternResult.pass;
-    failSignals += patternResult.fail;
-    totalSignals += patternResult.total;
-    suggestions.push(...patternResult.suggestions);
-    // Signal 4: Applicable learnings from brain_learnings
-    const learningContext = await gatherLearningContext(task, brainAccessor);
-    if (learningContext.actionableCount > 0) {
-        passSignals += learningContext.averageConfidence;
-        totalSignals += 1;
-    }
-    // Compute pass likelihood
-    const passLikelihood = totalSignals > 0
-        ? Math.round((passSignals / (passSignals + failSignals || 1)) * 1000) / 1000
-        : 0.5;
-    return {
-        taskId,
-        stage,
-        passLikelihood: Math.max(0, Math.min(1, passLikelihood)),
-        blockers,
-        suggestions,
-    };
-}
-// ============================================================================
-// Internal: Risk Factor Computation
-// ============================================================================
-async function computeComplexityFactor(task, accessor) {
-    const depCount = task.depends?.length ?? 0;
-    let childCount = 0;
-    try {
-        childCount = await accessor.countChildren(task.id);
-    }
-    catch {
-        // countChildren may fail for leaf tasks; default to 0
-    }
-    const sizeValue = SIZE_COMPLEXITY[task.size ?? 'medium'] ?? 0.5;
-    const depNormalized = Math.min(depCount / 10, 1.0);
-    const childNormalized = Math.min(childCount / 20, 1.0);
-    const value = sizeValue * 0.4 + depNormalized * 0.3 + childNormalized * 0.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 * 1000) / 1000,
-        description: parts.length > 0
-            ? `Task complexity based on ${parts.join(', ')}`
-            : 'Default complexity (no size/deps/children data)',
-    };
-}
-async function computeHistoricalFailureFactor(task, brainAccessor) {
-    // Look for failure and blocker patterns in brain_patterns
-    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',
-        };
-    }
-    // Score based on average failure rate of matching patterns
-    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();
-        // Check for textual overlap between pattern and task
-        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++;
-            // successRate close to 0 means high failure rate
-            const failureRate = p.successRate !== null ? 1 - p.successRate : 0.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 * 1000) / 1000,
-        description: `${matchCount} matching failure/blocker pattern(s) with avg failure rate ${Math.round(avgFailureRate * 100)}%`,
-    };
-}
-async function computeBlockingFactor(task, accessor) {
-    // Count how many other tasks depend on this task (i.e., this task blocks them)
-    let blockedCount = 0;
-    try {
-        // Query all non-done tasks to find those that depend on this task
-        const { tasks: allTasks } = await accessor.queryTasks({
-            status: ['pending', 'active', 'blocked'],
-        });
-        for (const t of allTasks) {
-            if (t.depends?.includes(task.id)) {
-                blockedCount++;
-            }
-        }
-    }
-    catch {
-        // Best-effort: if query fails, treat as unknown
-    }
-    // Normalize: 0 blocked = 0, 5+ blocked = 1.0
-    const value = Math.min(blockedCount / 5, 1.0);
-    return {
-        name: 'blocking_risk',
-        weight: RISK_WEIGHTS.blockingRisk,
-        value: Math.round(value * 1000) / 1000,
-        description: blockedCount > 0
-            ? `This task blocks ${blockedCount} other task(s)`
-            : 'This task does not block any other tasks',
-    };
-}
-async function computeDependencyDepthFactor(task, accessor) {
-    // Walk the dependency chain to measure depth
-    let depth = 0;
-    const visited = new Set();
-    let current = task;
-    while (current.depends && current.depends.length > 0 && depth < 10) {
-        const firstDep = current.depends[0];
-        if (visited.has(firstDep))
-            break; // cycle guard
-        visited.add(firstDep);
-        const depTask = await accessor.loadSingleTask(firstDep);
-        if (!depTask)
-            break;
-        depth++;
-        current = depTask;
-    }
-    // Also count parent depth (hierarchy)
-    let hierarchyDepth = 0;
-    let parentId = task.parentId;
-    const visitedParents = 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;
-    // Normalize: depth 0 = 0, depth 8+ = 1.0
-    const value = Math.min(totalDepth / 8, 1.0);
-    return {
-        name: 'dependency_depth',
-        weight: RISK_WEIGHTS.dependencyDepth,
-        value: Math.round(value * 1000) / 1000,
-        description: `Dependency chain depth: ${depth}, hierarchy depth: ${hierarchyDepth}`,
-    };
-}
-function assessTaskStatus(task, stage) {
-    const blockers = [];
-    const suggestions = [];
-    let pass = 0;
-    let fail = 0;
-    if (task.status === 'blocked') {
-        fail += 1;
-        blockers.push(`Task is currently blocked${task.blockedBy ? `: ${task.blockedBy}` : ''}`);
-        suggestions.push('Resolve blocking issues before attempting gate validation');
-    }
-    else if (task.status === 'cancelled') {
-        fail += 1;
-        blockers.push('Task is cancelled');
-    }
-    else if (task.status === 'done') {
-        pass += 1;
-    }
-    else if (task.status === 'active') {
-        // For early stages, active is fine; for late stages, may need completion
-        if (stage === 'verification' || stage === 'release') {
-            fail += 0.5;
-            suggestions.push(`Task should be completed before ${stage} gate`);
-        }
-        else {
-            pass += 0.5;
-        }
-    }
-    else {
-        // todo status
-        if (stage === 'specification') {
-            pass += 0.3;
-        }
-        else {
-            fail += 0.5;
-            suggestions.push(`Task is still in "${task.status}" status — work should begin before ${stage} gate`);
-        }
-    }
-    return { pass, fail, total: 1, blockers, suggestions };
-}
-function assessAcceptanceCriteria(task) {
-    const blockers = [];
-    const suggestions = [];
-    const criteria = task.acceptance ?? [];
-    if (criteria.length === 0) {
-        return {
-            pass: 0.3,
-            fail: 0.2,
-            total: 1,
-            blockers: [],
-            suggestions: ['Add acceptance criteria to improve validation confidence'],
-        };
-    }
-    // Having acceptance criteria is a positive signal
-    return {
-        pass: 0.7,
-        fail: 0,
-        total: 1,
-        blockers,
-        suggestions,
-    };
-}
-async function assessHistoricalPatterns(task, stage, brainAccessor) {
-    const suggestions = [];
-    let pass = 0;
-    let fail = 0;
-    let total = 0;
-    const taskLabels = new Set((task.labels ?? []).map((l) => l.toLowerCase()));
-    const taskTitle = task.title.toLowerCase();
-    // Look for success patterns related to this stage or matching task attributes
-    const successPatterns = await brainAccessor.findPatterns({ type: 'success', limit: 30 });
-    for (const p of successPatterns) {
-        const ctx = p.context.toLowerCase();
-        const pat = p.pattern.toLowerCase();
-        const stageMatch = ctx.includes(stage.toLowerCase());
-        const labelMatch = [...taskLabels].some((l) => pat.includes(l) || ctx.includes(l));
-        const titleMatch = taskTitle
-            .split(/\s+/)
-            .filter((w) => w.length > 3)
-            .some((w) => pat.includes(w));
-        if (stageMatch || labelMatch || titleMatch) {
-            total++;
-            if (p.successRate !== null && p.successRate >= 0.7) {
-                pass += p.successRate;
-            }
-            else {
-                pass += 0.5;
-            }
-        }
-    }
-    // Look for failure patterns related to this stage or matching task attributes
-    const failurePatterns = await brainAccessor.findPatterns({ type: 'failure', limit: 30 });
-    for (const p of failurePatterns) {
-        const ctx = p.context.toLowerCase();
-        const pat = p.pattern.toLowerCase();
-        const stageMatch = ctx.includes(stage.toLowerCase());
-        const labelMatch = [...taskLabels].some((l) => pat.includes(l) || ctx.includes(l));
-        const titleMatch = taskTitle
-            .split(/\s+/)
-            .filter((w) => w.length > 3)
-            .some((w) => pat.includes(w));
-        if (stageMatch || labelMatch || titleMatch) {
-            total++;
-            fail += p.successRate !== null ? 1 - p.successRate : 0.5;
-            if (p.mitigation) {
-                suggestions.push(`Historical pattern suggests: ${p.mitigation}`);
-            }
-        }
-    }
-    if (total === 0) {
-        return { pass: 0, fail: 0, total: 0, blockers: [], suggestions };
-    }
-    return { pass, fail, total, blockers: [], suggestions };
-}
-/**
- * Gather applicable learnings for a task from brain_learnings.
- */
-export async function gatherLearningContext(task, brainAccessor) {
-    const learnings = await brainAccessor.findLearnings({ limit: 100 });
-    const taskLabels = new Set((task.labels ?? []).map((l) => l.toLowerCase()));
-    const taskTitle = task.title.toLowerCase();
-    const applicable = learnings.filter((l) => {
-        const insight = l.insight.toLowerCase();
-        const source = l.source.toLowerCase();
-        // Match by task ID reference
-        if (insight.includes(task.id.toLowerCase()) || source.includes(task.id.toLowerCase())) {
-            return true;
-        }
-        // Match by label overlap
-        if (taskLabels.size > 0 && [...taskLabels].some((label) => insight.includes(label))) {
-            return true;
-        }
-        // Match by applicable types
-        const applicableTypes = JSON.parse(l.applicableTypesJson || '[]');
-        if (task.type && applicableTypes.includes(task.type)) {
-            return true;
-        }
-        // Match by title keyword overlap (at least 2 words matching)
-        const titleWords = taskTitle.split(/\s+/).filter((w) => w.length > 3);
-        const matchingWords = titleWords.filter((w) => insight.includes(w));
-        if (matchingWords.length >= 2) {
-            return true;
-        }
-        return false;
-    });
-    const totalConfidence = applicable.reduce((sum, l) => sum + l.confidence, 0);
-    const averageConfidence = applicable.length > 0 ? totalConfidence / applicable.length : 0;
-    const actionableCount = applicable.filter((l) => l.actionable).length;
-    return {
-        applicable,
-        averageConfidence: Math.round(averageConfidence * 1000) / 1000,
-        actionableCount,
-    };
-}
-// ============================================================================
-// Internal: Score Computation
-// ============================================================================
-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) {
-        const topFactors = factors
-            .filter((f) => f.value > 0.4)
-            .sort((a, b) => b.value * b.weight - a.value * a.weight)
-            .slice(0, 2);
-        const factorNames = topFactors.map((f) => f.name).join(', ');
-        return `Moderate risk (${factorNames}). 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.';
-}
-//# sourceMappingURL=prediction.js.map

package/dist/intelligence/prediction.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prediction.js","sourceRoot":"","sources":["../../src/intelligence/prediction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAOH,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,8EAA8E;AAC9E,MAAM,YAAY,GAAG;IACnB,UAAU,EAAE,IAAI;IAChB,iBAAiB,EAAE,IAAI;IACvB,YAAY,EAAE,GAAG;IACjB,eAAe,EAAE,GAAG;CACZ,CAAC;AAEX,iDAAiD;AACjD,MAAM,eAAe,GAAG;IACtB,GAAG,EAAE,GAAG;IACR,MAAM,EAAE,GAAG;IACX,IAAI,EAAE,GAAG;CACD,CAAC;AAEX,8CAA8C;AAC9C,MAAM,eAAe,GAA2B;IAC9C,KAAK,EAAE,GAAG;IACV,MAAM,EAAE,GAAG;IACX,KAAK,EAAE,GAAG;CACX,CAAC;AAEF,+EAA+E;AAC/E,eAAe;AACf,+EAA+E;AAE/E;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,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,CAAC;YACZ,UAAU,EAAE,CAAC;YACb,OAAO,EAAE,EAAE;YACX,cAAc,EAAE,QAAQ,MAAM,kCAAkC;SACjE,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,+DAA+D;IAC/D,MAAM,gBAAgB,GAAG,MAAM,uBAAuB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAC3E,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAC/B,UAAU,IAAI,CAAC,CAAC;IAEhB,4DAA4D;IAC5D,MAAM,gBAAgB,GAAG,MAAM,8BAA8B,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACnF,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAC/B,IAAI,gBAAgB,CAAC,KAAK,GAAG,CAAC;QAAE,UAAU,IAAI,CAAC,CAAC;IAEhD,4DAA4D;IAC5D,MAAM,cAAc,GAAG,MAAM,qBAAqB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACvE,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC7B,UAAU,IAAI,CAAC,CAAC;IAEhB,6BAA6B;IAC7B,MAAM,WAAW,GAAG,MAAM,4BAA4B,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAC3E,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC1B,UAAU,IAAI,CAAC,CAAC;IAEhB,mCAAmC;IACnC,MAAM,SAAS,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAEhD,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAEjE,MAAM,cAAc,GAAG,sBAAsB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAElE,OAAO;QACL,MAAM;QACN,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI;QAC9C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,IAAI;QAChD,OAAO;QACP,cAAc;KACf,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,gCAAgC;AAChC,+EAA+E;AAE/E;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,MAAc,EACd,KAAa,EACb,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,KAAK;YACL,cAAc,EAAE,CAAC;YACjB,QAAQ,EAAE,CAAC,QAAQ,MAAM,YAAY,CAAC;YACtC,WAAW,EAAE,EAAE;SAChB,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,mCAAmC;IACnC,MAAM,YAAY,GAAG,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACnD,WAAW,IAAI,YAAY,CAAC,IAAI,CAAC;IACjC,WAAW,IAAI,YAAY,CAAC,IAAI,CAAC;IACjC,YAAY,IAAI,YAAY,CAAC,KAAK,CAAC;IACnC,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACxC,WAAW,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;IAE9C,6CAA6C;IAC7C,MAAM,cAAc,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;IACtD,WAAW,IAAI,cAAc,CAAC,IAAI,CAAC;IACnC,WAAW,IAAI,cAAc,CAAC,IAAI,CAAC;IACnC,YAAY,IAAI,cAAc,CAAC,KAAK,CAAC;IACrC,QAAQ,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC1C,WAAW,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;IAEhD,4DAA4D;IAC5D,MAAM,aAAa,GAAG,MAAM,wBAAwB,CAAC,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;IACjF,WAAW,IAAI,aAAa,CAAC,IAAI,CAAC;IAClC,WAAW,IAAI,aAAa,CAAC,IAAI,CAAC;IAClC,YAAY,IAAI,aAAa,CAAC,KAAK,CAAC;IACpC,WAAW,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;IAE/C,sDAAsD;IACtD,MAAM,eAAe,GAAG,MAAM,qBAAqB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACzE,IAAI,eAAe,CAAC,eAAe,GAAG,CAAC,EAAE,CAAC;QACxC,WAAW,IAAI,eAAe,CAAC,iBAAiB,CAAC;QACjD,YAAY,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,0BAA0B;IAC1B,MAAM,cAAc,GAClB,YAAY,GAAG,CAAC;QACd,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,CAAC,WAAW,GAAG,WAAW,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;QAC5E,CAAC,CAAC,GAAG,CAAC;IAEV,OAAO;QACL,MAAM;QACN,KAAK;QACL,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QACxD,QAAQ;QACR,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,oCAAoC;AACpC,+EAA+E;AAE/E,KAAK,UAAU,uBAAuB,CAAC,IAAU,EAAE,QAAsB;IACvE,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC;IAC3C,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,IAAI,CAAC;QACH,UAAU,GAAG,MAAM,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrD,CAAC;IAAC,MAAM,CAAC;QACP,sDAAsD;IACxD,CAAC;IAED,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC;IAChE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;IACnD,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;IAEvD,MAAM,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,aAAa,GAAG,GAAG,GAAG,eAAe,GAAG,GAAG,CAAC;IAE5E,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,IAAI,CAAC,IAAI;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/C,IAAI,QAAQ,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,eAAe,CAAC,CAAC;IACzD,IAAI,UAAU,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,WAAW,CAAC,CAAC;IAEzD,OAAO;QACL,IAAI,EAAE,YAAY;QAClB,MAAM,EAAE,YAAY,CAAC,UAAU;QAC/B,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI;QACtC,WAAW,EACT,KAAK,CAAC,MAAM,GAAG,CAAC;YACd,CAAC,CAAC,4BAA4B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAChD,CAAC,CAAC,iDAAiD;KACxD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,8BAA8B,CAC3C,IAAU,EACV,aAAgC;IAEhC,0DAA0D;IAC1D,MAAM,eAAe,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACzF,MAAM,eAAe,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IAEzF,MAAM,mBAAmB,GAAG,CAAC,GAAG,eAAe,EAAE,GAAG,eAAe,CAAC,CAAC;IAErE,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrC,OAAO;YACL,IAAI,EAAE,oBAAoB;YAC1B,MAAM,EAAE,YAAY,CAAC,iBAAiB;YACtC,KAAK,EAAE,CAAC;YACR,WAAW,EAAE,kDAAkD;SAChE,CAAC;IACJ,CAAC;IAED,2DAA2D;IAC3D,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,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;IAC3C,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAExD,KAAK,MAAM,CAAC,IAAI,mBAAmB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAE5C,qDAAqD;QACrD,MAAM,aAAa,GACjB,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,aAAa,GACjB,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAClF,MAAM,YAAY,GAChB,QAAQ,CAAC,MAAM,GAAG,EAAE;YACpB,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAE/F,IAAI,aAAa,IAAI,aAAa,IAAI,YAAY,EAAE,CAAC;YACnD,UAAU,EAAE,CAAC;YACb,iDAAiD;YACjD,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,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO;YACL,IAAI,EAAE,oBAAoB;YAC1B,MAAM,EAAE,YAAY,CAAC,iBAAiB;YACtC,KAAK,EAAE,CAAC;YACR,WAAW,EAAE,uDAAuD;SACrE,CAAC;IACJ,CAAC;IAED,MAAM,cAAc,GAAG,gBAAgB,GAAG,UAAU,CAAC;IAErD,OAAO;QACL,IAAI,EAAE,oBAAoB;QAC1B,MAAM,EAAE,YAAY,CAAC,iBAAiB;QACtC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,IAAI;QAC/C,WAAW,EAAE,GAAG,UAAU,8DAA8D,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC,GAAG;KAC5H,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,qBAAqB,CAAC,IAAU,EAAE,QAAsB;IACrE,+EAA+E;IAC/E,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,IAAI,CAAC;QACH,kEAAkE;QAClE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC;YACpD,MAAM,EAAE,CAAC,SAAS,EAAE,QAAQ,EAAE,SAAS,CAAC;SACzC,CAAC,CAAC;QAEH,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjC,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,gDAAgD;IAClD,CAAC;IAED,6CAA6C;IAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAE9C,OAAO;QACL,IAAI,EAAE,eAAe;QACrB,MAAM,EAAE,YAAY,CAAC,YAAY;QACjC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI;QACtC,WAAW,EACT,YAAY,GAAG,CAAC;YACd,CAAC,CAAC,oBAAoB,YAAY,gBAAgB;YAClD,CAAC,CAAC,0CAA0C;KACjD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,4BAA4B,CACzC,IAAU,EACV,QAAsB;IAEtB,6CAA6C;IAC7C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,OAAO,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACnE,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,MAAM,CAAC,cAAc;QAChD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,CAAC,OAAO;YAAE,MAAM;QAEpB,KAAK,EAAE,CAAC;QACR,OAAO,GAAG,OAAO,CAAC;IACpB,CAAC;IAED,sCAAsC;IACtC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC7B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IAEzC,OAAO,QAAQ,IAAI,cAAc,GAAG,EAAE,EAAE,CAAC;QACvC,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,MAAM;QACxC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE7B,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM;YAAE,MAAM;QAEnB,cAAc,EAAE,CAAC;QACjB,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;IAC7B,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,GAAG,cAAc,CAAC;IAC1C,yCAAyC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAE5C,OAAO;QACL,IAAI,EAAE,kBAAkB;QACxB,MAAM,EAAE,YAAY,CAAC,eAAe;QACpC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI;QACtC,WAAW,EAAE,2BAA2B,KAAK,sBAAsB,cAAc,EAAE;KACpF,CAAC;AACJ,CAAC;AAcD,SAAS,gBAAgB,CAAC,IAAU,EAAE,KAAa;IACjD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,CAAC;QACV,QAAQ,CAAC,IAAI,CAAC,4BAA4B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACzF,WAAW,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;IAChF,CAAC;SAAM,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,CAAC;QACV,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACrC,CAAC;SAAM,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,CAAC;IACZ,CAAC;SAAM,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QACpC,yEAAyE;QACzE,IAAI,KAAK,KAAK,cAAc,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACpD,IAAI,IAAI,GAAG,CAAC;YACZ,WAAW,CAAC,IAAI,CAAC,mCAAmC,KAAK,OAAO,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,GAAG,CAAC;QACd,CAAC;IACH,CAAC;SAAM,CAAC;QACN,cAAc;QACd,IAAI,KAAK,KAAK,eAAe,EAAE,CAAC;YAC9B,IAAI,IAAI,GAAG,CAAC;QACd,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,GAAG,CAAC;YACZ,WAAW,CAAC,IAAI,CACd,qBAAqB,IAAI,CAAC,MAAM,uCAAuC,KAAK,OAAO,CACpF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC;AACzD,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAU;IAC1C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;IAEvC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,IAAI,EAAE,GAAG;YACT,IAAI,EAAE,GAAG;YACT,KAAK,EAAE,CAAC;YACR,QAAQ,EAAE,EAAE;YACZ,WAAW,EAAE,CAAC,0DAA0D,CAAC;SAC1E,CAAC;IACJ,CAAC;IAED,kDAAkD;IAClD,OAAO;QACL,IAAI,EAAE,GAAG;QACT,IAAI,EAAE,CAAC;QACP,KAAK,EAAE,CAAC;QACR,QAAQ;QACR,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,wBAAwB,CACrC,IAAU,EACV,KAAa,EACb,aAAgC;IAEhC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,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,EAAE,EAAE,CAAC,CAAC;IAEzF,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;QACrD,MAAM,UAAU,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,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,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhC,IAAI,UAAU,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;YAC3C,KAAK,EAAE,CAAC;YACR,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,IAAI,CAAC,CAAC,WAAW,IAAI,GAAG,EAAE,CAAC;gBACnD,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,IAAI,IAAI,GAAG,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,MAAM,eAAe,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IAEzF,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;QACrD,MAAM,UAAU,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,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,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhC,IAAI,UAAU,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;YAC3C,KAAK,EAAE,CAAC;YACR,IAAI,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;YACzD,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBACjB,WAAW,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;YACnE,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;IACnE,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;AAC1D,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,IAAU,EACV,aAAgC;IAEhC,MAAM,SAAS,GAAG,MAAM,aAAa,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IAEpE,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,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACxC,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QAEtC,6BAA6B;QAC7B,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YACtF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,yBAAyB;QACzB,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACpF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,4BAA4B;QAC5B,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,mBAAmB,IAAI,IAAI,CAAa,CAAC;QAC9E,IAAI,IAAI,CAAC,IAAI,IAAI,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,6DAA6D;QAC7D,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtE,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC7E,MAAM,iBAAiB,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;IAEtE,OAAO;QACL,UAAU;QACV,iBAAiB,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,GAAG,IAAI;QAC9D,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,8BAA8B;AAC9B,+EAA+E;AAE/E,SAAS,oBAAoB,CAAC,OAAqB;IACjD,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,WAAW,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;QAClC,WAAW,IAAI,CAAC,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAa,EAAE,OAAqB;IAClE,IAAI,KAAK,IAAI,eAAe,CAAC,GAAG,EAAE,CAAC;QACjC,OAAO,yCAAyC,CAAC;IACnD,CAAC;IAED,IAAI,KAAK,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,OAAO;aACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC;aAC5B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;aACvD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEf,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,OAAO,kBAAkB,WAAW,4CAA4C,CAAC;IACnF,CAAC;IAED,IAAI,KAAK,IAAI,eAAe,CAAC,IAAI,EAAE,CAAC;QAClC,OAAO,2FAA2F,CAAC;IACrG,CAAC;IAED,OAAO,wGAAwG,CAAC;AAClH,CAAC"}

package/dist/intelligence/types.js

@@ -1,13 +0,0 @@
-/**
- * Type definitions for the CLEO Intelligence dimension.
- *
- * Covers quality prediction (risk scoring, validation outcome prediction),
- * pattern extraction (automatic detection, matching, storage), and
- * impact analysis (blast radius, change prediction).
- *
- * @task Wave3A
- * @epic T5149
- * @module intelligence
- */
-export {};
-//# sourceMappingURL=types.js.map

package/dist/intelligence/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/intelligence/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG"}