debtmap 0.16.5

use syn::{visit::Visit, Expr, Item};

/// Modern pattern complexity detection
#[derive(Debug, Clone, Default)]
pub struct PatternComplexity {
    pub async_await_count: u32,
    pub callback_depth: u32,
    pub promise_chains: u32,
    pub higher_order_functions: u32,
    pub functional_composition: u32,
    pub nested_ternaries: u32,
    pub method_chain_length: u32,
    pub recursive_calls: u32,
    pub error_handling_blocks: u32,
    pub generic_complexity: u32,
    pub unsafe_blocks: u32,
}

impl PatternComplexity {
    pub fn total_complexity(&self) -> u32 {
        self.async_await_count * 2
            + self.callback_depth * 3
            + self.promise_chains * 2
            + self.higher_order_functions
            + self.functional_composition
            + self.nested_ternaries * 2
            + (self.method_chain_length / 3)
            + self.recursive_calls * 3
            + self.error_handling_blocks
            + self.generic_complexity
            + self.unsafe_blocks * 2
    }

    pub fn merge(&mut self, other: &PatternComplexity) {
        self.async_await_count += other.async_await_count;
        self.callback_depth = self.callback_depth.max(other.callback_depth);
        self.promise_chains += other.promise_chains;
        self.higher_order_functions += other.higher_order_functions;
        self.functional_composition += other.functional_composition;
        self.nested_ternaries += other.nested_ternaries;
        self.method_chain_length = self.method_chain_length.max(other.method_chain_length);
        self.recursive_calls += other.recursive_calls;
        self.error_handling_blocks += other.error_handling_blocks;
        self.generic_complexity += other.generic_complexity;
        self.unsafe_blocks += other.unsafe_blocks;
    }
}

pub struct PatternDetector {
    pub patterns: PatternComplexity,
    current_function_name: Option<String>,
    closure_depth: u32,
    ternary_depth: u32,
}

impl Default for PatternDetector {
    fn default() -> Self {
        Self::new()
    }
}

impl PatternDetector {
    pub fn new() -> Self {
        Self {
            patterns: PatternComplexity::default(),
            current_function_name: None,
            closure_depth: 0,
            ternary_depth: 0,
        }
    }

    pub fn analyze_item(&mut self, item: &Item) {
        self.visit_item(item);
    }

    pub fn analyze_expr(&mut self, expr: &Expr) {
        self.visit_expr(expr);
    }

    fn detect_async_pattern(&mut self, sig: &syn::Signature) {
        if sig.asyncness.is_some() {
            self.patterns.async_await_count += 1;
        }

        // Count generic type parameters as complexity
        let generic_count = sig.generics.params.len() as u32;
        if generic_count > 0 {
            self.patterns.generic_complexity += generic_count;
        }
    }

    fn detect_method_chain(&mut self, expr: &Expr) -> u32 {
        let mut chain_length = 0;
        let mut current = expr;

        loop {
            match current {
                Expr::MethodCall(method) => {
                    chain_length += 1;
                    current = &method.receiver;
                }
                Expr::Field(field) => {
                    chain_length += 1;
                    current = &field.base;
                }
                _ => break,
            }
        }

        chain_length
    }

    fn is_higher_order_function(&self, expr: &Expr) -> bool {
        match expr {
            Expr::MethodCall(method) => {
                let method_name = method.method.to_string();
                matches!(
                    method_name.as_str(),
                    "map"
                        | "filter"
                        | "fold"
                        | "reduce"
                        | "flat_map"
                        | "filter_map"
                        | "and_then"
                        | "or_else"
                        | "map_or"
                        | "map_or_else"
                )
            }
            _ => false,
        }
    }

    fn detect_functional_composition(&mut self, expr: &Expr) {
        if let Expr::MethodCall(method) = expr {
            if self.is_higher_order_function(expr) {
                self.patterns.higher_order_functions += 1;

                // Check if it's part of a chain
                if let Expr::MethodCall(_) = &*method.receiver {
                    self.patterns.functional_composition += 1;
                }
            }
        }
    }

