sarah 0.1.9

Count tokens, lines and function sizes per file to help AI agents decide what to refactor
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

use std::collections::{BTreeMap, BTreeSet};
use std::path::{Path, PathBuf};

use serde::{Deserialize, Serialize};

use crate::count::FileStats;
use crate::units::{Depth, Lines, Tokens};

/// Totals for one folder. The analyzed root is `.`.
#[derive(Clone, Debug, Serialize, Deserialize)]
pub struct DirStats {
    pub path: PathBuf,
    /// Levels below the root (the root is 0).
    pub depth: Depth,
    /// Files directly in the folder.
    pub files: usize,
    /// Folders directly in the folder.
    pub dirs: usize,
    /// Files in the whole subtree.
    pub total_files: usize,
    /// Lines in the whole subtree.
    pub lines: Lines,
    /// Tokens in the whole subtree.
    pub tokens: Tokens,
}

pub struct DirNode {
    pub stats: DirStats,
    pub file_names: Vec<String>,
    pub dir_names: BTreeSet<String>,
}

/// Folders that hold at least one analyzed file, keyed by path relative to the root.
pub struct DirTree {
    nodes: BTreeMap<PathBuf, DirNode>,
}

impl DirTree {
    pub fn build(files: &[FileStats]) -> Self {
        let mut tree = Self {
            nodes: BTreeMap::new(),
        };
        tree.node(Path::new(""));
        for f in files {
            tree.add_file(f);
        }
        tree.count_children();
        tree
    }

    pub fn nodes(&self) -> impl Iterator<Item = &DirNode> {
        self.nodes.values()
    }

    pub fn stats(&self) -> Vec<DirStats> {
        self.nodes.values().map(|n| n.stats.clone()).collect()
    }

    fn add_file(&mut self, f: &FileStats) {
        let parent = f.path.parent().unwrap_or(Path::new(""));
        if let Some(name) = f.path.file_name() {
            let name = name.to_string_lossy().into_owned();
            self.node(parent).file_names.push(name);
        }
        let mut child: Option<&Path> = None;
        for dir in parent.ancestors() {
            let node = self.node(dir);
            node.stats.total_files = node.stats.total_files.saturating_add(1);
            node.stats.lines = node.stats.lines.saturating_add(f.lines);
            node.stats.tokens = node.stats.tokens.saturating_add(f.tokens);
            if let Some(name) = child.and_then(Path::file_name) {
                node.dir_names.insert(name.to_string_lossy().into_owned());
            }
            child = Some(dir);
        }
    }

    fn count_children(&mut self) {
        for node in self.nodes.values_mut() {
            node.stats.files = node.file_names.len();
            node.stats.dirs = node.dir_names.len();
        }
    }

    /// The node for `dir` (`""` is the root), created on first use.
    fn node(&mut self, dir: &Path) -> &mut DirNode {
        let key = if dir.as_os_str().is_empty() {
            PathBuf::from(".")
        } else {
            dir.to_path_buf()
        };
        let depth = Depth(dir.components().count());
        self.nodes.entry(key.clone()).or_insert_with(|| DirNode {
            stats: DirStats {
                path: key,
                depth,
                files: 0,
                dirs: 0,
                total_files: 0,
                lines: Lines(0),
                tokens: Tokens(0),
            },
            file_names: Vec::new(),
            dir_names: BTreeSet::new(),
        })
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::allow::Allows;
    use crate::units::Bytes;

    fn file(path: &str, tokens: usize) -> FileStats {
        FileStats {
            path: path.into(),
            language: "Rust".into(),
            bytes: Bytes(0),
            lines: Lines(1),
            code: Lines(1),
            comments: Lines(0),
            blanks: Lines(0),
            tokens: Tokens(tokens),
            functions: None,
            allows: Allows::default(),
        }
    }

    #[test]
    fn builds_totals_and_children() {
        let tree = DirTree::build(&[
            file("main.rs", 1),
            file("src/a.rs", 10),
            file("src/x/b.rs", 100),
            file("src/x/y/c.rs", 1000),
        ]);
        let stats: Vec<_> = tree
            .stats()
            .into_iter()
            .map(|s| {
                (
                    s.path,
                    s.depth.0,
                    s.files,
                    s.dirs,
                    s.total_files,
                    s.tokens.0,
                )
            })
            .collect();
        assert_eq!(
            stats,
            vec![
                (".".into(), 0, 1, 1, 4, 1111),
                ("src".into(), 1, 1, 1, 3, 1110),
                ("src/x".into(), 2, 1, 1, 2, 1100),
                ("src/x/y".into(), 3, 1, 0, 1, 1000),
            ]
        );
    }
}