duvis 0.1.0

Disk usage visualizer for both AI and humans
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

use std::collections::HashMap;
use std::io::{self, Write};

use super::format::format_size;
use crate::category::Category;
use crate::entry::Entry;

struct CategoryStats {
    size: u64,
    count: u64,
}

pub fn write(entry: &Entry, out: &mut impl Write) -> io::Result<()> {
    let mut stats: HashMap<Category, CategoryStats> = HashMap::new();
    collect_stats(entry, &mut stats);

    writeln!(out, "Total: {}", format_size(entry.size))?;
    writeln!(out)?;
    writeln!(out, "Category Summary:")?;

    let mut sorted: Vec<_> = stats.into_iter().collect();
    // Primary: size desc. Tiebreak by category label so equal-size buckets
    // come out in a stable order across runs (HashMap iteration is random).
    sorted.sort_by(|a, b| {
        b.1.size
            .cmp(&a.1.size)
            .then_with(|| a.0.label().cmp(b.0.label()))
    });

    let mut deletable_total: u64 = 0;

    for (category, stat) in &sorted {
        let pct = (stat.size * 100).checked_div(entry.size).unwrap_or(0);
        let hint = category.deletable_hint();
        let hint_str = if hint.is_empty() {
            String::new()
        } else {
            format!("  ({})", hint)
        };
        writeln!(
            out,
            "  {:<8} {:>10}  {:>3}%  {} items{}",
            category.label(),
            format_size(stat.size),
            pct,
            stat.count,
            hint_str,
        )?;

        if category.is_deletable() {
            deletable_total += stat.size;
        }
    }

    if deletable_total > 0 {
        writeln!(out)?;
        writeln!(
            out,
            "Potentially reclaimable: {} (cache + build + log)",
            format_size(deletable_total),
        )?;
    }
    Ok(())
}

fn collect_stats(entry: &Entry, stats: &mut HashMap<Category, CategoryStats>) {
    if !entry.is_dir {
        let stat = stats
            .entry(entry.category)
            .or_insert(CategoryStats { size: 0, count: 0 });
        stat.size += entry.size;
        stat.count += 1;
        return;
    }

    // For directories with a non-Other category, count the whole dir as that category
    if entry.category != Category::Other {
        let stat = stats
            .entry(entry.category)
            .or_insert(CategoryStats { size: 0, count: 0 });
        stat.size += entry.size;
        stat.count += 1;
        return;
    }

    // For Other directories, recurse into children
    if let Some(children) = &entry.children {
        for child in children {
            collect_stats(child, stats);
        }
    }
}