    fn handle_await_expr(&mut self) {
        self.patterns.async_await_count += 1;
    }

    fn handle_closure_expr(&mut self, closure: &syn::ExprClosure) {
        self.closure_depth += 1;
        if closure.asyncness.is_some() {
            self.patterns.async_await_count += 1;
        }
        syn::visit::visit_expr_closure(self, closure);
        self.closure_depth -= 1;
    }

    fn handle_method_call_expr(&mut self, expr: &Expr) {
        let chain_length = self.detect_method_chain(expr);
        if chain_length > 2 {
            self.patterns.method_chain_length = self.patterns.method_chain_length.max(chain_length);
        }

        self.detect_functional_composition(expr);
        self.check_recursive_method_call(expr);
        syn::visit::visit_expr(self, expr);
    }

    fn check_recursive_method_call(&mut self, expr: &Expr) {
        if let Some(ref func_name) = self.current_function_name {
            if let Expr::MethodCall(method) = expr {
                if method.method == func_name {
                    self.patterns.recursive_calls += 1;
                }
            }
        }
    }

    fn handle_if_expr(&mut self, if_expr: &syn::ExprIf) {
        let is_ternary = if_expr.else_branch.is_some()
            && if_expr.then_branch.stmts.len() == 1
            && matches!(&if_expr.then_branch.stmts[0], syn::Stmt::Expr(_, None));

        if is_ternary {
            self.ternary_depth += 1;
            if self.ternary_depth > 1 {
                self.patterns.nested_ternaries += 1;
            }
            syn::visit::visit_expr_if(self, if_expr);
            self.ternary_depth -= 1;
        } else {
            syn::visit::visit_expr_if(self, if_expr);
        }
    }

    fn handle_unsafe_expr(&mut self, expr: &Expr) {
        self.patterns.unsafe_blocks += 1;
        syn::visit::visit_expr(self, expr);
    }

    fn handle_call_expr(&mut self, call: &syn::ExprCall) {
        self.check_recursive_function_call(call);
        syn::visit::visit_expr_call(self, call);
    }

    fn check_recursive_function_call(&mut self, call: &syn::ExprCall) {
        if let Some(ref func_name) = self.current_function_name {
            if Self::is_recursive_call(&call.func, func_name) {
                self.patterns.recursive_calls += 1;
            }
        }
    }

    /// Check if the expression is a direct path call to the given function name
    fn is_recursive_call(func_expr: &Expr, func_name: &str) -> bool {
        match func_expr {
            Expr::Path(path) => Self::path_matches_function(&path.path, func_name),
            _ => false,
        }
    }

    /// Check if a path's last segment matches the given function name
    fn path_matches_function(path: &syn::Path, func_name: &str) -> bool {
        path.segments
            .last()
            .map(|segment| segment.ident == func_name)
            .unwrap_or(false)
    }
}

impl<'ast> Visit<'ast> for PatternDetector {
    fn visit_item_fn(&mut self, node: &'ast syn::ItemFn) {
        let old_name = self.current_function_name.clone();
        self.current_function_name = Some(node.sig.ident.to_string());

        self.detect_async_pattern(&node.sig);
        syn::visit::visit_item_fn(self, node);

        self.current_function_name = old_name;
    }

    fn visit_impl_item_fn(&mut self, node: &'ast syn::ImplItemFn) {
        let old_name = self.current_function_name.clone();
        self.current_function_name = Some(node.sig.ident.to_string());

        self.detect_async_pattern(&node.sig);
        syn::visit::visit_impl_item_fn(self, node);

        self.current_function_name = old_name;
    }

