howmany 3.0.0

A blazingly fast, intelligent code analysis tool with parallel processing, caching, and beautiful visualizations
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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
use super::types::{AggregatedStats, StatsMetadata};
use crate::core::stats::basic::BasicStats;
use crate::core::stats::complexity::ComplexityStats;
use crate::core::stats::ratios::RatioStats;
use crate::core::types::{CodeStats, FileStats};
use crate::utils::errors::{HowManyError, Result};
use std::collections::BTreeMap;

/// Handles merging of different statistics types
pub struct StatsMerger {
    version: String,
}

impl StatsMerger {
    pub fn new() -> Self {
        Self {
            version: env!("CARGO_PKG_VERSION").to_string(),
        }
    }

    /// Merge multiple aggregated statistics
    pub fn merge_stats(&self, stats_list: Vec<AggregatedStats>) -> Result<AggregatedStats> {
        if stats_list.is_empty() {
            return Err(HowManyError::invalid_config(
                "Cannot merge empty statistics list".to_string(),
            ));
        }

        if stats_list.len() == 1 {
            return Ok(stats_list.into_iter().next().unwrap());
        }

        // Merge basic stats
        let merged_basic = self.merge_basic_stats(&stats_list)?;

        // Merge complexity stats
        let merged_complexity = self.merge_complexity_stats(&stats_list)?;

        // Merge ratio stats
        let merged_ratios = self.merge_ratio_stats(&stats_list)?;

        // Create merged metadata
        let merged_metadata = self.merge_metadata(&stats_list)?;

        Ok(AggregatedStats {
            basic: merged_basic,
            complexity: merged_complexity,
            ratios: merged_ratios,
            metadata: merged_metadata,
        })
    }

    /// Merge basic statistics
    pub fn merge_basic_stats(&self, stats_list: &[AggregatedStats]) -> Result<BasicStats> {
        let mut total_files = 0;
        let mut total_lines = 0;
        let mut code_lines = 0;
        let mut comment_lines = 0;
        let mut doc_lines = 0;
        let mut blank_lines = 0;
        let mut total_size = 0;
        let mut merged_extensions = BTreeMap::new();
        let mut all_file_sizes = Vec::new();

        for stats in stats_list {
            total_files += stats.basic.total_files;
            total_lines += stats.basic.total_lines;
            code_lines += stats.basic.code_lines;
            comment_lines += stats.basic.comment_lines;
            doc_lines += stats.basic.doc_lines;
            blank_lines += stats.basic.blank_lines;
            total_size += stats.basic.total_size;

            // Merge extension stats
            for (ext, ext_stats) in &stats.basic.stats_by_extension {
                let entry = merged_extensions.entry(ext.clone()).or_insert_with(|| {
                    crate::core::stats::basic::ExtensionStats {
                        file_count: 0,
                        total_lines: 0,
                        code_lines: 0,
                        comment_lines: 0,
                        doc_lines: 0,
                        blank_lines: 0,
                        total_size: 0,
                        average_lines_per_file: 0.0,
                        average_size_per_file: 0.0,
                    }
                });

                entry.file_count += ext_stats.file_count;
                entry.total_lines += ext_stats.total_lines;
                entry.code_lines += ext_stats.code_lines;
                entry.comment_lines += ext_stats.comment_lines;
                entry.doc_lines += ext_stats.doc_lines;
                entry.blank_lines += ext_stats.blank_lines;
                entry.total_size += ext_stats.total_size;
            }

            all_file_sizes.push(stats.basic.largest_file_size);
            all_file_sizes.push(stats.basic.smallest_file_size);
        }

        // Recalculate averages for merged extensions
        for ext_stats in merged_extensions.values_mut() {
            ext_stats.average_lines_per_file = if ext_stats.file_count > 0 {
                ext_stats.total_lines as f64 / ext_stats.file_count as f64
            } else {
                0.0
            };

            ext_stats.average_size_per_file = if ext_stats.file_count > 0 {
                ext_stats.total_size as f64 / ext_stats.file_count as f64
            } else {
                0.0
            };
        }

        let largest_file_size = all_file_sizes.iter().max().copied().unwrap_or(0);
        let smallest_file_size = all_file_sizes.iter().min().copied().unwrap_or(0);

        Ok(BasicStats {
            total_files,
            total_lines,
            code_lines,
            comment_lines,
            doc_lines,
            blank_lines,
            total_size,
            average_file_size: if total_files > 0 {
                total_size as f64 / total_files as f64
            } else {
                0.0
            },
            average_lines_per_file: if total_files > 0 {
                total_lines as f64 / total_files as f64
            } else {
                0.0
            },
            largest_file_size,
            smallest_file_size,
            stats_by_extension: merged_extensions,
        })
    }

