talon-core 0.4.2

Core retrieval engine for Talon: hybrid search (BM25 + semantic + reranker), indexing, and graph-aware ranking over markdown corpora.
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
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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181

use std::collections::BTreeMap;

use crate::graph::{GraphEdge, GraphNode, GraphSnapshot, detect_communities};

#[test]
fn communities_are_stable_for_two_clusters_and_bridge() {
    let mut snapshot = fixture_snapshot();
    let first = detect_communities(&mut snapshot);
    let first_assignments = assignments(&snapshot);

    let mut second_snapshot = fixture_snapshot();
    let second = detect_communities(&mut second_snapshot);
    assert_eq!(first, second);
    assert_eq!(first_assignments, assignments(&second_snapshot));
    assert!(first.len() >= 2);
}

#[test]
fn bridge_node_records_neighboring_communities() {
    let mut snapshot = fixture_snapshot();
    let _ = detect_communities(&mut snapshot);

    let Some(bridge) = snapshot.nodes.get("Bridge.md") else {
        panic!("missing bridge node");
    };
    assert!(bridge.community_neighbor_count >= 1);
    assert!(bridge.bridge_weight > 0.0);
}

#[test]
fn source_overlap_does_not_create_community_edges() {
    let mut snapshot = GraphSnapshot {
        nodes: BTreeMap::from([("A.md".into(), node("A.md")), ("B.md".into(), node("B.md"))]),
        source_citations: BTreeMap::from([(
            "Shared.md".into(),
            ["A.md".into(), "B.md".into()].into_iter().collect(),
        )]),
        ..GraphSnapshot::default()
    };
    let communities = detect_communities(&mut snapshot);
    assert_eq!(communities.len(), 2);
}

#[test]
fn community_summaries_include_cohesion_and_top_nodes() {
    let mut snapshot = disconnected_triangles();

    let communities = detect_communities(&mut snapshot);

    assert_eq!(communities.len(), 2);
    assert!(
        communities
            .iter()
            .all(|community| community.node_count == 3)
    );
    assert!(
        communities
            .iter()
            .all(|community| community.cohesion > 0.99)
    );
    assert!(
        communities
            .iter()
            .all(|community| community.top_nodes.len() == 3)
    );
}

#[test]
fn community_ids_are_renumbered_stably_by_size_then_path() {
    let mut snapshot = GraphSnapshot {
        nodes: [
            "SmallA.md",
            "SmallB.md",
            "LargeA.md",
            "LargeB.md",
            "LargeC.md",
        ]
        .into_iter()
        .map(|path| (path.to_string(), node(path)))
        .collect(),
        edges: vec![
            edge("LargeA.md", "LargeB.md", 3),
            edge("LargeB.md", "LargeC.md", 3),
            edge("LargeA.md", "LargeC.md", 3),
            edge("SmallA.md", "SmallB.md", 3),
        ],
        ..GraphSnapshot::default()
    };

    let _ = detect_communities(&mut snapshot);

    assert_eq!(snapshot.nodes["LargeA.md"].community_id, Some(0));
    assert_eq!(snapshot.nodes["LargeB.md"].community_id, Some(0));
    assert_eq!(snapshot.nodes["LargeC.md"].community_id, Some(0));
    assert_eq!(snapshot.nodes["SmallA.md"].community_id, Some(1));
    assert_eq!(snapshot.nodes["SmallB.md"].community_id, Some(1));
}

fn assignments(snapshot: &GraphSnapshot) -> BTreeMap<String, Option<u32>> {
    snapshot
        .nodes
        .iter()
        .map(|(path, node)| (path.clone(), node.community_id))
        .collect()
}

fn disconnected_triangles() -> GraphSnapshot {
    GraphSnapshot {
        nodes: ["A1.md", "A2.md", "A3.md", "B1.md", "B2.md", "B3.md"]
            .into_iter()
            .map(|path| (path.to_string(), node(path)))
            .collect(),
        edges: vec![
            edge("A1.md", "A2.md", 3),
            edge("A2.md", "A3.md", 3),
            edge("A1.md", "A3.md", 3),
            edge("B1.md", "B2.md", 2),
            edge("B2.md", "B3.md", 4),
            edge("B1.md", "B3.md", 1),
        ],
        ..GraphSnapshot::default()
    }
}

fn fixture_snapshot() -> GraphSnapshot {
    let paths = [
        "A1.md",
        "A2.md",
        "A3.md",
        "Bridge.md",
        "B1.md",
        "B2.md",
        "B3.md",
    ];
    GraphSnapshot {
        nodes: paths
            .into_iter()
            .map(|path| (path.to_string(), node(path)))
            .collect(),
        edges: vec![
            edge("A1.md", "A2.md", 3),
            edge("A2.md", "A3.md", 3),
            edge("A1.md", "A3.md", 3),
            edge("B1.md", "B2.md", 3),
            edge("B2.md", "B3.md", 3),
            edge("B1.md", "B3.md", 3),
            edge("A3.md", "Bridge.md", 1),
            edge("Bridge.md", "B1.md", 1),
        ],
        ..GraphSnapshot::default()
    }
}

fn node(path: &str) -> GraphNode {
    GraphNode {
        vault_path: path.into(),
        title: path.into(),
        aliases: Vec::new(),
        tags: Vec::new(),
        scope: String::new(),
        note_type: None,
        sources: Vec::new(),
        outgoing_degree: 0,
        backlink_degree: 0,
        total_degree: 0,
        structural: false,
        community_id: None,
        community_cohesion: 0.0,
        community_neighbor_count: 0,
        bridge_weight: 0.0,
    }
}

fn edge(from_path: &str, to_path: &str, weight: u32) -> GraphEdge {
    GraphEdge {
        from_path: from_path.into(),
        to_path: to_path.into(),
        link_text: to_path.into(),
        weight,
    }
}