    fn visit_expr(&mut self, expr: &'ast Expr) {
        match expr {
            Expr::Await(_) => self.handle_await_expr(),
            Expr::Closure(closure) => self.handle_closure_expr(closure),
            Expr::MethodCall(_) => self.handle_method_call_expr(expr),
            Expr::If(if_expr) => self.handle_if_expr(if_expr),
            Expr::Try(_) => syn::visit::visit_expr(self, expr),
            Expr::Unsafe(_) => self.handle_unsafe_expr(expr),
            Expr::Call(call) => self.handle_call_expr(call),
            _ => syn::visit::visit_expr(self, expr),
        }
    }
}

/// Calculate pattern-based complexity for a function
pub fn analyze_patterns(block: &syn::Block) -> PatternComplexity {
    let mut detector = PatternDetector::new();
    detector.visit_block(block);
    detector.patterns
}

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

    #[test]
    fn test_pattern_complexity_total() {
        let patterns = PatternComplexity {
            async_await_count: 2,
            callback_depth: 1,
            method_chain_length: 6,
            ..Default::default()
        };

        assert_eq!(patterns.total_complexity(), 2 * 2 + 3 + 6 / 3);
    }

    #[test]
    fn test_pattern_merge() {
        let mut p1 = PatternComplexity {
            async_await_count: 1,
            callback_depth: 2,
            ..Default::default()
        };

        let p2 = PatternComplexity {
            async_await_count: 2,
            callback_depth: 3,
            ..Default::default()
        };

        p1.merge(&p2);
        assert_eq!(p1.async_await_count, 3);
        assert_eq!(p1.callback_depth, 3);
    }

    #[test]
    fn test_detect_method_chain_simple() {
        let code = r#"
            fn example() {
                foo.bar().baz().qux();
            }
        "#;

        let file = syn::parse_file(code).unwrap();
        let mut detector = PatternDetector::default();

        // Visit the AST to detect patterns
        detector.visit_file(&file);

        // Method chain of length 3 should be detected
        assert!(detector.patterns.method_chain_length >= 3);
    }

    #[test]
    fn test_detect_method_chain_no_crash_on_fields() {
        // Test that field accesses don't crash the detector
        // Note: Currently field-only chains aren't tracked by the visitor
        let code = r#"
            fn example() {
                let value = obj.field1.field2.field3;
            }
        "#;

        let file = syn::parse_file(code).unwrap();
        let mut detector = PatternDetector::default();

        // Visit the AST to detect patterns - should not panic
        detector.visit_file(&file);

        // Field-only chains currently aren't detected since visit_expr doesn't handle Expr::Field
        // This test ensures the detector doesn't crash on field expressions
        assert_eq!(detector.patterns.method_chain_length, 0);
    }

    #[test]
    fn test_detect_method_chain_mixed() {
        let code = r#"
            fn example() {
                let result = obj.field.method().another_field.final_method();
            }
        "#;

        let file = syn::parse_file(code).unwrap();
        let mut detector = PatternDetector::default();

        // Visit the AST to detect patterns
        detector.visit_file(&file);

        // Mixed chain of length 4 should be detected
        assert!(detector.patterns.method_chain_length >= 4);
    }

    #[test]
    fn test_detect_method_chain_single_expr() {
        let code = r#"
            fn example() {
                let x = simple_var;
                let y = function_call();
            }
        "#;

        let file = syn::parse_file(code).unwrap();
        let mut detector = PatternDetector::default();

        // Visit the AST to detect patterns
        detector.visit_file(&file);

        // No significant chain should be detected (chain length 0 or 1)
        assert!(detector.patterns.method_chain_length <= 1);
    }

    #[test]
    fn test_detect_method_chain_direct_call() {
        // Test the detect_method_chain function directly to ensure full coverage
        use syn::parse_quote;

        let mut detector = PatternDetector::default();

        // Test with a method chain
        let method_chain: Expr = parse_quote!(foo.bar().baz().qux());
        let length = detector.detect_method_chain(&method_chain);
        assert_eq!(length, 3);

        // Test with field accesses
        let field_chain: Expr = parse_quote!(obj.field1.field2);
        let field_length = detector.detect_method_chain(&field_chain);
        assert_eq!(field_length, 2);

        // Test with a simple identifier (no chain)
        let simple: Expr = parse_quote!(variable);
        let simple_length = detector.detect_method_chain(&simple);
        assert_eq!(simple_length, 0);

        // Test with mixed method and field
        let mixed: Expr = parse_quote!(obj.field.method());
        let mixed_length = detector.detect_method_chain(&mixed);
        assert_eq!(mixed_length, 2);
    }

    #[test]
    fn test_path_matches_function() {
        use syn::parse_quote;

        // Test matching function name
        let path: syn::Path = parse_quote!(my_function);
        assert!(PatternDetector::path_matches_function(&path, "my_function"));
        assert!(!PatternDetector::path_matches_function(
            &path,
            "other_function"
        ));

        // Test with qualified path
        let qualified_path: syn::Path = parse_quote!(module::my_function);
        assert!(PatternDetector::path_matches_function(
            &qualified_path,
            "my_function"
        ));
        assert!(!PatternDetector::path_matches_function(
            &qualified_path,
            "module"
        ));

        // Test with deeply nested path
        let nested_path: syn::Path = parse_quote!(crate::module::submodule::func);
        assert!(PatternDetector::path_matches_function(&nested_path, "func"));
        assert!(!PatternDetector::path_matches_function(
            &nested_path,
            "submodule"
        ));
    }

    #[test]
    fn test_is_recursive_call() {
        use syn::parse_quote;

        // Test direct function call
        let direct_call: Expr = parse_quote!(my_function);
        assert!(PatternDetector::is_recursive_call(
            &direct_call,
            "my_function"
        ));
        assert!(!PatternDetector::is_recursive_call(
            &direct_call,
            "other_function"
        ));

        // Test qualified function call
        let qualified_call: Expr = parse_quote!(Self::my_function);
        assert!(PatternDetector::is_recursive_call(
            &qualified_call,
            "my_function"
        ));

        // Test non-path expression (should return false)
        let method_call: Expr = parse_quote!(obj.method());
        assert!(!PatternDetector::is_recursive_call(&method_call, "method"));

        // Test literal expression (should return false)
        let literal: Expr = parse_quote!(42);
        assert!(!PatternDetector::is_recursive_call(&literal, "any_name"));
    }

    #[test]
    fn test_check_recursive_function_call() {
        use syn::parse_quote;

        // Create a detector with a current function name
        let mut detector = PatternDetector {
            current_function_name: Some("factorial".to_string()),
            ..Default::default()
        };

        // Test recursive call detection
        let recursive_call: syn::ExprCall = parse_quote!(factorial(n - 1));
        detector.check_recursive_function_call(&recursive_call);
        assert_eq!(detector.patterns.recursive_calls, 1);

        // Test non-recursive call
        let non_recursive_call: syn::ExprCall = parse_quote!(helper_function(x));
        detector.check_recursive_function_call(&non_recursive_call);
        assert_eq!(detector.patterns.recursive_calls, 1); // Should still be 1

        // Test with qualified recursive call
        let qualified_recursive: syn::ExprCall = parse_quote!(Self::factorial(n - 1));
        detector.check_recursive_function_call(&qualified_recursive);
        assert_eq!(detector.patterns.recursive_calls, 2);
    }

    #[test]
    fn test_recursive_detection_without_current_function() {
        // No current function name set
        let mut detector = PatternDetector {
            current_function_name: None,
            ..Default::default()
        };

        let call: syn::ExprCall = syn::parse_quote!(some_function(x));
        detector.check_recursive_function_call(&call);

        // Should not increment recursive_calls when there's no current function
        assert_eq!(detector.patterns.recursive_calls, 0);
    }
}