debtmap 0.22.0

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

#[cfg(test)]
mod cleanup_tests {
    use std::fs;
    use std::path::PathBuf;
    use tempfile::{TempDir, tempdir};

    // Mock function to demonstrate testing pattern
    fn cleanup_worktrees(paths: &[PathBuf]) -> Result<Vec<PathBuf>, String> {
        Ok(paths.iter().filter(|path| path.exists()).cloned().collect())
    }

    fn existing_paths(names: &[&str]) -> (TempDir, Vec<PathBuf>) {
        let dir = tempdir().expect("create temp test directory");
        let paths = names
            .iter()
            .map(|name| create_dir(dir.path().join(name)))
            .collect();
        (dir, paths)
    }

    fn create_dir(path: PathBuf) -> PathBuf {
        fs::create_dir(&path).expect("create test path");
        path
    }

    #[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 (_dir, paths) = existing_paths(&["worktree"]);
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        let cleaned = result.unwrap();
        assert_eq!(cleaned.len(), 1);
        assert_eq!(cleaned[0], paths[0]);
    }

    #[test]
    fn test_cleanup_multiple_paths() {
        let (_dir, paths) = existing_paths(&["one", "two", "three"]);
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        let cleaned = result.unwrap();
        assert_eq!(cleaned.len(), 3);
    }

    #[test]
    fn test_cleanup_with_duplicates() {
        let (_dir, existing) = existing_paths(&["one", "two"]);
        let paths = vec![
            existing[0].clone(),
            existing[0].clone(),
            existing[1].clone(),
        ];
        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 dir = tempdir().expect("create temp test directory");
        let paths = vec![
            dir.path().join("missing-one"),
            dir.path().join("missing-two"),
        ];
        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 (_dir, existing) = existing_paths(&["one", "two"]);
        let paths = vec![
            existing[0].clone(),
            existing[0].with_file_name("missing"),
            existing[1].clone(),
        ];
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        let cleaned = result.unwrap();
        assert_eq!(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 (_dir, paths) = existing_paths(&["a", "b", "c"]);
        let result = cleanup_worktrees(&paths);
        assert!(result.is_ok());
        assert_eq!(result.unwrap(), paths);
    }
}