code-search-cli 0.3.3

Intelligent code search tool for tracing text (UI text, function names, variables) to implementation code
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

use cs::output::formatter::TreeFormatter;
use cs::trace::{CallNode, CallTree, FunctionDef, TraceDirection};
use regex::Regex;
use std::path::PathBuf;

fn create_test_function(name: &str, file: &str, line: usize) -> FunctionDef {
    FunctionDef {
        name: name.to_string(),
        file: PathBuf::from(file),
        line,
        body: String::new(),
    }
}

fn strip_ansi_codes(s: &str) -> String {
    let re = Regex::new(r"\x1B\[[0-?]*[ -/]*[@-~]").unwrap();
    re.replace_all(s, "").to_string()
}

#[test]
fn test_format_forward_tree() {
    let root_func = create_test_function("root", "root.rs", 1);
    let child_func = create_test_function("child", "child.rs", 10);

    let child_node = CallNode {
        def: child_func,
        children: vec![],
        truncated: false,
    };

    let root_node = CallNode {
        def: root_func,
        children: vec![child_node],
        truncated: false,
    };

    let tree = CallTree { root: root_node };
    let formatter = TreeFormatter::new();
    let output = formatter.format_trace_tree(&tree, TraceDirection::Forward);

    assert!(output.contains("root"));
    assert!(output.contains("child"));
    assert!(output.contains("└─>"));
}

#[test]
fn test_format_backward_tree() {
    // Structure: caller -> callee -> target
    // Tree: target (root) <- callee (child) <- caller (grandchild)

    let target_func = create_test_function("target", "target.rs", 1);
    let callee_func = create_test_function("callee", "callee.rs", 10);
    let caller_func = create_test_function("caller", "caller.rs", 20);

    let caller_node = CallNode {
        def: caller_func,
        children: vec![],
        truncated: false,
    };

    let callee_node = CallNode {
        def: callee_func,
        children: vec![caller_node],
        truncated: false,
    };

    let root_node = CallNode {
        def: target_func,
        children: vec![callee_node],
        truncated: false,
    };

    let tree = CallTree { root: root_node };
    let formatter = TreeFormatter::new();
    let output = formatter.format_trace_tree(&tree, TraceDirection::Backward);

    // Should show chain: caller (file:line) -> callee (file:line) -> target (file:line)
    let stripped_output = strip_ansi_codes(&output);
    assert!(stripped_output
        .contains("caller (caller.rs:20) -> callee (callee.rs:10) -> target (target.rs:1)"));
}

#[test]
fn test_format_truncated_node() {
    let root_func = create_test_function("root", "root.rs", 1);

    let root_node = CallNode {
        def: root_func,
        children: vec![],
        truncated: true,
    };

    let tree = CallTree { root: root_node };
    let formatter = TreeFormatter::new();
    let output = formatter.format_trace_tree(&tree, TraceDirection::Forward);

    assert!(output.contains("[depth limit reached]"));
}