selfware 0.6.0

Your personal AI workshop — software you own, software that lasts
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

use selfware::evolve::dedup::{jaccard, DeduplicationAnalyzer, DuplicateKind, DuplicatePair};
use selfware::evolve::{Graph, Node};
use std::collections::HashSet;

#[test]
fn test_dedup_finds_no_duplicates_in_clean_repo() {
    let graph = Graph {
        nodes: vec![],
        edges: vec![],
    };
    let dedup = DeduplicationAnalyzer::new();
    let dupes = dedup.find_duplicates(&graph).unwrap();
    assert!(dupes.is_empty());
}

#[test]
fn test_dedup_finds_exact_duplicates() {
    let dir = tempfile::tempdir().unwrap();
    let a = dir.path().join("a.rs");
    let b = dir.path().join("b.rs");
    let c = dir.path().join("c.rs");
    std::fs::write(&a, "fn hello() { println!(\"hi\"); }\n").unwrap();
    std::fs::write(&b, "fn hello() { println!(\"hi\"); }\n").unwrap();
    std::fs::write(&c, "fn world() { println!(\"bye\"); }\n").unwrap();

    let graph = Graph {
        nodes: vec![
            Node::code("a", a.to_str().unwrap()),
            Node::code("b", b.to_str().unwrap()),
            Node::code("c", c.to_str().unwrap()),
        ],
        edges: vec![],
    };
    let dedup = DeduplicationAnalyzer::new();
    let dupes = dedup.find_duplicates(&graph).unwrap();
    assert_eq!(
        dupes,
        vec![DuplicatePair {
            first: "a".to_string(),
            second: "b".to_string(),
            kind: DuplicateKind::Exact,
        }]
    );
}
#[test]
fn test_dedup_finds_near_duplicates() {
    let dir = tempfile::tempdir().unwrap();
    let body: String = (0..20).map(|i| format!("let x{i} = {i};\n")).collect();
    let mut near = body.clone();
    near.push_str("let extra = 1;\n");

    let a = dir.path().join("a.rs");
    let b = dir.path().join("b.rs");
    std::fs::write(&a, &body).unwrap();
    std::fs::write(&b, &near).unwrap();

    let graph = Graph {
        nodes: vec![
            Node::code("a", a.to_str().unwrap()),
            Node::code("b", b.to_str().unwrap()),
        ],
        edges: vec![],
    };
    let dedup = DeduplicationAnalyzer::new();
    let dupes = dedup.find_duplicates(&graph).unwrap();
    assert_eq!(
        dupes,
        vec![DuplicatePair {
            first: "a".to_string(),
            second: "b".to_string(),
            kind: DuplicateKind::Near,
        }]
    );
}

#[test]
fn test_dedup_ignores_unreadable_paths() {
    let graph = Graph {
        nodes: vec![
            Node::code("missing1", "/nonexistent/path/one"),
            Node::code("missing2", "/nonexistent/path/two"),
        ],
        edges: vec![],
    };
    let dedup = DeduplicationAnalyzer::new();
    let dupes = dedup.find_duplicates(&graph).unwrap();
    assert!(dupes.is_empty());
}

#[test]
fn test_dedup_skips_directories_without_rs_files() {
    let dir = tempfile::tempdir().unwrap();
    let empty_a = dir.path().join("empty_a");
    let empty_b = dir.path().join("empty_b");
    std::fs::create_dir(&empty_a).unwrap();
    std::fs::create_dir(&empty_b).unwrap();

    let graph = Graph {
        nodes: vec![
            Node::code("empty_a", empty_a.to_str().unwrap()),
            Node::code("empty_b", empty_b.to_str().unwrap()),
        ],
        edges: vec![],
    };
    let dedup = DeduplicationAnalyzer::new();
    let dupes = dedup.find_duplicates(&graph).unwrap();
    assert!(dupes.is_empty());
}

#[test]
fn test_jaccard_returns_zero_for_two_empty_sets() {
    let a = HashSet::new();
    let b = HashSet::new();
    assert_eq!(jaccard(&a, &b), 0.0);
}