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

#[cfg(test)]
mod cleanup_tests {
    use std::path::PathBuf;

    // Mock function to demonstrate testing pattern
    fn cleanup_worktrees(paths: &[PathBuf]) -> Result<Vec<PathBuf>, String> {
        let mut cleaned = Vec::new();
        for path in paths {
            if path.exists() {
                // Simulate cleanup logic
                cleaned.push(path.clone());
            }
        }
        Ok(cleaned)
    }

    #[test]
    fn test_cleanup_empty_list() {
        let paths: Vec<PathBuf> = vec![];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        assert_eq!(result.unwrap().len(), 0);
    }

    #[test]
    fn test_cleanup_single_path() {
        let paths = vec![PathBuf::from("/tmp")];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        let cleaned = result.unwrap();
        assert_eq!(cleaned.len(), 1);
        assert_eq!(cleaned[0], PathBuf::from("/tmp"));
    }

    #[test]
    fn test_cleanup_multiple_paths() {
        let paths = vec![
            PathBuf::from("/tmp"),
            PathBuf::from("/var"),
            PathBuf::from("/usr"),
        ];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        let cleaned = result.unwrap();
        assert!(cleaned.len() <= 3);
    }

    #[test]
    fn test_cleanup_with_duplicates() {
        let paths = vec![
            PathBuf::from("/tmp"),
            PathBuf::from("/tmp"),
            PathBuf::from("/var"),
        ];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        // The mock function doesn't deduplicate, but a real implementation should
        let cleaned = result.unwrap();
        // For this test, we're just verifying the function handles duplicates without error
        assert!(cleaned.len() <= paths.len());
    }

    #[test]
    fn test_cleanup_invalid_paths() {
        let paths = vec![
            PathBuf::from("/nonexistent/path/that/does/not/exist"),
            PathBuf::from("/another/invalid/path"),
        ];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        let cleaned = result.unwrap();
        assert_eq!(cleaned.len(), 0);
    }

    #[test]
    fn test_cleanup_mixed_valid_invalid() {
        let paths = vec![
            PathBuf::from("/tmp"),
            PathBuf::from("/nonexistent/path"),
            PathBuf::from("/usr"),
        ];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        let cleaned = result.unwrap();
        assert!(cleaned.len() <= 2);
    }

    #[test]
    fn test_cleanup_handles_errors() {
        // Test error conditions
        let paths = vec![PathBuf::from("")];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok()); // Empty path should be handled gracefully
    }

    #[test]
    fn test_cleanup_preserves_order() {
        let paths = vec![
            PathBuf::from("/a"),
            PathBuf::from("/b"),
            PathBuf::from("/c"),
        ];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        // Order should be preserved in cleanup
    }
}