debtmap 0.16.3

Code complexity and technical debt analyzer
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146

use crate::core::{FileMetrics, FunctionMetrics};
use crate::refactoring::{
    DetectedPattern, PatternAssessment, PatternEvidence, PatternMatcher, PatternType,
};

pub struct MapPatternMatcher;

impl PatternMatcher for MapPatternMatcher {
    fn match_pattern(
        &self,
        function: &FunctionMetrics,
        _file: &FileMetrics,
    ) -> Option<DetectedPattern> {
        if function.name.contains("map") || function.name.contains("transform") {
            Some(DetectedPattern {
                pattern_type: PatternType::FunctionalComposition,
                confidence: 0.9,
                evidence: PatternEvidence {
                    code_snippets: vec![],
                    line_numbers: vec![function.line as u32],
                    confidence_factors: vec![
                        "Function uses map pattern for transformation".to_string()
                    ],
                },
                assessment: PatternAssessment::GoodExample {
                    strengths: vec![
                        "Declarative transformation pattern".to_string(),
                        "Immutable data processing".to_string(),
                        "Easily testable and composable".to_string(),
                    ],
                    why_good: "Map patterns are functional programming best practices".to_string(),
                },
            })
        } else {
            None
        }
    }
}

pub struct FilterPatternMatcher;

impl PatternMatcher for FilterPatternMatcher {
    fn match_pattern(
        &self,
        function: &FunctionMetrics,
        _file: &FileMetrics,
    ) -> Option<DetectedPattern> {
        if function.name.contains("filter") || function.name.contains("select") {
            Some(DetectedPattern {
                pattern_type: PatternType::FunctionalComposition,
                confidence: 0.9,
                evidence: PatternEvidence {
                    code_snippets: vec![],
                    line_numbers: vec![function.line as u32],
                    confidence_factors: vec![
                        "Function uses filter pattern for selection".to_string()
                    ],
                },
                assessment: PatternAssessment::GoodExample {
                    strengths: vec![
                        "Declarative filtering logic".to_string(),
                        "Pure predicate function".to_string(),
                        "Composable with other functional patterns".to_string(),
                    ],
                    why_good: "Filter patterns promote clean, testable code".to_string(),
                },
            })
        } else {
            None
        }
    }
}

pub struct FoldPatternMatcher;

impl PatternMatcher for FoldPatternMatcher {
    fn match_pattern(
        &self,
        function: &FunctionMetrics,
        _file: &FileMetrics,
    ) -> Option<DetectedPattern> {
        if function.name.contains("fold")
            || function.name.contains("reduce")
            || function.name.contains("aggregate")
        {
            Some(DetectedPattern {
                pattern_type: PatternType::FunctionalComposition,
                confidence: 0.9,
                evidence: PatternEvidence {
                    code_snippets: vec![],
                    line_numbers: vec![function.line as u32],
                    confidence_factors: vec![
                        "Function uses fold/reduce pattern for aggregation".to_string()
                    ],
                },
                assessment: PatternAssessment::GoodExample {
                    strengths: vec![
                        "Functional aggregation pattern".to_string(),
                        "No mutable accumulator needed".to_string(),
                        "Clear data flow and transformation".to_string(),
                    ],
                    why_good: "Fold patterns eliminate mutable state in aggregations".to_string(),
                },
            })
        } else {
            None
        }
    }
}

pub struct PipelinePatternMatcher;

impl PatternMatcher for PipelinePatternMatcher {
    fn match_pattern(
        &self,
        function: &FunctionMetrics,
        _file: &FileMetrics,
    ) -> Option<DetectedPattern> {
        if function.name.contains("pipeline")
            || function.name.contains("chain")
            || function.name.contains("compose")
        {
            Some(DetectedPattern {
                pattern_type: PatternType::FunctionalComposition,
                confidence: 0.85,
                evidence: PatternEvidence {
                    code_snippets: vec![],
                    line_numbers: vec![function.line as u32],
                    confidence_factors: vec![
                        "Function uses pipeline/composition pattern".to_string()
                    ],
                },
                assessment: PatternAssessment::GoodExample {
                    strengths: vec![
                        "Clear data transformation pipeline".to_string(),
                        "Composable function chain".to_string(),
                        "Easy to understand data flow".to_string(),
                    ],
                    why_good: "Pipeline patterns make complex transformations readable".to_string(),
                },
            })
        } else {
            None
        }
    }
}