lean-ctx 3.9.5

Context Runtime for AI Agents with CCP. 71 MCP tools, 10 read modes, 95+ compression patterns, cross-session memory (CCP), persistent AI knowledge with temporal facts + contradiction detection, multi-agent context sharing, LITM-aware positioning, AAAK compact format, adaptive compression with Thompson Sampling bandits. Supports 24+ AI tools. Reduces LLM token consumption by up to 99%.
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

//! Shared AST helpers for the code-health engine.
//!
//! Function enumeration and identifier extraction live here so every health
//! metric (cognitive complexity, naming) scores the *same* set of
//! function-like nodes, mirroring the structural-chunk walk used by
//! [`crate::core::cyclomatic`]. Tree-sitter only; the public engine functions
//! degrade to `None` when the feature is disabled.

#[cfg(feature = "tree-sitter")]
use tree_sitter::Node;

/// Function-like node kinds across the supported grammars. A node of one of
/// these kinds is its own complexity scope (nested ones are scored separately).
#[cfg(feature = "tree-sitter")]
pub(crate) fn is_fn_like(kind: &str) -> bool {
    matches!(
        kind,
        "function_item"
            | "function_declaration"
            | "function_definition"
            | "closure_expression"
            | "arrow_function"
            | "method_definition"
            | "method_declaration"
            | "constructor_declaration"
            | "lambda"
            | "func_literal"
    )
}

/// Best-effort identifier name for a function-like node.
#[cfg(feature = "tree-sitter")]
pub(crate) fn fn_name(node: Node, source: &[u8]) -> Option<String> {
    let mut cursor = node.walk();
    for child in node.children(&mut cursor) {
        match child.kind() {
            "identifier" | "type_identifier" | "property_identifier" | "field_identifier" => {
                if let Ok(t) = child.utf8_text(source) {
                    return Some(t.to_string());
                }
            }
            _ => {}
        }
    }
    None
}

/// The logical body subtree of a function-like node (its `body`/`value` field,
/// falling back to the node itself for grammars without an explicit body field).
#[cfg(feature = "tree-sitter")]
pub(crate) fn logical_body_root(fn_like: Node<'_>) -> Node<'_> {
    fn_like
        .child_by_field_name("body")
        .or_else(|| fn_like.child_by_field_name("value"))
        .unwrap_or(fn_like)
}

/// Visit every function-like node under the structural chunks of `content`.
///
/// The callback receives `(fn_node, name, source_bytes)`. Each function is
/// visited exactly once even when grammars match nested functions as their own
/// chunks (deduplicated by start byte). Returns `None` when `ext` is
/// unsupported or parsing fails.
#[cfg(feature = "tree-sitter")]
pub(crate) fn for_each_function(
    content: &str,
    ext: &str,
    mut visit: impl FnMut(Node, &str, &[u8]),
) -> Option<()> {
    let source = content.as_bytes();
    let mut seen: std::collections::HashSet<usize> = std::collections::HashSet::new();
    crate::core::chunks_ts::for_each_chunk_node(content, ext, |chunk_root, _name, _kind, _, _| {
        crate::core::ast_walk::for_each_descendant(chunk_root, |node| {
            if is_fn_like(node.kind()) && seen.insert(node.start_byte()) {
                let name = fn_name(node, source).unwrap_or_else(|| "<anonymous>".to_string());
                visit(node, &name, source);
            }
        });
    })
}