    /// Merge complexity statistics
    pub fn merge_complexity_stats(
        &self,
        stats_list: &[AggregatedStats],
    ) -> Result<ComplexityStats> {
        let mut total_functions = 0;
        let mut total_complexity = 0.0;
        let mut total_cognitive_complexity = 0.0;
        let mut total_maintainability = 0.0;
        let mut total_function_lines = 0;
        let mut max_function_length = 0;
        let mut min_function_length = usize::MAX;
        let mut max_nesting_depth = 0;
        let mut total_nesting_depth = 0.0;
        let mut total_parameters = 0;
        let mut max_parameters = 0;
        let mut merged_complexity_by_extension = BTreeMap::new();

        // Merge complexity distribution
        let mut merged_distribution = crate::core::stats::complexity::ComplexityDistribution {
            very_low_complexity: 0,
            low_complexity: 0,
            medium_complexity: 0,
            high_complexity: 0,
            very_high_complexity: 0,
        };

        for stats in stats_list {
            total_functions += stats.complexity.function_count;
            total_complexity +=
                stats.complexity.cyclomatic_complexity * stats.complexity.function_count as f64;
            total_cognitive_complexity +=
                stats.complexity.cognitive_complexity * stats.complexity.function_count as f64;
            total_maintainability +=
                stats.complexity.maintainability_index * stats.complexity.function_count as f64;
            total_function_lines += (stats.complexity.average_function_length
                * stats.complexity.function_count as f64)
                as usize;
            max_function_length = max_function_length.max(stats.complexity.max_function_length);
            min_function_length = min_function_length.min(stats.complexity.min_function_length);
            max_nesting_depth = max_nesting_depth.max(stats.complexity.max_nesting_depth);
            total_nesting_depth +=
                stats.complexity.average_nesting_depth * stats.complexity.function_count as f64;
            total_parameters += (stats.complexity.average_parameters_per_function
                * stats.complexity.function_count as f64) as usize;
            max_parameters = max_parameters.max(stats.complexity.max_parameters_per_function);

            // Merge complexity distribution
            merged_distribution.very_low_complexity +=
                stats.complexity.complexity_distribution.very_low_complexity;
            merged_distribution.low_complexity +=
                stats.complexity.complexity_distribution.low_complexity;
            merged_distribution.medium_complexity +=
                stats.complexity.complexity_distribution.medium_complexity;
            merged_distribution.high_complexity +=
                stats.complexity.complexity_distribution.high_complexity;
            merged_distribution.very_high_complexity += stats
                .complexity
                .complexity_distribution
                .very_high_complexity;

            // Merge extension complexity
            for (ext, ext_complexity) in &stats.complexity.complexity_by_extension {
                let entry = merged_complexity_by_extension
                    .entry(ext.clone())
                    .or_insert_with(|| crate::core::stats::complexity::ExtensionComplexity {
                        function_count: 0,
                        class_count: 0,
                        interface_count: 0,
                        trait_count: 0,
                        enum_count: 0,
                        struct_count: 0,
                        total_structures: 0,
                        cyclomatic_complexity: 0.0,
                        cognitive_complexity: 0.0,
                        maintainability_index: 0.0,
                        average_function_length: 0.0,
                        max_nesting_depth: 0,
                        average_nesting_depth: 0.0,
                        methods_per_class: 0.0,
                        average_parameters_per_function: 0.0,
                        quality_score: 0.0,
                    });

                let old_count = entry.function_count;
                entry.function_count += ext_complexity.function_count;

                // Weighted average for complexity
                entry.cyclomatic_complexity = if entry.function_count > 0 {
                    (entry.cyclomatic_complexity * old_count as f64
                        + ext_complexity.cyclomatic_complexity
                            * ext_complexity.function_count as f64)
                        / entry.function_count as f64
                } else {
                    0.0
                };

                // Weighted average for cognitive complexity
                entry.cognitive_complexity = if entry.function_count > 0 {
                    (entry.cognitive_complexity * old_count as f64
                        + ext_complexity.cognitive_complexity
                            * ext_complexity.function_count as f64)
                        / entry.function_count as f64
                } else {
                    0.0
                };

                // Weighted average for maintainability
                entry.maintainability_index = if entry.function_count > 0 {
                    (entry.maintainability_index * old_count as f64
                        + ext_complexity.maintainability_index
                            * ext_complexity.function_count as f64)
                        / entry.function_count as f64
                } else {
                    0.0
                };

                // Weighted average for function length
                entry.average_function_length = if entry.function_count > 0 {
                    (entry.average_function_length * old_count as f64
                        + ext_complexity.average_function_length
                            * ext_complexity.function_count as f64)
                        / entry.function_count as f64
                } else {
                    0.0
                };

                entry.max_nesting_depth = entry
                    .max_nesting_depth
                    .max(ext_complexity.max_nesting_depth);

                // Weighted average for nesting depth
                entry.average_nesting_depth = if entry.function_count > 0 {
                    (entry.average_nesting_depth * old_count as f64
                        + ext_complexity.average_nesting_depth
                            * ext_complexity.function_count as f64)
                        / entry.function_count as f64
                } else {
                    0.0
                };

                // Weighted average for parameters
                entry.average_parameters_per_function = if entry.function_count > 0 {
                    (entry.average_parameters_per_function * old_count as f64
                        + ext_complexity.average_parameters_per_function
                            * ext_complexity.function_count as f64)
                        / entry.function_count as f64
                } else {
                    0.0
                };

                // Weighted average for quality score
                entry.quality_score = if entry.function_count > 0 {
                    (entry.quality_score * old_count as f64
                        + ext_complexity.quality_score * ext_complexity.function_count as f64)
                        / entry.function_count as f64
                } else {
                    0.0
                };
            }
        }

        // Merge quality metrics
        let mut merged_quality_metrics = crate::core::stats::complexity::QualityMetrics {
            code_health_score: 0.0,
            maintainability_index: 0.0,
            documentation_coverage: 0.0,
            avg_complexity: 0.0,
            function_size_health: 0.0,
            nesting_depth_health: 0.0,
            code_duplication_ratio: 0.0,
            technical_debt_ratio: 0.0,
        };

        if !stats_list.is_empty() {
            for stats in stats_list {
                merged_quality_metrics.code_health_score +=
                    stats.complexity.quality_metrics.code_health_score;
                merged_quality_metrics.maintainability_index +=
                    stats.complexity.quality_metrics.maintainability_index;
                merged_quality_metrics.documentation_coverage +=
                    stats.complexity.quality_metrics.documentation_coverage;
                merged_quality_metrics.avg_complexity +=
                    stats.complexity.quality_metrics.avg_complexity;
                merged_quality_metrics.function_size_health +=
                    stats.complexity.quality_metrics.function_size_health;
                merged_quality_metrics.nesting_depth_health +=
                    stats.complexity.quality_metrics.nesting_depth_health;
                merged_quality_metrics.code_duplication_ratio +=
                    stats.complexity.quality_metrics.code_duplication_ratio;
                merged_quality_metrics.technical_debt_ratio +=
                    stats.complexity.quality_metrics.technical_debt_ratio;
            }

            let stats_count = stats_list.len() as f64;
            merged_quality_metrics.code_health_score /= stats_count;
            merged_quality_metrics.maintainability_index /= stats_count;
            merged_quality_metrics.documentation_coverage /= stats_count;
            merged_quality_metrics.avg_complexity /= stats_count;
            merged_quality_metrics.function_size_health /= stats_count;
            merged_quality_metrics.nesting_depth_health /= stats_count;
            merged_quality_metrics.code_duplication_ratio /= stats_count;
            merged_quality_metrics.technical_debt_ratio /= stats_count;
        }

        Ok(ComplexityStats {
            function_count: total_functions,
            class_count: 0,
            interface_count: 0,
            trait_count: 0,
            enum_count: 0,
            struct_count: 0,
            module_count: 0,
            total_structures: 0,
            cyclomatic_complexity: if total_functions > 0 {
                total_complexity / total_functions as f64
            } else {
                0.0
            },
            cognitive_complexity: if total_functions > 0 {
                total_cognitive_complexity / total_functions as f64
            } else {
                0.0
            },
            maintainability_index: if total_functions > 0 {
                total_maintainability / total_functions as f64
            } else {
                100.0
            },
            average_function_length: if total_functions > 0 {
                total_function_lines as f64 / total_functions as f64
            } else {
                0.0
            },
            max_function_length,
            min_function_length: if min_function_length == usize::MAX {
                0
            } else {
                min_function_length
            },
            max_nesting_depth,
            average_nesting_depth: if total_functions > 0 {
                total_nesting_depth / total_functions as f64
            } else {
                0.0
            },
            methods_per_class: 0.0,
            average_parameters_per_function: if total_functions > 0 {
                total_parameters as f64 / total_functions as f64
            } else {
                0.0
            },
            max_parameters_per_function: max_parameters,
            complexity_by_extension: merged_complexity_by_extension,
            complexity_distribution: merged_distribution,
            structure_distribution: crate::core::stats::complexity::StructureDistribution {
                classes: 0,
                interfaces: 0,
                traits: 0,
                enums: 0,
                structs: 0,
                modules: 0,
            },
            function_complexity_details: Vec::new(),
            quality_metrics: merged_quality_metrics,
        })
    }

