debtmap 0.16.3

//! Computation module - Pure functions for calculating metrics and impacts
//!
//! This module contains all pure computation functions for calculating various metrics,
//! scores, and expected impacts. All functions in this module should be pure (no side effects)
//! and easy to test independently.

use crate::complexity::EntropyAnalysis;
use crate::core::FunctionMetrics;
use crate::priority::{DebtType, ImpactMetrics, UnifiedScore};

/// Calculate entropy analysis from FunctionMetrics.
/// Pure function - transforms function metrics into unified entropy analysis.
///
/// Note: Entropy dampening only applies to cognitive complexity, not cyclomatic.
/// Cyclomatic complexity is a structural metric (number of execution paths) that
/// doesn't change based on pattern repetition. Cognitive complexity is a perceptual
/// metric (how hard to understand) that is reduced by repetitive patterns.
pub fn calculate_entropy_analysis(func: &FunctionMetrics) -> Option<EntropyAnalysis> {
    func.entropy_score.as_ref().map(|entropy_score| {
        // Only apply dampening for LOW entropy (repetitive patterns)
        // High entropy indicates real complexity that shouldn't be dampened
        // Threshold: entropy < 0.4 indicates significant repetition
        let is_repetitive = entropy_score.token_entropy < 0.4;

        let dampening_factor = if is_repetitive {
            // Use pattern_repetition to determine dampening amount
            // High repetition (close to 1.0) = more dampening (lower factor)
            // pattern_repetition of 0.5+ means significant repetition
            let repetition_dampening = 1.0 - (entropy_score.pattern_repetition * 0.5);
            repetition_dampening.clamp(0.5, 1.0)
        } else {
            // High entropy = no dampening, complexity is real
            1.0
        };

        // Only apply dampening to cognitive complexity (perceptual metric)
        // NOT to cyclomatic complexity (structural metric - path count doesn't change)
        let adjusted_cognitive = (func.cognitive as f64 * dampening_factor) as u32;

        // Build reasoning for why dampening was applied
        let mut reasoning = Vec::new();
        if entropy_score.pattern_repetition > 0.6 {
            reasoning.push(format!(
                "High pattern repetition detected ({}%)",
                (entropy_score.pattern_repetition * 100.0) as i32
            ));
        }
        if entropy_score.token_entropy < 0.4 {
            reasoning.push(format!(
                "Low token entropy indicates simple patterns ({:.2})",
                entropy_score.token_entropy
            ));
        }
        if entropy_score.branch_similarity > 0.7 {
            reasoning.push(format!(
                "Similar branch structures found ({}% similarity)",
                (entropy_score.branch_similarity * 100.0) as i32
            ));
        }
        if dampening_factor < 1.0 {
            let reduction_pct = ((1.0 - dampening_factor) * 100.0) as i32;
            reasoning.push(format!(
                "Complexity reduced by {}% due to pattern-based code",
                reduction_pct
            ));
        } else {
            reasoning.push("Genuine complexity detected - no reduction applied".to_string());
        }

        EntropyAnalysis {
            entropy_score: entropy_score.token_entropy,
            pattern_repetition: entropy_score.pattern_repetition,
            branch_similarity: entropy_score.branch_similarity,
            dampening_factor,
            dampening_was_applied: dampening_factor < 1.0,
            original_complexity: func.cognitive,
            adjusted_complexity: adjusted_cognitive,
            reasoning,
        }
    })
}

/// Pure function - determines if a function is considered complex
pub(super) fn is_function_complex(cyclomatic: u32, cognitive: u32) -> bool {
    cyclomatic > 10 || cognitive > 15
}

/// Pure function - calculates the risk reduction factor based on debt type
pub(super) fn calculate_risk_factor(debt_type: &DebtType) -> f64 {
    match debt_type {
        DebtType::TestingGap { .. } => 0.42,
        DebtType::ComplexityHotspot { .. } => 0.35,
        DebtType::ErrorSwallowing { .. } => 0.35, // High risk - can hide critical failures
        DebtType::DeadCode { .. } => 0.3,
        DebtType::Duplication { .. } => 0.25,
        DebtType::Risk { .. } => 0.2,
        DebtType::TestComplexityHotspot { .. } => 0.15,
        DebtType::TestTodo { .. } | DebtType::TestDuplication { .. } => 0.1,
        // Resource Management debt types (medium risk)
        DebtType::BlockingIO { .. } => 0.45,
        DebtType::NestedLoops { .. } => 0.4,
        DebtType::AllocationInefficiency { .. } => 0.3,
        DebtType::StringConcatenation { .. } => 0.25,
        DebtType::SuboptimalDataStructure { .. } => 0.2,
        // Organization debt types (maintenance risk)
        DebtType::GodObject { .. } => 0.4,
        DebtType::FeatureEnvy { .. } => 0.25,
        DebtType::PrimitiveObsession { .. } => 0.2,
        DebtType::MagicValues { .. } => 0.15,
        // Testing quality debt types (low risk)
        DebtType::FlakyTestPattern { .. } => 0.3,
        DebtType::AssertionComplexity { .. } => 0.15,
        // Resource management debt types (medium risk)
        DebtType::ResourceLeak { .. } => 0.5,
        DebtType::AsyncMisuse { .. } => 0.4,
        DebtType::CollectionInefficiency { .. } => 0.2,
        // Type organization debt types (Spec 187) - low to medium risk
        DebtType::ScatteredType { .. } => 0.25,
        DebtType::OrphanedFunctions { .. } => 0.15,
        DebtType::UtilitiesSprawl { .. } => 0.3,
        // Default for legacy variants
        _ => 0.5,
    }
}

