agentic-codebase 0.3.0

Semantic code compiler for AI agents - transforms codebases into navigable concept graphs
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

//! Index by code unit type.
//!
//! Groups code units by their [`CodeUnitType`] for fast filtered lookups.
//! Building the index is O(n) in the number of units; lookups are O(1).

use std::collections::HashMap;

use crate::graph::CodeGraph;
use crate::types::CodeUnitType;

/// Index that groups code units by their type.
#[derive(Debug, Clone, Default)]
pub struct TypeIndex {
    by_type: HashMap<CodeUnitType, Vec<u64>>,
}

impl TypeIndex {
    /// Build a `TypeIndex` from all code units in the given graph.
    pub fn build(graph: &CodeGraph) -> Self {
        let mut by_type: HashMap<CodeUnitType, Vec<u64>> = HashMap::new();

        for unit in graph.units() {
            by_type.entry(unit.unit_type).or_default().push(unit.id);
        }

        Self { by_type }
    }

    /// Look up all unit IDs of the given type.
    ///
    /// Returns an empty slice if no units match.
    pub fn lookup(&self, unit_type: CodeUnitType) -> &[u64] {
        self.by_type
            .get(&unit_type)
            .map(|v| v.as_slice())
            .unwrap_or(&[])
    }

    /// Returns the count of units of the given type.
    pub fn count(&self, unit_type: CodeUnitType) -> usize {
        self.by_type.get(&unit_type).map(|v| v.len()).unwrap_or(0)
    }

    /// Returns all code unit types present in the index.
    pub fn types(&self) -> Vec<CodeUnitType> {
        self.by_type.keys().copied().collect()
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::graph::CodeGraph;
    use crate::types::{CodeUnit, CodeUnitType, Language, Span};
    use std::path::PathBuf;

    fn make_unit(unit_type: CodeUnitType) -> CodeUnit {
        CodeUnit::new(
            unit_type,
            Language::Rust,
            "test_unit".to_string(),
            "mod::test_unit".to_string(),
            PathBuf::from("src/lib.rs"),
            Span::new(1, 0, 10, 0),
        )
    }

    #[test]
    fn test_empty_index() {
        let graph = CodeGraph::default();
        let index = TypeIndex::build(&graph);
        assert_eq!(index.count(CodeUnitType::Function), 0);
        assert_eq!(index.lookup(CodeUnitType::Function), &[] as &[u64]);
        assert!(index.types().is_empty());
    }

    #[test]
    fn test_grouped_lookup() {
        let mut graph = CodeGraph::default();
        graph.add_unit(make_unit(CodeUnitType::Function));
        graph.add_unit(make_unit(CodeUnitType::Function));
        graph.add_unit(make_unit(CodeUnitType::Module));
        graph.add_unit(make_unit(CodeUnitType::Type));

        let index = TypeIndex::build(&graph);
        assert_eq!(index.count(CodeUnitType::Function), 2);
        assert_eq!(index.count(CodeUnitType::Module), 1);
        assert_eq!(index.count(CodeUnitType::Type), 1);
        assert_eq!(index.count(CodeUnitType::Import), 0);

        assert_eq!(index.lookup(CodeUnitType::Function), &[0, 1]);
        assert_eq!(index.lookup(CodeUnitType::Module), &[2]);
    }

    #[test]
    fn test_types_list() {
        let mut graph = CodeGraph::default();
        graph.add_unit(make_unit(CodeUnitType::Function));
        graph.add_unit(make_unit(CodeUnitType::Trait));

        let index = TypeIndex::build(&graph);
        let mut types = index.types();
        types.sort_by_key(|t| *t as u8);
        assert_eq!(types, vec![CodeUnitType::Function, CodeUnitType::Trait]);
    }
}