    /// Merge ratio statistics
    pub fn merge_ratio_stats(&self, stats_list: &[AggregatedStats]) -> Result<RatioStats> {
        // Calculate overall ratios from merged basic stats
        let total_lines: usize = stats_list.iter().map(|s| s.basic.total_lines).sum();
        let total_code_lines: usize = stats_list.iter().map(|s| s.basic.code_lines).sum();
        let comment_lines = stats_list
            .iter()
            .map(|s| s.basic.comment_lines)
            .sum::<usize>();
        let doc_lines = stats_list.iter().map(|s| s.basic.doc_lines).sum::<usize>();
        let blank_lines = stats_list
            .iter()
            .map(|s| s.basic.blank_lines)
            .sum::<usize>();

        let total_lines_f64 = total_lines as f64;
        let _code_ratio = if total_lines_f64 > 0.0 {
            total_code_lines as f64 / total_lines_f64
        } else {
            0.0
        };
        let _comment_ratio = if total_lines_f64 > 0.0 {
            comment_lines as f64 / total_lines_f64
        } else {
            0.0
        };
        let _doc_ratio = if total_lines_f64 > 0.0 {
            doc_lines as f64 / total_lines_f64
        } else {
            0.0
        };
        let _blank_ratio = if total_lines_f64 > 0.0 {
            blank_lines as f64 / total_lines_f64
        } else {
            0.0
        };

        let _comment_to_code_ratio = if total_code_lines > 0 {
            comment_lines as f64 / total_code_lines as f64
        } else {
            0.0
        };
        let _doc_to_code_ratio = if total_code_lines > 0 {
            doc_lines as f64 / total_code_lines as f64
        } else {
            0.0
        };

        // Use the first stats' ratio calculator to recalculate everything
        let ratio_calculator = crate::core::stats::ratios::RatioStatsCalculator::new();

        // Create a temporary CodeStats for recalculation
        let mut temp_stats_by_extension = BTreeMap::new();
        for stats in stats_list {
            for (ext, ext_stats) in &stats.basic.stats_by_extension {
                let entry = temp_stats_by_extension.entry(ext.clone()).or_insert((
                    0,
                    FileStats {
                        total_lines: 0,
                        code_lines: 0,
                        comment_lines: 0,
                        blank_lines: 0,
                        file_size: 0,
                        doc_lines: 0,
                    },
                ));

                entry.0 += ext_stats.file_count;
                entry.1.total_lines += ext_stats.total_lines;
                entry.1.code_lines += ext_stats.code_lines;
                entry.1.comment_lines += ext_stats.comment_lines;
                entry.1.doc_lines += ext_stats.doc_lines;
                entry.1.blank_lines += ext_stats.blank_lines;
                entry.1.file_size += ext_stats.total_size;
            }
        }

        let temp_code_stats = CodeStats {
            total_files: stats_list.iter().map(|s| s.basic.total_files).sum(),
            total_lines,
            total_code_lines,
            total_comment_lines: comment_lines,
            total_blank_lines: blank_lines,
            total_size: stats_list.iter().map(|s| s.basic.total_size).sum(),
            total_doc_lines: doc_lines,
            stats_by_extension: temp_stats_by_extension,
        };

        ratio_calculator.calculate_project_ratio_stats(&temp_code_stats)
    }

    /// Merge metadata
    pub fn merge_metadata(&self, stats_list: &[AggregatedStats]) -> Result<StatsMetadata> {
        let total_calculation_time = stats_list
            .iter()
            .map(|s| s.metadata.calculation_time_ms)
            .sum();
        let total_files = stats_list
            .iter()
            .map(|s| s.metadata.file_count_analyzed)
            .sum();
        let total_bytes = stats_list
            .iter()
            .map(|s| s.metadata.total_bytes_analyzed)
            .sum();

        let mut all_languages = std::collections::HashSet::new();
        for stats in stats_list {
            for lang in &stats.metadata.languages_detected {
                all_languages.insert(lang.clone());
            }
        }

        let mut languages_detected: Vec<String> = all_languages.into_iter().collect();
        languages_detected.sort();

        Ok(StatsMetadata {
            calculation_time_ms: total_calculation_time,
            version: self.version.clone(),
            timestamp: chrono::Utc::now().to_rfc3339(),
            file_count_analyzed: total_files,
            total_bytes_analyzed: total_bytes,
            languages_detected,
            analysis_depth: super::types::AnalysisDepth::Complete,
        })
    }
}

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