/// Pure function - calculates coverage improvement potential for testing gaps
pub(super) fn calculate_coverage_improvement(coverage: f64, is_complex: bool) -> f64 {
    let potential = 1.0 - coverage;
    if is_complex {
        potential * 50.0 // 50% of potential due to complexity
    } else {
        potential * 100.0 // Full coverage potential for simple functions
    }
}

/// Pure function - calculates lines that could be reduced through refactoring
pub(super) fn calculate_lines_reduction(debt_type: &DebtType) -> u32 {
    match debt_type {
        DebtType::DeadCode {
            cyclomatic,
            cognitive,
            ..
        } => *cyclomatic + *cognitive,
        DebtType::Duplication {
            instances,
            total_lines,
        }
        | DebtType::TestDuplication {
            instances,
            total_lines,
            ..
        } => *total_lines - (*total_lines / instances),
        _ => 0,
    }
}

/// Pure function - calculates complexity reduction potential based on debt type
pub(super) fn calculate_complexity_reduction(debt_type: &DebtType, is_complex: bool) -> f64 {
    match debt_type {
        DebtType::DeadCode {
            cyclomatic,
            cognitive,
            ..
        } => (*cyclomatic + *cognitive) as f64 * 0.5,
        DebtType::TestingGap { cyclomatic, .. } if is_complex => *cyclomatic as f64 * 0.3,
        DebtType::ComplexityHotspot { cyclomatic, .. } => {
            // Use raw cyclomatic - complexity reduction potential is based on structural complexity
            *cyclomatic as f64 * 0.5
        }
        DebtType::TestComplexityHotspot { cyclomatic, .. } => *cyclomatic as f64 * 0.3,
        // Organization debt types - significant complexity reduction potential
        DebtType::GodObject {
            god_object_score, ..
        } => god_object_score * 0.4,
        DebtType::NestedLoops { depth, .. } => (*depth as f64).powf(2.0) * 0.3, // Quadratic impact
        DebtType::FeatureEnvy { .. } => 2.0, // Modest improvement
        _ => 0.0,
    }
}

/// Pure function - calculates expected impact metrics for addressing technical debt
/// Composes other pure calculation functions to determine overall impact
pub(super) fn calculate_expected_impact(
    _func: &FunctionMetrics,
    debt_type: &DebtType,
    score: &UnifiedScore,
) -> ImpactMetrics {
    let risk_factor = calculate_risk_factor(debt_type);
    let risk_reduction = score.final_score * risk_factor;

    let (coverage_improvement, lines_reduction, complexity_reduction) = match debt_type {
        DebtType::TestingGap {
            coverage,
            cyclomatic,
            cognitive,
        } => {
            let is_complex = is_function_complex(*cyclomatic, *cognitive);
            (
                calculate_coverage_improvement(*coverage, is_complex),
                0,
                calculate_complexity_reduction(debt_type, is_complex),
            )
        }
        _ => (
            0.0,
            calculate_lines_reduction(debt_type),
            calculate_complexity_reduction(debt_type, false),
        ),
    };

    ImpactMetrics {
        coverage_improvement,
        lines_reduction,
        complexity_reduction,
        risk_reduction,
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_is_function_complex() {
        assert!(!is_function_complex(5, 8));
        assert!(is_function_complex(15, 8));
        assert!(is_function_complex(8, 20));
        assert!(is_function_complex(15, 20));
    }

    #[test]
    fn test_calculate_coverage_improvement_simple() {
        let improvement = calculate_coverage_improvement(0.5, false);
        assert!((improvement - 50.0).abs() < 0.01);
    }

    #[test]
    fn test_calculate_coverage_improvement_complex() {
        let improvement = calculate_coverage_improvement(0.5, true);
        assert!((improvement - 25.0).abs() < 0.01);
    }

    #[test]
    fn test_calculate_risk_factor() {
        assert_eq!(
            calculate_risk_factor(&DebtType::TestingGap {
                coverage: 0.5,
                cyclomatic: 10,
                cognitive: 8
            }),
            0.42
        );
        assert_eq!(
            calculate_risk_factor(&DebtType::ComplexityHotspot {
                cyclomatic: 20,
                cognitive: 15,
            }),
            0.35
        );
        assert_eq!(
            calculate_risk_factor(&DebtType::DeadCode {
                cyclomatic: 5,
                cognitive: 3,
                visibility: crate::priority::FunctionVisibility::Private,
                usage_hints: vec![]
            }),
            0.3
        );
    }
}