kimun 0.20.0

//! Indentation complexity analysis module (Thornhill method).
//!
//! Measures the standard deviation of indentation depth per file
//! as a proxy for structural complexity. Higher stddev indicates
//! deeply nested control flow that may be hard to follow.
//! Based on Adam Thornhill's approach in "Your Code as a Crime Scene".
pub(crate) mod analyzer;
pub(crate) mod report;

use std::error::Error;
use std::path::Path;

use crate::loc::language::LanguageSpec;
use crate::util::read_and_classify;
use crate::walk::WalkConfig;
use analyzer::analyze;
use report::{FileIndentMetrics, print_json, print_report};

/// Tab width used for converting tabs to spaces in indentation calculation.
const TAB_WIDTH: usize = 4;

/// Read a file, classify lines, and compute indentation metrics.
/// Returns `None` for binary files or files with no code lines.
pub(crate) fn analyze_file(
    path: &Path,
    spec: &LanguageSpec,
) -> Result<Option<FileIndentMetrics>, Box<dyn Error>> {
    let (lines, kinds) = match read_and_classify(path, spec)? {
        Some(v) => v,
        None => return Ok(None),
    };

    let metrics = match analyze(&lines, &kinds, TAB_WIDTH) {
        Some(m) => m,
        None => return Ok(None),
    };

    Ok(Some(FileIndentMetrics {
        path: path.to_path_buf(),
        code_lines: metrics.code_lines,
        stddev: metrics.stddev,
        max_depth: metrics.max_depth,
        total_indent: metrics.total_indent,
        complexity: metrics.complexity,
    }))
}

/// Walk source files, compute indentation metrics, sort by stddev
/// descending, and print as a table or JSON.
pub fn run(cfg: &WalkConfig<'_>, json: bool) -> Result<(), Box<dyn Error>> {
    let mut results = cfg.collect_analysis(analyze_file);

    // Sort by stddev descending
    results.sort_by(|a, b| b.stddev.total_cmp(&a.stddev));

    if json {
        print_json(&results)?;
    } else {
        print_report(&results);
    }

    Ok(())
}

#[cfg(test)]
#[path = "mod_test.rs"]
mod tests;